/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:01:51,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:01:51,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:01:51,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:01:51,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:01:51,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:01:51,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:01:51,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:01:51,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:01:51,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:01:51,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:01:51,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:01:51,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:01:51,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:01:51,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:01:51,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:01:51,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:01:51,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:01:51,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:01:51,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:01:51,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:01:51,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:01:51,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:01:51,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:01:51,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:01:51,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:01:51,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:01:51,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:01:51,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:01:51,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:01:51,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:01:51,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:01:51,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:01:51,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:01:51,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:01:51,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:01:51,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:01:51,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:01:51,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:01:51,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:01:51,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:01:51,809 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:01:51,824 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:01:51,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:01:51,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:01:51,825 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:01:51,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:01:51,826 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:01:51,826 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:01:51,826 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:01:51,826 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:01:51,826 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:01:51,826 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:01:51,827 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:01:51,827 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:01:51,827 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:01:51,827 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:01:51,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:01:51,828 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:01:51,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:01:51,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:01:51,828 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:01:51,828 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:01:51,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:01:51,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:01:51,829 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:01:51,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:01:51,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:01:51,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:01:51,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:01:51,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:01:52,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:01:52,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:01:52,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:01:52,021 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:01:52,021 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:01:52,022 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:01:52,092 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_KHizux/tmp/ba018791adc445f39d653ff30b820b58/FLAG9a4bc6d0c [2020-07-01 13:01:52,439 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:01:52,440 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:01:52,440 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:01:52,447 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_KHizux/tmp/ba018791adc445f39d653ff30b820b58/FLAG9a4bc6d0c [2020-07-01 13:01:52,838 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_KHizux/tmp/ba018791adc445f39d653ff30b820b58 [2020-07-01 13:01:52,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:01:52,851 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:01:52,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:01:52,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:01:52,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:01:52,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:01:52" (1/1) ... [2020-07-01 13:01:52,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1dd198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:52, skipping insertion in model container [2020-07-01 13:01:52,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:01:52" (1/1) ... [2020-07-01 13:01:52,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:01:52,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:01:53,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:01:53,134 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:01:53,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:01:53,168 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:01:53,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53 WrapperNode [2020-07-01 13:01:53,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:01:53,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:01:53,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:01:53,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:01:53,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (1/1) ... [2020-07-01 13:01:53,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (1/1) ... [2020-07-01 13:01:53,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:01:53,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:01:53,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:01:53,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:01:53,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (1/1) ... [2020-07-01 13:01:53,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (1/1) ... [2020-07-01 13:01:53,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (1/1) ... [2020-07-01 13:01:53,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (1/1) ... [2020-07-01 13:01:53,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (1/1) ... [2020-07-01 13:01:53,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (1/1) ... [2020-07-01 13:01:53,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (1/1) ... [2020-07-01 13:01:53,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:01:53,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:01:53,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:01:53,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:01:53,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:01:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:01:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:01:53,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:01:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:01:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:01:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:01:53,565 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:01:53,565 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 13:01:53,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:01:53 BoogieIcfgContainer [2020-07-01 13:01:53,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:01:53,570 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:01:53,570 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:01:53,572 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:01:53,573 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:01:53" (1/1) ... [2020-07-01 13:01:53,588 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 38 edges [2020-07-01 13:01:53,589 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:01:53,590 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:01:53,590 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:01:53,591 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:01:53,593 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:01:53,594 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:01:53,594 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:01:53,616 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:01:53,644 INFO L200 BlockEncoder]: SBE split 13 edges [2020-07-01 13:01:53,649 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 13:01:53,651 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:01:53,682 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 13:01:53,684 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:01:53,686 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:01:53,686 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:01:53,686 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:01:53,687 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:01:53,687 INFO L313 BlockEncoder]: Encoded RCFG 25 locations, 41 edges [2020-07-01 13:01:53,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:01:53 BasicIcfg [2020-07-01 13:01:53,688 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:01:53,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:01:53,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:01:53,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:01:53,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:01:52" (1/4) ... [2020-07-01 13:01:53,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e50e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:01:53, skipping insertion in model container [2020-07-01 13:01:53,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (2/4) ... [2020-07-01 13:01:53,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e50e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:01:53, skipping insertion in model container [2020-07-01 13:01:53,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:01:53" (3/4) ... [2020-07-01 13:01:53,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e50e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:01:53, skipping insertion in model container [2020-07-01 13:01:53,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:01:53" (4/4) ... [2020-07-01 13:01:53,697 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:01:53,707 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:01:53,715 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2020-07-01 13:01:53,729 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-07-01 13:01:53,753 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:01:53,753 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:01:53,754 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:01:53,754 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:01:53,754 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:01:53,754 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:01:53,754 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:01:53,754 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:01:53,770 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-01 13:01:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:01:53,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:01:53,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:01:53,777 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:01:53,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:01:53,783 INFO L82 PathProgramCache]: Analyzing trace with hash 823111807, now seen corresponding path program 1 times [2020-07-01 13:01:53,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:01:53,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841532384] [2020-07-01 13:01:53,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:01:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:01:53,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841532384] [2020-07-01 13:01:53,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:01:53,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:01:53,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947327884] [2020-07-01 13:01:53,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:01:53,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:01:53,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:01:53,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:01:53,992 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-07-01 13:01:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:01:54,099 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. [2020-07-01 13:01:54,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:01:54,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:01:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:01:54,112 INFO L225 Difference]: With dead ends: 25 [2020-07-01 13:01:54,112 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 13:01:54,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:01:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 13:01:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 13:01:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:01:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2020-07-01 13:01:54,151 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 6 [2020-07-01 13:01:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:01:54,152 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-07-01 13:01:54,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:01:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2020-07-01 13:01:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:01:54,153 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:01:54,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:01:54,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:01:54,155 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:01:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:01:54,155 INFO L82 PathProgramCache]: Analyzing trace with hash 823111809, now seen corresponding path program 1 times [2020-07-01 13:01:54,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:01:54,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809012954] [2020-07-01 13:01:54,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:01:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:01:54,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809012954] [2020-07-01 13:01:54,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:01:54,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:01:54,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126977706] [2020-07-01 13:01:54,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:01:54,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:01:54,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:01:54,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:01:54,240 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 5 states. [2020-07-01 13:01:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:01:54,406 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2020-07-01 13:01:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:01:54,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-07-01 13:01:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:01:54,408 INFO L225 Difference]: With dead ends: 38 [2020-07-01 13:01:54,408 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 13:01:54,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:01:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 13:01:54,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2020-07-01 13:01:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:01:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2020-07-01 13:01:54,416 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 6 [2020-07-01 13:01:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:01:54,416 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. [2020-07-01 13:01:54,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:01:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2020-07-01 13:01:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:01:54,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:01:54,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:01:54,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:01:54,418 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:01:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:01:54,418 INFO L82 PathProgramCache]: Analyzing trace with hash -253338561, now seen corresponding path program 1 times [2020-07-01 13:01:54,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:01:54,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859801017] [2020-07-01 13:01:54,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:01:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:01:54,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859801017] [2020-07-01 13:01:54,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:01:54,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:01:54,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681987158] [2020-07-01 13:01:54,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:01:54,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:01:54,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:01:54,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:01:54,467 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. [2020-07-01 13:01:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:01:54,548 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2020-07-01 13:01:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:01:54,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 13:01:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:01:54,552 INFO L225 Difference]: With dead ends: 53 [2020-07-01 13:01:54,552 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:01:54,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:01:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:01:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:01:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:01:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2020-07-01 13:01:54,559 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 7 [2020-07-01 13:01:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:01:54,559 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-07-01 13:01:54,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:01:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2020-07-01 13:01:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:01:54,560 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:01:54,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:01:54,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:01:54,560 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:01:54,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:01:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash 319244459, now seen corresponding path program 1 times [2020-07-01 13:01:54,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:01:54,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459504565] [2020-07-01 13:01:54,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:01:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:01:54,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459504565] [2020-07-01 13:01:54,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:01:54,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:01:54,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967916844] [2020-07-01 13:01:54,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:01:54,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:01:54,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:01:54,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:01:54,618 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 4 states. [2020-07-01 13:01:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:01:54,736 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2020-07-01 13:01:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:01:54,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 13:01:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:01:54,892 INFO L225 Difference]: With dead ends: 32 [2020-07-01 13:01:54,892 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 13:01:54,893 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:01:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 13:01:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-07-01 13:01:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:01:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2020-07-01 13:01:54,898 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 7 [2020-07-01 13:01:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:01:54,898 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2020-07-01 13:01:54,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:01:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2020-07-01 13:01:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:01:54,899 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:01:54,899 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:01:54,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:01:54,900 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:01:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:01:54,900 INFO L82 PathProgramCache]: Analyzing trace with hash 894708749, now seen corresponding path program 1 times [2020-07-01 13:01:54,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:01:54,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219355038] [2020-07-01 13:01:54,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:01:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:01:54,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219355038] [2020-07-01 13:01:54,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266233598] [2020-07-01 13:01:54,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:01:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:55,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:01:55,047 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:01:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:01:55,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:01:55,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-07-01 13:01:55,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371429278] [2020-07-01 13:01:55,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:01:55,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:01:55,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:01:55,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:01:55,098 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand 4 states. [2020-07-01 13:01:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:01:55,190 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-01 13:01:55,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:01:55,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-01 13:01:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:01:55,192 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:01:55,192 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:01:55,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:01:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:01:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-01 13:01:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:01:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-07-01 13:01:55,198 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 11 [2020-07-01 13:01:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:01:55,198 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-07-01 13:01:55,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:01:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-01 13:01:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:01:55,199 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:01:55,199 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:01:55,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:01:55,400 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:01:55,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:01:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash 894708750, now seen corresponding path program 1 times [2020-07-01 13:01:55,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:01:55,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642368742] [2020-07-01 13:01:55,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:01:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:01:55,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642368742] [2020-07-01 13:01:55,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113104965] [2020-07-01 13:01:55,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:01:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:55,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:01:55,496 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:01:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:01:55,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:01:55,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2020-07-01 13:01:55,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620423811] [2020-07-01 13:01:55,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:01:55,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:01:55,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:01:55,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:01:55,531 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 5 states. [2020-07-01 13:01:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:01:55,610 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-01 13:01:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:01:55,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 13:01:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:01:55,611 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:01:55,611 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 13:01:55,612 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:01:55,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 13:01:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-07-01 13:01:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 13:01:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-07-01 13:01:55,616 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2020-07-01 13:01:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:01:55,617 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-01 13:01:55,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:01:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-07-01 13:01:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 13:01:55,617 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:01:55,618 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:01:55,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:01:55,818 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:01:55,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:01:55,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1966166579, now seen corresponding path program 1 times [2020-07-01 13:01:55,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:01:55,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14130070] [2020-07-01 13:01:55,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:01:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:01:55,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14130070] [2020-07-01 13:01:55,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309695582] [2020-07-01 13:01:55,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:01:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:55,916 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-01 13:01:55,917 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:01:55,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-07-01 13:01:55,965 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:01:55,976 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:01:55,981 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:01:55,981 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:25 [2020-07-01 13:01:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:01:56,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:01:56,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-07-01 13:01:56,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650148063] [2020-07-01 13:01:56,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:01:56,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:01:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:01:56,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:01:56,023 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 6 states. [2020-07-01 13:01:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:01:56,174 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2020-07-01 13:01:56,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:01:56,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-01 13:01:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:01:56,176 INFO L225 Difference]: With dead ends: 18 [2020-07-01 13:01:56,176 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:01:56,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:01:56,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:01:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:01:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:01:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:01:56,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-07-01 13:01:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:01:56,178 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:01:56,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:01:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:01:56,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:01:56,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:01:56,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:01:56,609 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2020-07-01 13:01:56,726 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-07-01 13:01:56,730 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-01 13:01:56,730 INFO L268 CegarLoopResult]: For program point L19-2(lines 19 21) no Hoare annotation was computed. [2020-07-01 13:01:56,730 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,730 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:01:56,730 INFO L268 CegarLoopResult]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,730 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 13:01:56,731 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,731 INFO L268 CegarLoopResult]: For program point L11-2(lines 11 14) no Hoare annotation was computed. [2020-07-01 13:01:56,731 INFO L268 CegarLoopResult]: For program point L13-5(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,731 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:01:56,731 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,731 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,731 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,731 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,732 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,732 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,732 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,732 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:01:56,732 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:01:56,732 INFO L268 CegarLoopResult]: For program point L10-2(lines 10 14) no Hoare annotation was computed. [2020-07-01 13:01:56,733 INFO L264 CegarLoopResult]: At program point L10-3(lines 10 14) the Hoare annotation is: (let ((.cse4 (select |#length| ULTIMATE.start_sort_~x.base))) (let ((.cse7 (div (* .cse4 (- 1)) (- 4)))) (let ((.cse0 (<= ULTIMATE.start_sort_~n .cse7)) (.cse1 (<= 1 ULTIMATE.start_sort_~pass~0)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_sort_~x.base))) (.cse3 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse5 (= 0 ULTIMATE.start_sort_~x.offset)) (.cse6 (= (mod (* .cse4 3) (- 4)) 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_sort_~i~0 (+ (div (+ (* ULTIMATE.start_sort_~x.offset (- 1)) .cse4 (- 8)) 4) 1)) .cse5 .cse6 (<= 1 ULTIMATE.start_sort_~i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 (<= 0 ULTIMATE.start_sort_~i~0) .cse6 (<= (+ ULTIMATE.start_sort_~i~0 2) .cse7)))))) [2020-07-01 13:01:56,733 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:01:56,733 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:01:56,733 INFO L264 CegarLoopResult]: At program point L8-3(lines 8 14) the Hoare annotation is: (let ((.cse4 (select |#length| ULTIMATE.start_sort_~x.base))) (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_sort_~x.base))) (.cse1 (<= (+ ULTIMATE.start_sort_~n 4) (+ .cse4 ULTIMATE.start_sort_~pass~0))) (.cse2 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse3 (= 0 ULTIMATE.start_sort_~x.offset))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~array_size~0 1) .cse3 (<= ULTIMATE.start_sort_~n ULTIMATE.start_sort_~pass~0)) (and (<= ULTIMATE.start_sort_~n (div (* .cse4 (- 1)) (- 4))) (<= 1 ULTIMATE.start_sort_~pass~0) .cse0 .cse1 .cse2 .cse3 (= (mod (* .cse4 3) (- 4)) 0))))) [2020-07-01 13:01:56,733 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:01:56,736 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:01:56,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,752 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,759 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,759 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:01:56 BasicIcfg [2020-07-01 13:01:56,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:01:56,763 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:01:56,763 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:01:56,767 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:01:56,768 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:01:56,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:01:52" (1/5) ... [2020-07-01 13:01:56,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57d2859a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:01:56, skipping insertion in model container [2020-07-01 13:01:56,769 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:01:56,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:01:53" (2/5) ... [2020-07-01 13:01:56,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57d2859a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:01:56, skipping insertion in model container [2020-07-01 13:01:56,769 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:01:56,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:01:53" (3/5) ... [2020-07-01 13:01:56,770 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57d2859a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:01:56, skipping insertion in model container [2020-07-01 13:01:56,770 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:01:56,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:01:53" (4/5) ... [2020-07-01 13:01:56,770 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57d2859a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:01:56, skipping insertion in model container [2020-07-01 13:01:56,770 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:01:56,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:01:56" (5/5) ... [2020-07-01 13:01:56,772 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:01:56,793 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:01:56,793 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:01:56,793 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:01:56,793 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:01:56,793 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:01:56,793 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:01:56,793 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:01:56,794 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:01:56,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-01 13:01:56,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 13:01:56,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:01:56,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:01:56,807 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 13:01:56,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:01:56,807 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:01:56,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-01 13:01:56,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 13:01:56,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:01:56,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:01:56,809 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 13:01:56,809 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:01:56,814 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue [145] ULTIMATE.startENTRY-->L19: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 21#L19true [102] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 17#L19-2true [120] L19-2-->L8-3: Formula: (and (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_sort_~x.base_1 |v_ULTIMATE.start_sort_#in~x.base_1|) (= |v_ULTIMATE.start_sort_#in~x.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_sort_#in~x.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_sort_~n_1 |v_ULTIMATE.start_sort_#in~n_1|) (= |v_ULTIMATE.start_sort_#in~n_1| v_ULTIMATE.start_main_~array_size~0_7) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_sort_~x.offset_1 |v_ULTIMATE.start_sort_#in~x.offset_1|) (= v_ULTIMATE.start_sort_~pass~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* v_ULTIMATE.start_main_~array_size~0_7 4))) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_sort_~x.offset=v_ULTIMATE.start_sort_~x.offset_1, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_1, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_1, ULTIMATE.start_sort_#t~post1=|v_ULTIMATE.start_sort_#t~post1_1|, ULTIMATE.start_sort_#in~x.base=|v_ULTIMATE.start_sort_#in~x.base_1|, ULTIMATE.start_sort_#in~n=|v_ULTIMATE.start_sort_#in~n_1|, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_1, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_sort_~temp~0=v_ULTIMATE.start_sort_~temp~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_sort_#t~mem5=|v_ULTIMATE.start_sort_#t~mem5_1|, ULTIMATE.start_sort_#t~mem4=|v_ULTIMATE.start_sort_#t~mem4_1|, #length=|v_#length_1|, ULTIMATE.start_sort_#t~mem3=|v_ULTIMATE.start_sort_#t~mem3_1|, ULTIMATE.start_sort_#t~mem2=|v_ULTIMATE.start_sort_#t~mem2_1|, ULTIMATE.start_sort_~x.base=v_ULTIMATE.start_sort_~x.base_1, ULTIMATE.start_sort_#in~x.offset=|v_ULTIMATE.start_sort_#in~x.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post1, ULTIMATE.start_sort_#in~x.base, ULTIMATE.start_sort_#in~n, ULTIMATE.start_sort_~n, ULTIMATE.start_sort_#t~post0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_sort_~temp~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_sort_#t~mem5, ULTIMATE.start_sort_#t~mem4, #length, ULTIMATE.start_sort_#t~mem3, ULTIMATE.start_sort_#t~mem2, ULTIMATE.start_sort_~x.base, ULTIMATE.start_sort_#in~x.offset] 15#L8-3true [2020-07-01 13:01:56,814 INFO L796 eck$LassoCheckResult]: Loop: 15#L8-3true [75] L8-3-->L10-3: Formula: (and (= v_ULTIMATE.start_sort_~i~0_3 0) (< v_ULTIMATE.start_sort_~pass~0_5 v_ULTIMATE.start_sort_~n_4)) InVars {ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4} OutVars{ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_5, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_4, ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_sort_~i~0] 19#L10-3true [147] L10-3-->L8-3: Formula: (and (= v_ULTIMATE.start_sort_~pass~0_11 (+ v_ULTIMATE.start_sort_~pass~0_12 1)) (<= v_ULTIMATE.start_sort_~n_8 (+ v_ULTIMATE.start_sort_~pass~0_12 v_ULTIMATE.start_sort_~i~0_20))) InVars {ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_12, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8} OutVars{ULTIMATE.start_sort_~i~0=v_ULTIMATE.start_sort_~i~0_20, ULTIMATE.start_sort_~pass~0=v_ULTIMATE.start_sort_~pass~0_11, ULTIMATE.start_sort_~n=v_ULTIMATE.start_sort_~n_8, ULTIMATE.start_sort_#t~post0=|v_ULTIMATE.start_sort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_#t~post0] 15#L8-3true [2020-07-01 13:01:56,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:01:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash 172418, now seen corresponding path program 1 times [2020-07-01 13:01:56,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:01:56,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922599930] [2020-07-01 13:01:56,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:01:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:01:56,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922599930] [2020-07-01 13:01:56,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:01:56,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 13:01:56,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099492867] [2020-07-01 13:01:56,832 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:01:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:01:56,833 INFO L82 PathProgramCache]: Analyzing trace with hash 3433, now seen corresponding path program 1 times [2020-07-01 13:01:56,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:01:56,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581293127] [2020-07-01 13:01:56,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:01:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:01:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:01:56,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581293127] [2020-07-01 13:01:56,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:01:56,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 13:01:56,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040192878] [2020-07-01 13:01:56,847 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:01:56,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:01:56,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:01:56,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:01:56,849 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-07-01 13:01:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:01:56,919 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-07-01 13:01:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:01:56,922 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:01:56,926 INFO L168 Benchmark]: Toolchain (without parser) took 4075.80 ms. Allocated memory was 649.6 MB in the beginning and 751.8 MB in the end (delta: 102.2 MB). Free memory was 562.5 MB in the beginning and 640.0 MB in the end (delta: -77.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:01:56,927 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:01:56,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.55 ms. Allocated memory was 649.6 MB in the beginning and 690.0 MB in the end (delta: 40.4 MB). Free memory was 562.5 MB in the beginning and 651.4 MB in the end (delta: -88.9 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:01:56,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.14 ms. Allocated memory is still 690.0 MB. Free memory was 651.4 MB in the beginning and 649.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:01:56,928 INFO L168 Benchmark]: Boogie Preprocessor took 26.67 ms. Allocated memory is still 690.0 MB. Free memory was 649.2 MB in the beginning and 648.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:01:56,929 INFO L168 Benchmark]: RCFGBuilder took 331.31 ms. Allocated memory is still 690.0 MB. Free memory was 648.1 MB in the beginning and 624.6 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:01:56,929 INFO L168 Benchmark]: BlockEncodingV2 took 118.22 ms. Allocated memory is still 690.0 MB. Free memory was 624.6 MB in the beginning and 615.9 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:01:56,930 INFO L168 Benchmark]: TraceAbstraction took 3073.45 ms. Allocated memory was 690.0 MB in the beginning and 751.8 MB in the end (delta: 61.9 MB). Free memory was 615.9 MB in the beginning and 658.6 MB in the end (delta: -42.6 MB). Peak memory consumption was 234.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:01:56,931 INFO L168 Benchmark]: BuchiAutomizer took 161.28 ms. Allocated memory is still 751.8 MB. Free memory was 658.6 MB in the beginning and 640.0 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:01:56,934 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 33 locations, 38 edges - StatisticsResult: Encoded RCFG 25 locations, 41 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 317.55 ms. Allocated memory was 649.6 MB in the beginning and 690.0 MB in the end (delta: 40.4 MB). Free memory was 562.5 MB in the beginning and 651.4 MB in the end (delta: -88.9 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.14 ms. Allocated memory is still 690.0 MB. Free memory was 651.4 MB in the beginning and 649.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.67 ms. Allocated memory is still 690.0 MB. Free memory was 649.2 MB in the beginning and 648.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 331.31 ms. Allocated memory is still 690.0 MB. Free memory was 648.1 MB in the beginning and 624.6 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 118.22 ms. Allocated memory is still 690.0 MB. Free memory was 624.6 MB in the beginning and 615.9 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3073.45 ms. Allocated memory was 690.0 MB in the beginning and 751.8 MB in the end (delta: 61.9 MB). Free memory was 615.9 MB in the beginning and 658.6 MB in the end (delta: -42.6 MB). Peak memory consumption was 234.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 161.28 ms. Allocated memory is still 751.8 MB. Free memory was 658.6 MB in the beginning and 640.0 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-07-01 13:01:56,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,947 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 == \valid[x] && n + 4 <= unknown-#length-unknown[x] + pass) && 1 <= array_size) && array_size <= 1) && 0 == x) && n <= pass) || ((((((n <= unknown-#length-unknown[x] * -1 / -4 && 1 <= pass) && 1 == \valid[x]) && n + 4 <= unknown-#length-unknown[x] + pass) && 1 <= array_size) && 0 == x) && unknown-#length-unknown[x] * 3 % -4 == 0) - InvariantResult [Line: 10]: Loop Invariant [2020-07-01 13:01:56,948 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,948 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,949 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,949 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,949 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,949 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,950 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,951 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,951 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,951 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,951 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:01:56,951 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((n <= unknown-#length-unknown[x] * -1 / -4 && 1 <= pass) && 1 == \valid[x]) && 1 <= array_size) && i <= (x * -1 + unknown-#length-unknown[x] + -8) / 4 + 1) && 0 == x) && unknown-#length-unknown[x] * 3 % -4 == 0) && 1 <= i) || (((((((n <= unknown-#length-unknown[x] * -1 / -4 && 1 <= pass) && 1 == \valid[x]) && 1 <= array_size) && 0 == x) && 0 <= i) && unknown-#length-unknown[x] * 3 % -4 == 0) && i + 2 <= unknown-#length-unknown[x] * -1 / -4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.6s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 40 SDtfs, 207 SDslu, 82 SDs, 0 SdLazy, 292 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 168 HoareAnnotationTreeSize, 2 FomulaSimplifications, 1369 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 612 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 7912 SizeOfPredicates, 13 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 6/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:01:49.520 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_KHizux/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:01:57.179 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check