./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array16_alloca_original.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/termination-15/array16_alloca_original.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash b6c8e92f4d5413ae33bafe73b9024f19a73a1964 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.1-dev-20ed64e [2021-08-27 14:29:37,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:29:37,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:29:37,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:29:37,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:29:37,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:29:37,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:29:37,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:29:37,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:29:37,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:29:37,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:29:37,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:29:37,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:29:37,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:29:37,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:29:37,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:29:37,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:29:37,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:29:37,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:29:37,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:29:37,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:29:37,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:29:37,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:29:37,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:29:37,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:29:37,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:29:37,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:29:37,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:29:37,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:29:37,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:29:37,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:29:37,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:29:37,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:29:37,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:29:37,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:29:37,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:29:37,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:29:37,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:29:37,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:29:37,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:29:37,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:29:37,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-08-27 14:29:37,722 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:29:37,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:29:37,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:29:37,724 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:29:37,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:29:37,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:29:37,726 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:29:37,726 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:29:37,727 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:29:37,727 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:29:37,728 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:29:37,728 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:29:37,728 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:29:37,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:29:37,728 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:29:37,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:29:37,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:29:37,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:29:37,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:29:37,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:29:37,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:29:37,730 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:29:37,730 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:29:37,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:29:37,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:29:37,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:29:37,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:29:37,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:29:37,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:29:37,732 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:29:37,733 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2021-08-27 14:29:38,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:29:38,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:29:38,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:29:38,058 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:29:38,058 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:29:38,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array16_alloca_original.i [2021-08-27 14:29:38,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01abfa2b/83f4d52bab884a73b6227c723b1aff00/FLAGb53c79bd3 [2021-08-27 14:29:38,683 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:29:38,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array16_alloca_original.i [2021-08-27 14:29:38,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01abfa2b/83f4d52bab884a73b6227c723b1aff00/FLAGb53c79bd3 [2021-08-27 14:29:39,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01abfa2b/83f4d52bab884a73b6227c723b1aff00 [2021-08-27 14:29:39,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:29:39,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:29:39,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:29:39,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:29:39,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:29:39,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39, skipping insertion in model container [2021-08-27 14:29:39,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:29:39,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:29:39,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:29:39,409 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:29:39,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:29:39,509 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:29:39,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39 WrapperNode [2021-08-27 14:29:39,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:29:39,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:29:39,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:29:39,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:29:39,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:29:39,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:29:39,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:29:39,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:29:39,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:29:39,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:29:39,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:29:39,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:29:39,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39" (1/1) ... [2021-08-27 14:29:39,611 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:39,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:39,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:39,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 14:29:39,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 14:29:39,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 14:29:39,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:29:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 14:29:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:29:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:29:39,957 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:29:39,958 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-08-27 14:29:39,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:29:39 BoogieIcfgContainer [2021-08-27 14:29:39,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:29:39,960 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:29:39,960 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:29:39,962 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:29:39,963 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:29:39,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:29:39" (1/3) ... [2021-08-27 14:29:39,964 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e78805e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:29:39, skipping insertion in model container [2021-08-27 14:29:39,964 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:29:39,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:29:39" (2/3) ... [2021-08-27 14:29:39,964 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e78805e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:29:39, skipping insertion in model container [2021-08-27 14:29:39,965 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:29:39,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:29:39" (3/3) ... [2021-08-27 14:29:39,966 INFO L389 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original.i [2021-08-27 14:29:40,001 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:29:40,001 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:29:40,001 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:29:40,001 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:29:40,002 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:29:40,002 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:29:40,002 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:29:40,002 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:29:40,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:40,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-08-27 14:29:40,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:29:40,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:29:40,041 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 14:29:40,041 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:29:40,041 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:29:40,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:40,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-08-27 14:29:40,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:29:40,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:29:40,044 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 14:29:40,044 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:29:40,050 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 11#L367true assume !(main_~length~0 < 1); 8#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 5#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 6#L370-3true [2021-08-27 14:29:40,051 INFO L793 eck$LassoCheckResult]: Loop: 6#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 13#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 16#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 6#L370-3true [2021-08-27 14:29:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:40,056 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2021-08-27 14:29:40,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:40,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066157098] [2021-08-27 14:29:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:40,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:40,146 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:40,187 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:40,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:40,192 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2021-08-27 14:29:40,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:40,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506420876] [2021-08-27 14:29:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:40,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:40,217 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:40,239 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:40,241 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2021-08-27 14:29:40,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:40,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341141742] [2021-08-27 14:29:40,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:40,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:40,280 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:40,304 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:40,830 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:29:40,831 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:29:40,831 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:29:40,831 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:29:40,832 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:29:40,832 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:40,832 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:29:40,832 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:29:40,832 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration1_Lasso [2021-08-27 14:29:40,832 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:29:40,833 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:29:40,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:40,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:40,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:40,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:40,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:40,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:40,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:41,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:41,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:41,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:41,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:41,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:41,411 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:29:41,414 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:29:41,415 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:41,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:41,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:41,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 14:29:41,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:41,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:41,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:41,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:41,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:41,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:41,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:41,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:41,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:41,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:41,455 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:41,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:41,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:41,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 14:29:41,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:41,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:41,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:41,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:41,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:41,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:41,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:41,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:41,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:41,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-08-27 14:29:41,502 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:41,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:41,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:41,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 14:29:41,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:41,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:41,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:41,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:41,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:41,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:41,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:41,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:41,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:41,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-08-27 14:29:41,533 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:41,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:41,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:41,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 14:29:41,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:41,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:41,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:41,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:41,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:41,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:41,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:41,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:41,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:41,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-08-27 14:29:41,561 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:41,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:41,562 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:41,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 14:29:41,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:41,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:41,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:41,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:41,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:41,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:29:41,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:29:41,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:41,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:41,606 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:41,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:41,607 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:41,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 14:29:41,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:41,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:41,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:41,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:41,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:41,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:41,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:41,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:41,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:41,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:41,635 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:41,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:41,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:41,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 14:29:41,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:41,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:41,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:41,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:41,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:41,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:29:41,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:29:41,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:41,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:41,697 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:41,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:41,697 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:41,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 14:29:41,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:41,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:41,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:41,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:41,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:41,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:29:41,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:29:41,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:41,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-08-27 14:29:41,746 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:41,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:41,749 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:41,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 14:29:41,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:41,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:41,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:41,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:41,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:41,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:41,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:41,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:41,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:41,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:41,814 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:41,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:41,817 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:41,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 14:29:41,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:41,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:41,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:41,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:41,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:41,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:29:41,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:29:41,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:29:41,884 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-08-27 14:29:41,884 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-08-27 14:29:41,886 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:41,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:41,893 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:41,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 14:29:41,935 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:29:41,955 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 14:29:41,955 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:29:41,956 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2021-08-27 14:29:41,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:41,991 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-08-27 14:29:42,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:29:42,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:29:42,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:29:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:29:42,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:29:42,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:29:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:29:42,204 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 14:29:42,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:42,259 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 50 transitions. Complement of second has 7 states. [2021-08-27 14:29:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 14:29:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-08-27 14:29:42,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2021-08-27 14:29:42,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:29:42,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2021-08-27 14:29:42,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:29:42,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2021-08-27 14:29:42,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:29:42,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2021-08-27 14:29:42,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:42,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2021-08-27 14:29:42,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-08-27 14:29:42,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-08-27 14:29:42,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2021-08-27 14:29:42,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:29:42,283 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-08-27 14:29:42,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2021-08-27 14:29:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-08-27 14:29:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2021-08-27 14:29:42,304 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-08-27 14:29:42,304 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-08-27 14:29:42,304 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:29:42,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2021-08-27 14:29:42,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:42,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:29:42,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:29:42,307 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:29:42,307 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:29:42,307 INFO L791 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 114#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 121#L367 assume !(main_~length~0 < 1); 115#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 116#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 117#L370-3 assume !(main_~i~0 < main_~length~0); 118#L370-4 main_~j~0 := 0; 119#L378-2 [2021-08-27 14:29:42,307 INFO L793 eck$LassoCheckResult]: Loop: 119#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 119#L378-2 [2021-08-27 14:29:42,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:42,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2021-08-27 14:29:42,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:42,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116095020] [2021-08-27 14:29:42,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:42,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:29:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:29:42,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:29:42,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116095020] [2021-08-27 14:29:42,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116095020] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:29:42,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:29:42,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:29:42,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918717896] [2021-08-27 14:29:42,390 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:29:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:42,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2021-08-27 14:29:42,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:42,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451045108] [2021-08-27 14:29:42,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:42,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:42,422 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:42,454 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:42,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:42,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:29:42,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:29:42,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 14:29:42,533 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:29:42,555 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2021-08-27 14:29:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:29:42,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2021-08-27 14:29:42,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:42,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2021-08-27 14:29:42,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-08-27 14:29:42,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-08-27 14:29:42,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-08-27 14:29:42,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:29:42,558 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-08-27 14:29:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-08-27 14:29:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2021-08-27 14:29:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-08-27 14:29:42,560 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-08-27 14:29:42,560 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-08-27 14:29:42,560 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:29:42,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-08-27 14:29:42,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:42,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:29:42,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:29:42,561 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:29:42,561 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:29:42,561 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 147#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 154#L367 assume !(main_~length~0 < 1); 148#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 149#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 150#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 155#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 157#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 156#L370-3 assume !(main_~i~0 < main_~length~0); 151#L370-4 main_~j~0 := 0; 152#L378-2 [2021-08-27 14:29:42,562 INFO L793 eck$LassoCheckResult]: Loop: 152#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 152#L378-2 [2021-08-27 14:29:42,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:42,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2021-08-27 14:29:42,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:42,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839497408] [2021-08-27 14:29:42,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:42,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:42,572 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:42,584 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2021-08-27 14:29:42,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:42,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719950381] [2021-08-27 14:29:42,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:42,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:42,591 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:42,596 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2021-08-27 14:29:42,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:42,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192374500] [2021-08-27 14:29:42,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:42,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:42,614 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:42,629 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:42,969 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:29:42,969 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:29:42,969 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:29:42,971 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:29:42,973 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:29:42,973 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:42,974 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:29:42,974 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:29:42,974 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration3_Lasso [2021-08-27 14:29:42,974 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:29:42,974 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:29:42,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:42,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:43,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:43,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:43,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:43,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:43,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:43,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:43,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:43,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:43,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:43,669 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:29:43,670 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:29:43,670 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:43,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:43,671 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:43,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:43,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:43,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:43,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:43,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:43,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:43,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:43,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:43,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 14:29:43,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:43,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:43,721 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:43,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:43,722 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:43,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 14:29:43,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:43,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:43,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:43,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:43,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:43,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:29:43,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:29:43,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:43,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:43,779 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:43,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:43,780 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:43,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 14:29:43,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:43,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:43,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:43,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:43,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:43,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:29:43,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:29:43,820 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:29:43,845 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-08-27 14:29:43,845 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2021-08-27 14:29:43,846 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:43,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:43,847 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:43,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 14:29:43,850 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:29:43,874 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 14:29:43,874 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:29:43,874 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2021-08-27 14:29:43,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:43,908 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-08-27 14:29:43,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:29:43,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:29:43,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:29:44,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:29:44,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:29:44,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:29:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:29:44,027 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 14:29:44,027 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:44,041 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 22 transitions. Complement of second has 5 states. [2021-08-27 14:29:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 14:29:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2021-08-27 14:29:44,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2021-08-27 14:29:44,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:29:44,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2021-08-27 14:29:44,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:29:44,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2021-08-27 14:29:44,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:29:44,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2021-08-27 14:29:44,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:44,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2021-08-27 14:29:44,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 14:29:44,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:29:44,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2021-08-27 14:29:44,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:29:44,045 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2021-08-27 14:29:44,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2021-08-27 14:29:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-08-27 14:29:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2021-08-27 14:29:44,047 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2021-08-27 14:29:44,047 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2021-08-27 14:29:44,047 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:29:44,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2021-08-27 14:29:44,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:44,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:29:44,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:29:44,049 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:29:44,049 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:29:44,049 INFO L791 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 244#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 254#L367 assume !(main_~length~0 < 1); 245#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 246#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 247#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 255#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 257#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 256#L370-3 assume !(main_~i~0 < main_~length~0); 248#L370-4 main_~j~0 := 0; 249#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 250#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 251#L378-2 [2021-08-27 14:29:44,052 INFO L793 eck$LassoCheckResult]: Loop: 251#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 258#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 251#L378-2 [2021-08-27 14:29:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2021-08-27 14:29:44,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:44,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582936117] [2021-08-27 14:29:44,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:44,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,066 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,084 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:44,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:44,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2021-08-27 14:29:44,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:44,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820068734] [2021-08-27 14:29:44,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:44,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,090 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,094 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:44,095 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2021-08-27 14:29:44,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:44,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810357264] [2021-08-27 14:29:44,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:44,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:29:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:29:44,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:29:44,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810357264] [2021-08-27 14:29:44,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810357264] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:29:44,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181809288] [2021-08-27 14:29:44,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:44,126 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:29:44,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:44,127 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:29:44,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-27 14:29:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:29:44,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 14:29:44,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:29:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:29:44,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181809288] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:29:44,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 14:29:44,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-08-27 14:29:44,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104331205] [2021-08-27 14:29:44,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:29:44,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:29:44,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:29:44,299 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:29:44,314 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2021-08-27 14:29:44,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:29:44,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2021-08-27 14:29:44,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:44,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2021-08-27 14:29:44,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:29:44,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:29:44,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2021-08-27 14:29:44,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:29:44,316 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2021-08-27 14:29:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2021-08-27 14:29:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-08-27 14:29:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2021-08-27 14:29:44,318 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2021-08-27 14:29:44,318 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2021-08-27 14:29:44,318 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:29:44,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2021-08-27 14:29:44,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:44,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:29:44,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:29:44,319 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:29:44,319 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:29:44,319 INFO L791 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 328#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 338#L367 assume !(main_~length~0 < 1); 329#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 330#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 331#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 339#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 342#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 340#L370-3 assume !(main_~i~0 < main_~length~0); 336#L370-4 main_~j~0 := 0; 337#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 334#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 335#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 332#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 333#L378-2 [2021-08-27 14:29:44,319 INFO L793 eck$LassoCheckResult]: Loop: 333#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 341#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 333#L378-2 [2021-08-27 14:29:44,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:44,320 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2021-08-27 14:29:44,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:44,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395954718] [2021-08-27 14:29:44,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:44,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:29:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:29:44,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:29:44,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395954718] [2021-08-27 14:29:44,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395954718] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:29:44,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411679016] [2021-08-27 14:29:44,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:29:44,370 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:29:44,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:44,371 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:29:44,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-27 14:29:44,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:29:44,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:29:44,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 14:29:44,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:29:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:29:44,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411679016] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:29:44,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:29:44,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-08-27 14:29:44,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517673645] [2021-08-27 14:29:44,534 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:29:44,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:44,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2021-08-27 14:29:44,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:44,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365385855] [2021-08-27 14:29:44,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:44,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,540 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,544 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:44,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:29:44,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 14:29:44,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-27 14:29:44,598 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:29:44,701 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2021-08-27 14:29:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 14:29:44,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2021-08-27 14:29:44,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:44,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 27 transitions. [2021-08-27 14:29:44,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:29:44,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:29:44,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-08-27 14:29:44,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:29:44,709 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-08-27 14:29:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-08-27 14:29:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-08-27 14:29:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-08-27 14:29:44,711 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-08-27 14:29:44,711 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-08-27 14:29:44,711 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:29:44,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2021-08-27 14:29:44,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:44,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:29:44,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:29:44,712 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:29:44,712 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:29:44,712 INFO L791 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 439#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 449#L367 assume !(main_~length~0 < 1); 440#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 441#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 442#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 450#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 455#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 451#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 452#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 453#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 456#L370-3 assume !(main_~i~0 < main_~length~0); 443#L370-4 main_~j~0 := 0; 444#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 447#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 448#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 445#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 446#L378-2 [2021-08-27 14:29:44,712 INFO L793 eck$LassoCheckResult]: Loop: 446#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 454#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 446#L378-2 [2021-08-27 14:29:44,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2021-08-27 14:29:44,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:44,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940093662] [2021-08-27 14:29:44,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:44,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,755 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,791 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:44,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2021-08-27 14:29:44,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:44,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748945071] [2021-08-27 14:29:44,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:44,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,801 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,808 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2021-08-27 14:29:44,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:44,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333427776] [2021-08-27 14:29:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:44,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,851 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:44,906 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:45,410 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:29:45,410 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:29:45,410 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:29:45,410 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:29:45,410 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:29:45,410 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:45,410 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:29:45,410 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:29:45,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration6_Lasso [2021-08-27 14:29:45,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:29:45,410 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:29:45,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:29:45,874 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:29:45,874 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:29:45,875 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:45,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:45,881 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:45,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:45,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:45,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:45,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:45,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:45,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:45,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:45,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:45,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 14:29:45,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:45,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:45,940 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:45,941 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:45,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 14:29:45,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:45,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:45,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:45,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:45,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:45,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:45,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:45,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:45,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:46,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:46,001 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:46,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:46,002 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:46,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 14:29:46,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:46,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:46,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:46,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:46,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:46,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:29:46,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:29:46,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:46,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:46,033 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:46,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:46,034 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:46,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 14:29:46,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:46,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:46,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:46,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:46,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:46,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:46,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:46,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:46,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:46,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:46,061 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:46,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:46,062 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:46,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 14:29:46,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:46,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:46,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:46,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:46,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:46,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:46,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:46,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:46,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:46,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-08-27 14:29:46,087 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:46,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:46,092 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:46,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 14:29:46,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:46,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:46,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:29:46,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:46,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:46,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:46,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:29:46,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:29:46,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:46,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:46,117 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:46,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:46,118 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:46,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-27 14:29:46,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:46,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:46,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:46,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:46,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:46,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:29:46,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:29:46,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:29:46,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:46,183 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:46,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:46,184 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:46,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-27 14:29:46,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:29:46,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:29:46,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:29:46,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:29:46,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:29:46,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:29:46,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:29:46,214 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:29:46,238 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2021-08-27 14:29:46,239 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-08-27 14:29:46,239 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:29:46,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:46,244 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:29:46,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-27 14:29:46,245 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:29:46,251 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-08-27 14:29:46,251 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:29:46,251 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3, ULTIMATE.start_main_~j~0) = 3*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3 - 8*ULTIMATE.start_main_~j~0 Supporting invariants [-1*ULTIMATE.start_main_~length~0 + 2 >= 0] [2021-08-27 14:29:46,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-08-27 14:29:46,276 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2021-08-27 14:29:46,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:29:46,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 14:29:46,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:29:46,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 14:29:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:29:46,603 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 14:29:46,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:29:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:29:46,643 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2021-08-27 14:29:46,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:46,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 47 transitions. Complement of second has 11 states. [2021-08-27 14:29:46,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2021-08-27 14:29:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2021-08-27 14:29:46,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 2 letters. [2021-08-27 14:29:46,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:29:46,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 19 letters. Loop has 2 letters. [2021-08-27 14:29:46,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:29:46,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 4 letters. [2021-08-27 14:29:46,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:29:46,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2021-08-27 14:29:46,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:46,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 47 transitions. [2021-08-27 14:29:46,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-08-27 14:29:46,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-08-27 14:29:46,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2021-08-27 14:29:46,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:29:46,754 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2021-08-27 14:29:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2021-08-27 14:29:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2021-08-27 14:29:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-08-27 14:29:46,757 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-27 14:29:46,757 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-27 14:29:46,757 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:29:46,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2021-08-27 14:29:46,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:29:46,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:29:46,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:29:46,759 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:29:46,759 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:29:46,759 INFO L791 eck$LassoCheckResult]: Stem: 615#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 616#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 626#L367 assume !(main_~length~0 < 1); 617#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 618#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 619#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 627#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 636#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 628#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 629#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 633#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 634#L370-3 assume !(main_~i~0 < main_~length~0); 635#L370-4 main_~j~0 := 0; 641#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 640#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 639#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 637#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 638#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 622#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 623#L378-2 [2021-08-27 14:29:46,759 INFO L793 eck$LassoCheckResult]: Loop: 623#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 632#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 623#L378-2 [2021-08-27 14:29:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2021-08-27 14:29:46,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:46,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838946185] [2021-08-27 14:29:46,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:46,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:29:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:29:47,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:29:47,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838946185] [2021-08-27 14:29:47,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838946185] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:29:47,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82141028] [2021-08-27 14:29:47,112 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:29:47,113 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:29:47,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:29:47,114 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:29:47,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-27 14:29:47,213 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-08-27 14:29:47,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:29:47,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 14:29:47,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:29:47,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:29:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 14:29:47,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82141028] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:29:47,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:29:47,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2021-08-27 14:29:47,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181635531] [2021-08-27 14:29:47,445 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:29:47,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:47,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2021-08-27 14:29:47,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:47,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403693251] [2021-08-27 14:29:47,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:47,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:47,450 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:47,453 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:47,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:29:47,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 14:29:47,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-08-27 14:29:47,500 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:29:47,639 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2021-08-27 14:29:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 14:29:47,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2021-08-27 14:29:47,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 14:29:47,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 54 transitions. [2021-08-27 14:29:47,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-08-27 14:29:47,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-08-27 14:29:47,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2021-08-27 14:29:47,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:29:47,642 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2021-08-27 14:29:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2021-08-27 14:29:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2021-08-27 14:29:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:29:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2021-08-27 14:29:47,645 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2021-08-27 14:29:47,645 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2021-08-27 14:29:47,645 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:29:47,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2021-08-27 14:29:47,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 14:29:47,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:29:47,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:29:47,646 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:29:47,646 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:29:47,646 INFO L791 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 762#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 771#L367 assume !(main_~length~0 < 1); 763#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 764#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 765#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 772#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 783#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 773#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 774#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 775#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 780#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 782#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 778#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 779#L370-3 assume !(main_~i~0 < main_~length~0); 766#L370-4 main_~j~0 := 0; 767#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 797#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 795#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 790#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 788#L378-2 [2021-08-27 14:29:47,647 INFO L793 eck$LassoCheckResult]: Loop: 788#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 784#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 785#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 789#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 788#L378-2 [2021-08-27 14:29:47,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:47,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1570402076, now seen corresponding path program 6 times [2021-08-27 14:29:47,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:47,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018586724] [2021-08-27 14:29:47,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:47,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:47,664 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:47,679 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:47,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:47,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2021-08-27 14:29:47,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:47,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518851634] [2021-08-27 14:29:47,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:47,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:47,684 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:47,687 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:29:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash -507624276, now seen corresponding path program 7 times [2021-08-27 14:29:47,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:29:47,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783206549] [2021-08-27 14:29:47,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:29:47,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:29:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:47,707 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:29:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:29:47,726 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:29:48,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:29:48 BoogieIcfgContainer [2021-08-27 14:29:48,460 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:29:48,461 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:29:48,461 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:29:48,461 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:29:48,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:29:39" (3/4) ... [2021-08-27 14:29:48,470 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 14:29:48,511 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 14:29:48,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:29:48,513 INFO L168 Benchmark]: Toolchain (without parser) took 9418.31 ms. Allocated memory was 67.1 MB in the beginning and 188.7 MB in the end (delta: 121.6 MB). Free memory was 47.0 MB in the beginning and 153.1 MB in the end (delta: -106.1 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. [2021-08-27 14:29:48,513 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 67.1 MB. Free memory is still 49.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:29:48,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.35 ms. Allocated memory is still 67.1 MB. Free memory was 46.8 MB in the beginning and 44.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 14:29:48,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.26 ms. Allocated memory is still 67.1 MB. Free memory was 44.5 MB in the beginning and 42.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:29:48,514 INFO L168 Benchmark]: Boogie Preprocessor took 41.57 ms. Allocated memory is still 67.1 MB. Free memory was 42.9 MB in the beginning and 41.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:29:48,514 INFO L168 Benchmark]: RCFGBuilder took 355.30 ms. Allocated memory was 67.1 MB in the beginning and 88.1 MB in the end (delta: 21.0 MB). Free memory was 41.5 MB in the beginning and 68.2 MB in the end (delta: -26.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. [2021-08-27 14:29:48,514 INFO L168 Benchmark]: BuchiAutomizer took 8500.28 ms. Allocated memory was 88.1 MB in the beginning and 188.7 MB in the end (delta: 100.7 MB). Free memory was 68.2 MB in the beginning and 155.1 MB in the end (delta: -86.9 MB). Peak memory consumption was 111.3 MB. Max. memory is 16.1 GB. [2021-08-27 14:29:48,515 INFO L168 Benchmark]: Witness Printer took 50.33 ms. Allocated memory is still 188.7 MB. Free memory was 155.1 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:29:48,516 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 67.1 MB. Free memory is still 49.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 414.35 ms. Allocated memory is still 67.1 MB. Free memory was 46.8 MB in the beginning and 44.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.26 ms. Allocated memory is still 67.1 MB. Free memory was 44.5 MB in the beginning and 42.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.57 ms. Allocated memory is still 67.1 MB. Free memory was 42.9 MB in the beginning and 41.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 355.30 ms. Allocated memory was 67.1 MB in the beginning and 88.1 MB in the end (delta: 21.0 MB). Free memory was 41.5 MB in the beginning and 68.2 MB in the end (delta: -26.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 8500.28 ms. Allocated memory was 88.1 MB in the beginning and 188.7 MB in the end (delta: 100.7 MB). Free memory was 68.2 MB in the beginning and 155.1 MB in the end (delta: -86.9 MB). Peak memory consumption was 111.3 MB. Max. memory is 16.1 GB. * Witness Printer took 50.33 ms. Allocated memory is still 188.7 MB. Free memory was 155.1 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function length + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -8 * j + 3 * unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 9 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. The remainder module has 38 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 7.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 22.3ms AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 72 SDtfs, 120 SDslu, 104 SDs, 0 SdLazy, 282 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 202.6ms Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax100 hnf99 lsp92 ukn91 mio100 lsp53 div147 bol100 ite100 ukn100 eq155 hnf70 smp93 dnf103 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: 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: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11547d01=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bcf98ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a7fb7de=0, length=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@26a0e02a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a7fb7de=2, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@679a30c8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@12afc9c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@138b70c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@cd7bded=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i