./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 f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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.1.24-f6fb2bb [2019-11-19 19:56:30,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 19:56:30,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 19:56:30,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 19:56:30,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 19:56:30,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 19:56:30,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 19:56:30,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 19:56:30,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 19:56:30,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 19:56:30,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 19:56:30,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 19:56:30,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 19:56:30,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 19:56:30,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 19:56:30,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 19:56:30,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 19:56:30,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 19:56:30,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 19:56:30,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 19:56:30,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 19:56:30,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 19:56:30,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 19:56:30,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 19:56:30,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 19:56:30,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 19:56:30,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 19:56:30,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 19:56:30,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 19:56:30,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 19:56:30,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 19:56:30,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 19:56:30,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 19:56:30,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 19:56:30,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 19:56:30,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 19:56:30,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 19:56:30,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 19:56:30,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 19:56:30,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 19:56:30,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 19:56:30,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-19 19:56:30,869 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 19:56:30,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 19:56:30,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 19:56:30,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 19:56:30,871 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 19:56:30,872 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 19:56:30,872 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 19:56:30,872 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 19:56:30,872 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 19:56:30,873 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 19:56:30,874 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 19:56:30,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 19:56:30,874 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 19:56:30,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 19:56:30,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 19:56:30,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 19:56:30,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 19:56:30,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 19:56:30,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 19:56:30,876 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 19:56:30,876 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 19:56:30,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 19:56:30,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 19:56:30,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 19:56:30,877 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 19:56:30,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 19:56:30,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 19:56:30,878 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 19:56:30,880 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 19:56:30,880 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2019-11-19 19:56:31,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 19:56:31,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 19:56:31,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 19:56:31,211 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 19:56:31,212 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 19:56:31,213 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-19 19:56:31,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4f60ec2/2917195bec75470ca7d3b74c3bc8be5d/FLAG45d4254d2 [2019-11-19 19:56:31,887 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 19:56:31,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-19 19:56:31,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4f60ec2/2917195bec75470ca7d3b74c3bc8be5d/FLAG45d4254d2 [2019-11-19 19:56:32,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4f60ec2/2917195bec75470ca7d3b74c3bc8be5d [2019-11-19 19:56:32,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 19:56:32,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 19:56:32,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 19:56:32,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 19:56:32,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 19:56:32,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:32" (1/1) ... [2019-11-19 19:56:32,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d34026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32, skipping insertion in model container [2019-11-19 19:56:32,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:32" (1/1) ... [2019-11-19 19:56:32,183 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 19:56:32,227 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 19:56:32,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:56:32,723 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 19:56:32,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:56:32,832 INFO L192 MainTranslator]: Completed translation [2019-11-19 19:56:32,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32 WrapperNode [2019-11-19 19:56:32,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 19:56:32,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 19:56:32,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 19:56:32,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 19:56:32,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32" (1/1) ... [2019-11-19 19:56:32,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32" (1/1) ... [2019-11-19 19:56:32,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 19:56:32,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 19:56:32,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 19:56:32,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 19:56:32,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32" (1/1) ... [2019-11-19 19:56:32,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32" (1/1) ... [2019-11-19 19:56:32,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32" (1/1) ... [2019-11-19 19:56:32,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32" (1/1) ... [2019-11-19 19:56:32,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32" (1/1) ... [2019-11-19 19:56:32,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32" (1/1) ... [2019-11-19 19:56:32,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32" (1/1) ... [2019-11-19 19:56:32,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 19:56:32,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 19:56:32,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 19:56:32,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 19:56:32,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 19:56:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 19:56:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 19:56:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 19:56:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 19:56:32,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 19:56:33,267 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 19:56:33,267 INFO L285 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-19 19:56:33,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:33 BoogieIcfgContainer [2019-11-19 19:56:33,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 19:56:33,270 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 19:56:33,270 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 19:56:33,274 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 19:56:33,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 19:56:33,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:56:32" (1/3) ... [2019-11-19 19:56:33,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44965dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:56:33, skipping insertion in model container [2019-11-19 19:56:33,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 19:56:33,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:32" (2/3) ... [2019-11-19 19:56:33,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44965dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:56:33, skipping insertion in model container [2019-11-19 19:56:33,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 19:56:33,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:33" (3/3) ... [2019-11-19 19:56:33,280 INFO L371 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original.i [2019-11-19 19:56:33,350 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 19:56:33,351 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 19:56:33,351 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 19:56:33,352 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 19:56:33,352 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 19:56:33,352 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 19:56:33,352 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 19:56:33,352 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 19:56:33,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-19 19:56:33,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-19 19:56:33,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:33,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:33,392 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 19:56:33,392 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 19:56:33,393 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 19:56:33,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-19 19:56:33,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-19 19:56:33,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:33,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:33,395 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 19:56:33,395 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 19:56:33,402 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#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; 16#L367true assume !(main_~length~0 < 1); 5#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; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2019-11-19 19:56:33,402 INFO L796 eck$LassoCheckResult]: Loop: 17#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); 9#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); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2019-11-19 19:56:33,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-19 19:56:33,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:33,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645474059] [2019-11-19 19:56:33,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:33,542 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:33,544 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-19 19:56:33,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:33,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424487203] [2019-11-19 19:56:33,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:33,592 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-19 19:56:33,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:33,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021244522] [2019-11-19 19:56:33,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:33,647 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:33,868 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-11-19 19:56:34,016 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 19:56:34,017 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 19:56:34,018 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 19:56:34,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 19:56:34,018 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 19:56:34,018 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,018 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 19:56:34,019 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 19:56:34,019 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration1_Lasso [2019-11-19 19:56:34,019 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 19:56:34,019 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 19:56:34,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:34,580 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 19:56:34,586 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:34,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:34,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:34,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:34,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:34,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:34,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:34,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:34,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:34,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:34,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:34,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:34,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:34,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:34,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:34,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:34,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:34,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:34,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:34,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:34,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:34,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:34,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:34,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:34,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:34,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:34,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:34,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:34,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:34,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:34,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:34,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:34,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:34,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:34,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:34,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:34,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:34,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:34,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:34,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:34,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:34,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:34,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:34,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:34,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:34,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:34,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:34,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:34,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:34,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:34,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:34,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:34,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:34,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:34,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:34,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:34,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:34,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:34,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:34,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:34,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:34,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:34,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:34,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:34,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:34,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:34,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:34,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:34,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:34,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:34,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:34,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:34,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:34,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:34,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:34,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:34,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:34,811 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 19:56:34,848 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-19 19:56:34,848 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:34,858 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 19:56:34,861 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-19 19:56:34,862 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 19:56:34,862 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~length~0 >= 0] [2019-11-19 19:56:34,881 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-19 19:56:34,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 19:56:34,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:34,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 19:56:34,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:35,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-19 19:56:35,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:35,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:35,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:56:35,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-19 19:56:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:35,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 19:56:35,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:35,165 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-19 19:56:35,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-11-19 19:56:35,310 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 32 states and 47 transitions. Complement of second has 9 states. [2019-11-19 19:56:35,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 19:56:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 19:56:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2019-11-19 19:56:35,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-19 19:56:35,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:35,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-19 19:56:35,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:35,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-19 19:56:35,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:35,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-11-19 19:56:35,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:35,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 17 transitions. [2019-11-19 19:56:35,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-19 19:56:35,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-19 19:56:35,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-19 19:56:35,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:56:35,343 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-19 19:56:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-19 19:56:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-19 19:56:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-19 19:56:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-19 19:56:35,377 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-19 19:56:35,378 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-19 19:56:35,378 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 19:56:35,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-19 19:56:35,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:35,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:35,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:35,382 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:35,382 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 19:56:35,383 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#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; 126#L367 assume !(main_~length~0 < 1); 131#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; 132#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 133#L370-3 assume !(main_~i~0 < main_~length~0); 127#L370-4 main_~j~0 := 0; 128#L378-2 [2019-11-19 19:56:35,383 INFO L796 eck$LassoCheckResult]: Loop: 128#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); 130#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; 128#L378-2 [2019-11-19 19:56:35,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:35,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-19 19:56:35,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:35,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090911573] [2019-11-19 19:56:35,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:35,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090911573] [2019-11-19 19:56:35,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:56:35,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 19:56:35,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860769390] [2019-11-19 19:56:35,504 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:56:35,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:35,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-19 19:56:35,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:35,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666617085] [2019-11-19 19:56:35,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:35,540 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:35,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:56:35,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:56:35,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 19:56:35,627 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-19 19:56:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:56:35,674 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-19 19:56:35,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:56:35,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-19 19:56:35,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:35,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-19 19:56:35,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-19 19:56:35,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-19 19:56:35,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-19 19:56:35,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:56:35,683 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-19 19:56:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-19 19:56:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-19 19:56:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-19 19:56:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-19 19:56:35,691 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-19 19:56:35,691 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-19 19:56:35,691 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 19:56:35,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-19 19:56:35,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:35,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:35,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:35,694 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:35,696 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 19:56:35,696 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 156#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; 157#L367 assume !(main_~length~0 < 1); 164#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; 165#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 166#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); 158#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; 159#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 167#L370-3 assume !(main_~i~0 < main_~length~0); 160#L370-4 main_~j~0 := 0; 161#L378-2 [2019-11-19 19:56:35,697 INFO L796 eck$LassoCheckResult]: Loop: 161#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); 163#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; 161#L378-2 [2019-11-19 19:56:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:35,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-19 19:56:35,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:35,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131228350] [2019-11-19 19:56:35,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:35,770 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:35,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:35,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-19 19:56:35,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:35,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693353147] [2019-11-19 19:56:35,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:35,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:35,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-19 19:56:35,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:35,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840584661] [2019-11-19 19:56:35,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:35,915 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:36,182 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-11-19 19:56:36,543 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-11-19 19:56:36,548 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 19:56:36,548 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 19:56:36,549 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 19:56:36,549 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 19:56:36,549 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 19:56:36,549 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:36,549 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 19:56:36,549 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 19:56:36,549 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration3_Lasso [2019-11-19 19:56:36,549 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 19:56:36,549 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 19:56:36,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:36,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:36,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:36,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:36,852 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-19 19:56:36,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:36,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:36,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:36,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:36,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:36,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:36,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:36,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:37,333 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2019-11-19 19:56:37,359 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 19:56:37,359 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:37,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:37,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:37,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:37,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:37,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:37,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:37,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:37,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:37,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:37,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:37,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:37,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:37,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:37,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:37,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:37,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:37,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:37,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:37,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:37,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:37,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:37,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:37,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:37,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:37,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:37,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:37,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:37,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:37,423 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-19 19:56:37,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:37,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:37,428 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-19 19:56:37,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:37,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:37,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:37,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:37,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:37,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:37,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:37,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:37,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:37,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:37,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:37,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:37,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:37,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:37,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:37,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:37,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:37,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 19:56:37,561 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2019-11-19 19:56:37,561 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:37,570 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 19:56:37,575 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-19 19:56:37,575 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 19:56:37,575 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~arr~0.offset >= 0] [2019-11-19 19:56:37,589 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-19 19:56:37,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 19:56:37,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:37,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 19:56:37,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:37,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 19:56:37,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:37,688 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-19 19:56:37,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-19 19:56:37,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 16 states and 22 transitions. Complement of second has 6 states. [2019-11-19 19:56:37,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-19 19:56:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 19:56:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-19 19:56:37,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-19 19:56:37,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:37,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-19 19:56:37,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:37,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-19 19:56:37,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:37,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-19 19:56:37,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:37,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-19 19:56:37,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-19 19:56:37,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-19 19:56:37,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-19 19:56:37,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 19:56:37,741 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-19 19:56:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-19 19:56:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-19 19:56:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-19 19:56:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-19 19:56:37,743 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-19 19:56:37,744 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-19 19:56:37,744 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 19:56:37,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-19 19:56:37,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:37,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:37,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:37,746 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:37,746 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 19:56:37,747 INFO L794 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 264#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; 265#L367 assume !(main_~length~0 < 1); 276#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; 277#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 278#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); 266#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; 267#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 279#L370-3 assume !(main_~i~0 < main_~length~0); 268#L370-4 main_~j~0 := 0; 269#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); 275#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; 271#L378-2 [2019-11-19 19:56:37,747 INFO L796 eck$LassoCheckResult]: Loop: 271#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); 272#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; 271#L378-2 [2019-11-19 19:56:37,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-19 19:56:37,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:37,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588508245] [2019-11-19 19:56:37,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:37,781 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-19 19:56:37,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:37,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190353872] [2019-11-19 19:56:37,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:37,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:37,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:37,795 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-19 19:56:37,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:37,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300227241] [2019-11-19 19:56:37,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 19:56:37,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300227241] [2019-11-19 19:56:37,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580709229] [2019-11-19 19:56:37,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:56:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:37,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 19:56:37,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 19:56:37,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 19:56:37,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-19 19:56:37,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171644615] [2019-11-19 19:56:37,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:56:37,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:56:37,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:56:37,965 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-19 19:56:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:56:37,992 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-11-19 19:56:37,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:56:37,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-11-19 19:56:37,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:37,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2019-11-19 19:56:37,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-19 19:56:37,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-19 19:56:37,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-11-19 19:56:37,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 19:56:37,996 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-19 19:56:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-11-19 19:56:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-19 19:56:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-19 19:56:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-19 19:56:37,998 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-19 19:56:37,998 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-19 19:56:37,998 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 19:56:37,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-19 19:56:38,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:38,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:38,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:38,001 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:38,001 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 19:56:38,001 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 348#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; 349#L367 assume !(main_~length~0 < 1); 358#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; 359#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 360#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); 350#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; 351#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 361#L370-3 assume !(main_~i~0 < main_~length~0); 352#L370-4 main_~j~0 := 0; 353#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); 355#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; 356#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); 357#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; 362#L378-2 [2019-11-19 19:56:38,001 INFO L796 eck$LassoCheckResult]: Loop: 362#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); 363#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; 362#L378-2 [2019-11-19 19:56:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2019-11-19 19:56:38,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:38,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013554287] [2019-11-19 19:56:38,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:38,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013554287] [2019-11-19 19:56:38,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194409207] [2019-11-19 19:56:38,141 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:56:38,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 19:56:38,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:56:38,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 19:56:38,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:38,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:56:38,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-19 19:56:38,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961186015] [2019-11-19 19:56:38,230 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:56:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:38,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-19 19:56:38,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:38,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313879636] [2019-11-19 19:56:38,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:38,239 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:38,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:56:38,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 19:56:38,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-19 19:56:38,313 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 13 states. [2019-11-19 19:56:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:56:38,484 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-19 19:56:38,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 19:56:38,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-19 19:56:38,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:38,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2019-11-19 19:56:38,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-19 19:56:38,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-19 19:56:38,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-19 19:56:38,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 19:56:38,487 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-19 19:56:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-19 19:56:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-19 19:56:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 19:56:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-19 19:56:38,490 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-19 19:56:38,490 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-19 19:56:38,490 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 19:56:38,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-19 19:56:38,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:38,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:38,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:38,491 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:38,491 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 19:56:38,491 INFO L794 eck$LassoCheckResult]: Stem: 464#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 460#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; 461#L367 assume !(main_~length~0 < 1); 470#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; 471#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 472#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); 475#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; 473#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 474#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); 458#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; 459#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 476#L370-3 assume !(main_~i~0 < main_~length~0); 462#L370-4 main_~j~0 := 0; 463#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); 468#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; 467#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); 469#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; 465#L378-2 [2019-11-19 19:56:38,492 INFO L796 eck$LassoCheckResult]: Loop: 465#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); 466#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; 465#L378-2 [2019-11-19 19:56:38,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:38,492 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2019-11-19 19:56:38,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:38,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991463317] [2019-11-19 19:56:38,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:38,558 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:38,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:38,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-19 19:56:38,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:38,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19087212] [2019-11-19 19:56:38,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:38,574 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:38,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2019-11-19 19:56:38,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:38,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044205030] [2019-11-19 19:56:38,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:38,674 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:39,169 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 122 [2019-11-19 19:56:39,639 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2019-11-19 19:56:39,643 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 19:56:39,643 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 19:56:39,644 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 19:56:39,644 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 19:56:39,644 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 19:56:39,644 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:39,644 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 19:56:39,644 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 19:56:39,644 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration6_Lasso [2019-11-19 19:56:39,644 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 19:56:39,644 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 19:56:39,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:39,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:39,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:39,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:39,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:39,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:39,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:39,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:39,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:39,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:39,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:39,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:40,322 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 19:56:40,322 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:40,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:40,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:40,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:40,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:40,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:40,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:40,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:40,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:40,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:40,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:40,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:40,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:40,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:40,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:40,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:40,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:40,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:40,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:40,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:40,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:40,369 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-19 19:56:40,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:40,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:40,373 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-19 19:56:40,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:40,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:40,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:40,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:40,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:40,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:40,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:40,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:40,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:40,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:40,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 19:56:40,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:40,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:40,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:40,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:40,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:40,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:40,435 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 19:56:40,470 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-19 19:56:40,470 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:40,478 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 19:56:40,481 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 19:56:40,481 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 19:56:40,481 INFO L512 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 [] [2019-11-19 19:56:40,497 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-19 19:56:40,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:40,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 19:56:40,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:40,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 19:56:40,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:40,545 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 [2019-11-19 19:56:40,545 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-19 19:56:40,562 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 5 states. [2019-11-19 19:56:40,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-19 19:56:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 19:56:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-19 19:56:40,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-19 19:56:40,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:40,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-19 19:56:40,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:40,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 4 letters. [2019-11-19 19:56:40,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:40,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-19 19:56:40,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:40,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2019-11-19 19:56:40,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-19 19:56:40,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-19 19:56:40,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-11-19 19:56:40,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 19:56:40,568 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-19 19:56:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-11-19 19:56:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-19 19:56:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-19 19:56:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-19 19:56:40,571 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-19 19:56:40,571 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-19 19:56:40,571 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 19:56:40,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-11-19 19:56:40,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 19:56:40,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:40,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:40,573 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:40,573 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 19:56:40,573 INFO L794 eck$LassoCheckResult]: Stem: 608#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 604#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; 605#L367 assume !(main_~length~0 < 1); 614#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; 615#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 616#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); 620#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; 617#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 618#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); 602#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; 603#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 621#L370-3 assume !(main_~i~0 < main_~length~0); 606#L370-4 main_~j~0 := 0; 607#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); 612#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; 611#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); 613#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; 619#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; 609#L378-2 [2019-11-19 19:56:40,573 INFO L796 eck$LassoCheckResult]: Loop: 609#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); 610#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; 609#L378-2 [2019-11-19 19:56:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:40,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2019-11-19 19:56:40,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:40,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135729761] [2019-11-19 19:56:40,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 19:56:40,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135729761] [2019-11-19 19:56:40,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243244643] [2019-11-19 19:56:40,763 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:56:40,806 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-19 19:56:40,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:56:40,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 19:56:40,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:40,900 INFO L377 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 21 treesize of output 9 [2019-11-19 19:56:40,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:40,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:40,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:56:40,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2019-11-19 19:56:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 19:56:40,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:56:40,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-19 19:56:40,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086965192] [2019-11-19 19:56:40,921 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:56:40,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:40,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2019-11-19 19:56:40,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:40,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772361289] [2019-11-19 19:56:40,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:40,930 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:40,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:56:40,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 19:56:40,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-19 19:56:40,996 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 12 states. [2019-11-19 19:56:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:56:41,119 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-19 19:56:41,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 19:56:41,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-11-19 19:56:41,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-19 19:56:41,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 46 transitions. [2019-11-19 19:56:41,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-19 19:56:41,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-19 19:56:41,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2019-11-19 19:56:41,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 19:56:41,124 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-19 19:56:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2019-11-19 19:56:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-11-19 19:56:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-19 19:56:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-11-19 19:56:41,130 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-19 19:56:41,130 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-19 19:56:41,130 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 19:56:41,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2019-11-19 19:56:41,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-19 19:56:41,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:41,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:41,132 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:41,132 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 19:56:41,132 INFO L794 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 733#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; 734#L367 assume !(main_~length~0 < 1); 744#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; 745#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 746#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); 735#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; 736#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 750#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); 751#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; 747#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 748#L370-3 assume !(main_~i~0 < main_~length~0); 737#L370-4 main_~j~0 := 0; 738#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); 740#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; 766#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); 742#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; 741#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); 743#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; 749#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); 761#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; 755#L378-2 [2019-11-19 19:56:41,132 INFO L796 eck$LassoCheckResult]: Loop: 755#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); 754#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; 755#L378-2 [2019-11-19 19:56:41,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:41,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1144787610, now seen corresponding path program 6 times [2019-11-19 19:56:41,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:41,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390252574] [2019-11-19 19:56:41,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 19:56:41,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390252574] [2019-11-19 19:56:41,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860712350] [2019-11-19 19:56:41,281 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:56:41,327 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-11-19 19:56:41,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 19:56:41,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 19:56:41,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:41,383 INFO L377 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 25 treesize of output 9 [2019-11-19 19:56:41,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:41,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:41,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:56:41,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-11-19 19:56:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 19:56:41,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:56:41,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2019-11-19 19:56:41,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327531207] [2019-11-19 19:56:41,402 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:56:41,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2019-11-19 19:56:41,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:41,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804259972] [2019-11-19 19:56:41,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:41,411 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:41,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:56:41,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 19:56:41,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-11-19 19:56:41,478 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand 14 states. [2019-11-19 19:56:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:56:41,960 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2019-11-19 19:56:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 19:56:41,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2019-11-19 19:56:41,963 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-19 19:56:41,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 55 states and 67 transitions. [2019-11-19 19:56:41,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-19 19:56:41,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-11-19 19:56:41,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 67 transitions. [2019-11-19 19:56:41,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 19:56:41,965 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-11-19 19:56:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 67 transitions. [2019-11-19 19:56:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-11-19 19:56:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 19:56:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-19 19:56:41,969 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-19 19:56:41,969 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-19 19:56:41,969 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 19:56:41,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-11-19 19:56:41,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-19 19:56:41,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:41,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:41,970 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:41,970 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-19 19:56:41,971 INFO L794 eck$LassoCheckResult]: Stem: 937#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 931#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; 932#L367 assume !(main_~length~0 < 1); 942#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; 943#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 944#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); 950#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; 955#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 951#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); 952#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; 945#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 946#L370-3 assume !(main_~i~0 < main_~length~0); 935#L370-4 main_~j~0 := 0; 936#L378-2 [2019-11-19 19:56:41,971 INFO L796 eck$LassoCheckResult]: Loop: 936#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); 938#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; 959#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); 947#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; 936#L378-2 [2019-11-19 19:56:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1781949270, now seen corresponding path program 2 times [2019-11-19 19:56:41,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:41,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22530494] [2019-11-19 19:56:41,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:41,987 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:41,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:41,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-19 19:56:41,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:41,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211972458] [2019-11-19 19:56:41,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:41,998 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:41,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:41,999 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 7 times [2019-11-19 19:56:41,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:41,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065655666] [2019-11-19 19:56:41,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:42,035 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:42,278 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-11-19 19:56:42,693 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-11-19 19:56:43,382 WARN L191 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-11-19 19:56:43,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 07:56:43 BoogieIcfgContainer [2019-11-19 19:56:43,411 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 19:56:43,411 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 19:56:43,411 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 19:56:43,411 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 19:56:43,412 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:33" (3/4) ... [2019-11-19 19:56:43,415 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-19 19:56:43,463 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 19:56:43,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 19:56:43,465 INFO L168 Benchmark]: Toolchain (without parser) took 11300.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -268.5 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2019-11-19 19:56:43,465 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:56:43,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-19 19:56:43,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:56:43,466 INFO L168 Benchmark]: Boogie Preprocessor took 24.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:56:43,467 INFO L168 Benchmark]: RCFGBuilder took 358.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-19 19:56:43,468 INFO L168 Benchmark]: BuchiAutomizer took 10140.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.7 MB). Peak memory consumption was 443.2 MB. Max. memory is 11.5 GB. [2019-11-19 19:56:43,468 INFO L168 Benchmark]: Witness Printer took 52.20 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-11-19 19:56:43,471 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 667.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 358.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10140.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.7 MB). Peak memory consumption was 443.2 MB. Max. memory is 11.5 GB. * Witness Printer took 52.20 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (5 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -4 * i and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -2 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 14 locations. The remainder module has 33 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.0s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 8.3s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 76 SDtfs, 133 SDslu, 125 SDs, 0 SdLazy, 354 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital168 mio100 ax100 hnf99 lsp80 ukn95 mio100 lsp51 div155 bol100 ite100 ukn100 eq157 hnf65 smp92 dnf109 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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=646} State at position 1 is {NULL=0, \result=0, NULL=646, arr=645, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@310a442b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1323ca90=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cd2740b=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@2236817a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cd2740b=645, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@399bf7d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@1e9b55d3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@643eb3f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@22f488d8=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