./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/nec11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/nec11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 956956519a5dd5945389347ef99ef2322ddc4acd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:49:08,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:49:08,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:49:08,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:49:08,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:49:08,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:49:08,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:49:08,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:49:08,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:49:08,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:49:08,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:49:08,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:49:08,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:49:08,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:49:08,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:49:08,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:49:08,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:49:08,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:49:08,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:49:08,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:49:08,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:49:08,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:49:08,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:49:08,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:49:08,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:49:08,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:49:08,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:49:08,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:49:08,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:49:08,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:49:08,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:49:08,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:49:08,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:49:08,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:49:08,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:49:08,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:49:08,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:49:08,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:49:08,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:49:08,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:49:08,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:49:08,598 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:49:08,614 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:49:08,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:49:08,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:49:08,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:49:08,616 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:49:08,616 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:49:08,616 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:49:08,617 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:49:08,617 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:49:08,617 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:49:08,617 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:49:08,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:49:08,618 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:49:08,618 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:49:08,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:49:08,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:49:08,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:49:08,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:49:08,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:49:08,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:49:08,619 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:49:08,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:49:08,620 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:49:08,620 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:49:08,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:49:08,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:49:08,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:49:08,621 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:49:08,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:49:08,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:49:08,622 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:49:08,622 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:49:08,623 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:49:08,623 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 956956519a5dd5945389347ef99ef2322ddc4acd [2019-11-28 20:49:08,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:49:08,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:49:08,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:49:08,954 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:49:08,955 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:49:08,956 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/nec11.c [2019-11-28 20:49:09,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12142a56d/5ec01bda6fa64eafa2ee7cd9cba05a5e/FLAGe5dfe7dc0 [2019-11-28 20:49:09,463 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:49:09,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/nec11.c [2019-11-28 20:49:09,470 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12142a56d/5ec01bda6fa64eafa2ee7cd9cba05a5e/FLAGe5dfe7dc0 [2019-11-28 20:49:09,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12142a56d/5ec01bda6fa64eafa2ee7cd9cba05a5e [2019-11-28 20:49:09,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:49:09,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:49:09,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:49:09,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:49:09,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:49:09,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:49:09" (1/1) ... [2019-11-28 20:49:09,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a58cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:09, skipping insertion in model container [2019-11-28 20:49:09,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:49:09" (1/1) ... [2019-11-28 20:49:09,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:49:09,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:49:10,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:49:10,042 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:49:10,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:49:10,070 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:49:10,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10 WrapperNode [2019-11-28 20:49:10,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:49:10,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:49:10,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:49:10,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:49:10,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10" (1/1) ... [2019-11-28 20:49:10,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10" (1/1) ... [2019-11-28 20:49:10,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:49:10,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:49:10,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:49:10,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:49:10,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10" (1/1) ... [2019-11-28 20:49:10,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10" (1/1) ... [2019-11-28 20:49:10,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10" (1/1) ... [2019-11-28 20:49:10,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10" (1/1) ... [2019-11-28 20:49:10,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10" (1/1) ... [2019-11-28 20:49:10,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10" (1/1) ... [2019-11-28 20:49:10,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10" (1/1) ... [2019-11-28 20:49:10,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:49:10,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:49:10,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:49:10,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:49:10,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:49:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:49:10,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:49:10,379 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:49:10,379 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 20:49:10,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:49:10 BoogieIcfgContainer [2019-11-28 20:49:10,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:49:10,381 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:49:10,381 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:49:10,384 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:49:10,384 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:49:10,385 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:49:09" (1/3) ... [2019-11-28 20:49:10,386 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45935e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:49:10, skipping insertion in model container [2019-11-28 20:49:10,386 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:49:10,386 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:49:10" (2/3) ... [2019-11-28 20:49:10,386 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45935e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:49:10, skipping insertion in model container [2019-11-28 20:49:10,387 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:49:10,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:49:10" (3/3) ... [2019-11-28 20:49:10,388 INFO L371 chiAutomizerObserver]: Analyzing ICFG nec11.c [2019-11-28 20:49:10,435 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:49:10,435 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:49:10,435 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:49:10,435 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:49:10,436 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:49:10,436 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:49:10,436 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:49:10,436 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:49:10,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-28 20:49:10,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:49:10,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:10,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:10,476 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:49:10,476 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:49:10,476 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:49:10,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-28 20:49:10,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:49:10,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:10,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:10,479 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:49:10,479 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:49:10,484 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 7#L19-2true [2019-11-28 20:49:10,485 INFO L796 eck$LassoCheckResult]: Loop: 7#L19-2true assume !!(0 != main_~c~0 % 256); 3#L21true assume 4 == main_~len~0;main_~len~0 := 0; 11#L21-2true assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 7#L19-2true [2019-11-28 20:49:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 20:49:10,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:10,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999155844] [2019-11-28 20:49:10,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:10,579 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2019-11-28 20:49:10,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:10,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235934490] [2019-11-28 20:49:10,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:10,607 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2019-11-28 20:49:10,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:10,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540050135] [2019-11-28 20:49:10,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:10,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540050135] [2019-11-28 20:49:10,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:49:10,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:49:10,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18428526] [2019-11-28 20:49:10,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:10,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:49:10,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:49:10,816 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-11-28 20:49:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:10,842 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-28 20:49:10,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:49:10,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-11-28 20:49:10,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:49:10,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 7 states and 8 transitions. [2019-11-28 20:49:10,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:49:10,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:49:10,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-28 20:49:10,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:49:10,852 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-28 20:49:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-28 20:49:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-11-28 20:49:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:49:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-28 20:49:10,876 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-28 20:49:10,877 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-28 20:49:10,877 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:49:10,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-11-28 20:49:10,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:49:10,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:10,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:10,878 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:49:10,878 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:49:10,879 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 46#L19-2 assume !!(0 != main_~c~0 % 256); 43#L21 assume !(4 == main_~len~0); 44#L21-2 [2019-11-28 20:49:10,879 INFO L796 eck$LassoCheckResult]: Loop: 44#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 47#L19-2 assume !!(0 != main_~c~0 % 256); 48#L21 assume 4 == main_~len~0;main_~len~0 := 0; 44#L21-2 [2019-11-28 20:49:10,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-28 20:49:10,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:10,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959597483] [2019-11-28 20:49:10,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:10,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:10,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash 46451, now seen corresponding path program 2 times [2019-11-28 20:49:10,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:10,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121204807] [2019-11-28 20:49:10,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:10,905 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:10,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash 925831567, now seen corresponding path program 1 times [2019-11-28 20:49:10,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:10,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10783886] [2019-11-28 20:49:10,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:10,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10783886] [2019-11-28 20:49:10,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139526698] [2019-11-28 20:49:10,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:49:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:10,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:49:10,989 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:11,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:49:11,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-28 20:49:11,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41229163] [2019-11-28 20:49:11,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:11,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:49:11,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:49:11,069 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-28 20:49:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:11,086 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-28 20:49:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:49:11,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-28 20:49:11,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:49:11,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 20:49:11,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:49:11,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:49:11,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-28 20:49:11,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:49:11,090 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 20:49:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-28 20:49:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-11-28 20:49:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:49:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-28 20:49:11,092 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 20:49:11,092 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 20:49:11,092 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:49:11,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-28 20:49:11,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:49:11,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:11,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:11,093 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:49:11,093 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-11-28 20:49:11,094 INFO L794 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 86#L19-2 assume !!(0 != main_~c~0 % 256); 91#L21 assume !(4 == main_~len~0); 88#L21-2 [2019-11-28 20:49:11,094 INFO L796 eck$LassoCheckResult]: Loop: 88#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 87#L19-2 assume !!(0 != main_~c~0 % 256); 83#L21 assume !(4 == main_~len~0); 84#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 90#L19-2 assume !!(0 != main_~c~0 % 256); 89#L21 assume 4 == main_~len~0;main_~len~0 := 0; 88#L21-2 [2019-11-28 20:49:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 2 times [2019-11-28 20:49:11,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:11,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657349646] [2019-11-28 20:49:11,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,106 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:11,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1383897983, now seen corresponding path program 1 times [2019-11-28 20:49:11,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:11,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135057969] [2019-11-28 20:49:11,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,124 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash -831686173, now seen corresponding path program 2 times [2019-11-28 20:49:11,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:11,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025189136] [2019-11-28 20:49:11,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:11,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025189136] [2019-11-28 20:49:11,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566071321] [2019-11-28 20:49:11,186 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:49:11,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:49:11,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:49:11,236 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:49:11,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:11,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:49:11,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 20:49:11,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776013262] [2019-11-28 20:49:11,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:11,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:49:11,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:49:11,331 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-11-28 20:49:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:11,354 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-28 20:49:11,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:49:11,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-28 20:49:11,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 20:49:11,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-28 20:49:11,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 20:49:11,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:49:11,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-28 20:49:11,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:49:11,358 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-28 20:49:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-28 20:49:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-28 20:49:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:49:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-28 20:49:11,366 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 20:49:11,367 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 20:49:11,367 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:49:11,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-11-28 20:49:11,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 20:49:11,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:11,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:11,370 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:49:11,370 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2019-11-28 20:49:11,371 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 142#L19-2 assume !!(0 != main_~c~0 % 256); 150#L21 assume !(4 == main_~len~0); 145#L21-2 [2019-11-28 20:49:11,371 INFO L796 eck$LassoCheckResult]: Loop: 145#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 143#L19-2 assume !!(0 != main_~c~0 % 256); 144#L21 assume !(4 == main_~len~0); 148#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 149#L19-2 assume !!(0 != main_~c~0 % 256); 139#L21 assume !(4 == main_~len~0); 140#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 147#L19-2 assume !!(0 != main_~c~0 % 256); 146#L21 assume 4 == main_~len~0;main_~len~0 := 0; 145#L21-2 [2019-11-28 20:49:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:11,372 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-11-28 20:49:11,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:11,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40823765] [2019-11-28 20:49:11,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,382 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:11,383 INFO L82 PathProgramCache]: Analyzing trace with hash 313813491, now seen corresponding path program 2 times [2019-11-28 20:49:11,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:11,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483675735] [2019-11-28 20:49:11,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:11,429 INFO L82 PathProgramCache]: Analyzing trace with hash 903627023, now seen corresponding path program 3 times [2019-11-28 20:49:11,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:11,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722789602] [2019-11-28 20:49:11,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:49:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:11,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722789602] [2019-11-28 20:49:11,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742880848] [2019-11-28 20:49:11,491 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:49:11,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 20:49:11,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:49:11,527 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:49:11,528 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:49:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:49:11,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:49:11,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 20:49:11,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912495770] [2019-11-28 20:49:11,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:49:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:49:11,629 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-28 20:49:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:11,655 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-11-28 20:49:11,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:49:11,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2019-11-28 20:49:11,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 20:49:11,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2019-11-28 20:49:11,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 20:49:11,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 20:49:11,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2019-11-28 20:49:11,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:49:11,659 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-28 20:49:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2019-11-28 20:49:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-28 20:49:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:49:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-28 20:49:11,663 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-28 20:49:11,663 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-28 20:49:11,663 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:49:11,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-28 20:49:11,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 20:49:11,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:49:11,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:49:11,665 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:49:11,665 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2019-11-28 20:49:11,666 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 214#L19-2 assume !!(0 != main_~c~0 % 256); 211#L21 assume !(4 == main_~len~0); 212#L21-2 [2019-11-28 20:49:11,666 INFO L796 eck$LassoCheckResult]: Loop: 212#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 215#L19-2 assume !!(0 != main_~c~0 % 256); 225#L21 assume !(4 == main_~len~0); 224#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 223#L19-2 assume !!(0 != main_~c~0 % 256); 222#L21 assume !(4 == main_~len~0); 221#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 220#L19-2 assume !!(0 != main_~c~0 % 256); 219#L21 assume !(4 == main_~len~0); 217#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 218#L19-2 assume !!(0 != main_~c~0 % 256); 216#L21 assume 4 == main_~len~0;main_~len~0 := 0; 212#L21-2 [2019-11-28 20:49:11,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:11,667 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 4 times [2019-11-28 20:49:11,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:11,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422908256] [2019-11-28 20:49:11,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,676 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:11,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:11,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1326016769, now seen corresponding path program 3 times [2019-11-28 20:49:11,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:11,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800075527] [2019-11-28 20:49:11,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash -902292893, now seen corresponding path program 4 times [2019-11-28 20:49:11,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:11,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588678041] [2019-11-28 20:49:11,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:11,735 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:11,859 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-11-28 20:49:11,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:49:11 BoogieIcfgContainer [2019-11-28 20:49:11,941 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:49:11,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:49:11,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:49:11,942 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:49:11,942 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:49:10" (3/4) ... [2019-11-28 20:49:11,946 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:49:12,019 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:49:12,020 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:49:12,027 INFO L168 Benchmark]: Toolchain (without parser) took 2173.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 960.4 MB in the beginning and 931.1 MB in the end (delta: 29.2 MB). Peak memory consumption was 123.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:12,028 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:49:12,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.18 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:12,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -140.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:12,032 INFO L168 Benchmark]: Boogie Preprocessor took 15.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:49:12,033 INFO L168 Benchmark]: RCFGBuilder took 209.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:12,035 INFO L168 Benchmark]: BuchiAutomizer took 1560.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 931.1 MB in the end (delta: 133.2 MB). Peak memory consumption was 133.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:12,038 INFO L168 Benchmark]: Witness Printer took 78.56 ms. Allocated memory is still 1.1 GB. Free memory is still 931.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:49:12,044 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.18 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -140.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 209.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1560.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 931.1 MB in the end (delta: 133.2 MB). Peak memory consumption was 133.2 MB. Max. memory is 11.5 GB. * Witness Printer took 78.56 ms. Allocated memory is still 1.1 GB. Free memory is still 931.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 18 SDtfs, 17 SDslu, 16 SDs, 0 SdLazy, 30 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 19]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {len=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b83044a=0, \result=0, c=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@377c8c01=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] int a[5]; [L14] int len=0; [L15] _Bool c=__VERIFIER_nondet_bool(); [L16] int i; [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) Loop: [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND TRUE len==4 [L22] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...