./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 870a7e5617be5a547f8d530603b5c27ad6cbb74bb05a83654285fee7bbb92753 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:34:38,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:34:38,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:34:38,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:34:38,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:34:38,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:34:38,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:34:38,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:34:38,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:34:38,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:34:38,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:34:38,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:34:38,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:34:38,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:34:38,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:34:38,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:34:38,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:34:38,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:34:38,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:34:38,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:34:38,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:34:38,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:34:38,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:34:38,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:34:38,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:34:38,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:34:38,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:34:38,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:34:38,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:34:38,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:34:38,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:34:38,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:34:38,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:34:38,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:34:38,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:34:38,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:34:38,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:34:38,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:34:38,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:34:38,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:34:38,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:34:38,518 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:34:38,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:34:38,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:34:38,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:34:38,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:34:38,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:34:38,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:34:38,536 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:34:38,536 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:34:38,536 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:34:38,536 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:34:38,536 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:34:38,536 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:34:38,537 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:34:38,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:34:38,537 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:34:38,537 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:34:38,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:34:38,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:34:38,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:34:38,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:34:38,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:34:38,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:34:38,538 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:34:38,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:34:38,538 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:34:38,539 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:34:38,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:34:38,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:34:38,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:34:38,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:34:38,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:34:38,540 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:34:38,540 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 870a7e5617be5a547f8d530603b5c27ad6cbb74bb05a83654285fee7bbb92753 [2022-02-21 04:34:38,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:34:38,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:34:38,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:34:38,755 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:34:38,756 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:34:38,757 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2022-02-21 04:34:38,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049ea05e0/e9b5de4d0938418aa8ca216402fc2aa0/FLAG82a3edc43 [2022-02-21 04:34:39,239 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:34:39,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2022-02-21 04:34:39,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049ea05e0/e9b5de4d0938418aa8ca216402fc2aa0/FLAG82a3edc43 [2022-02-21 04:34:39,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049ea05e0/e9b5de4d0938418aa8ca216402fc2aa0 [2022-02-21 04:34:39,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:34:39,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:34:39,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:39,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:34:39,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:34:39,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:39" (1/1) ... [2022-02-21 04:34:39,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc199e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:39, skipping insertion in model container [2022-02-21 04:34:39,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:39" (1/1) ... [2022-02-21 04:34:39,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:34:39,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:34:40,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:40,036 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:34:40,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:40,113 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:34:40,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40 WrapperNode [2022-02-21 04:34:40,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:40,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:40,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:34:40,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:34:40,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40" (1/1) ... [2022-02-21 04:34:40,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40" (1/1) ... [2022-02-21 04:34:40,154 INFO L137 Inliner]: procedures = 115, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-02-21 04:34:40,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:40,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:34:40,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:34:40,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:34:40,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40" (1/1) ... [2022-02-21 04:34:40,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40" (1/1) ... [2022-02-21 04:34:40,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40" (1/1) ... [2022-02-21 04:34:40,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40" (1/1) ... [2022-02-21 04:34:40,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40" (1/1) ... [2022-02-21 04:34:40,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40" (1/1) ... [2022-02-21 04:34:40,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40" (1/1) ... [2022-02-21 04:34:40,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:34:40,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:34:40,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:34:40,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:34:40,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40" (1/1) ... [2022-02-21 04:34:40,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:40,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:40,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:40,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:34:40,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:34:40,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:34:40,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:34:40,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:34:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:34:40,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:34:40,337 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:34:40,338 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:34:40,507 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:34:40,511 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:34:40,512 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:34:40,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:40 BoogieIcfgContainer [2022-02-21 04:34:40,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:34:40,514 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:34:40,514 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:34:40,517 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:34:40,518 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:40,518 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:34:39" (1/3) ... [2022-02-21 04:34:40,519 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50417b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:40, skipping insertion in model container [2022-02-21 04:34:40,519 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:40,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:40" (2/3) ... [2022-02-21 04:34:40,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50417b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:40, skipping insertion in model container [2022-02-21 04:34:40,520 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:40,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:40" (3/3) ... [2022-02-21 04:34:40,521 INFO L388 chiAutomizerObserver]: Analyzing ICFG add_last-alloca-1.i [2022-02-21 04:34:40,556 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:34:40,556 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:34:40,556 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:34:40,556 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:34:40,556 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:34:40,556 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:34:40,557 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:34:40,557 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:34:40,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:40,607 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:34:40,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:40,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:40,611 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:34:40,613 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:40,613 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:34:40,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:40,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:34:40,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:40,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:40,618 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:34:40,618 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:40,624 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 11#L515true assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 8#L515-2true call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 14#L517true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; 6#L520-3true [2022-02-21 04:34:40,624 INFO L793 eck$LassoCheckResult]: Loop: 6#L520-3true assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; 12#L520-2true main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6#L520-3true [2022-02-21 04:34:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-02-21 04:34:40,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:40,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654258018] [2022-02-21 04:34:40,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:40,753 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:40,797 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:40,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2022-02-21 04:34:40,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:40,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521397549] [2022-02-21 04:34:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:40,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:40,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:40,845 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2022-02-21 04:34:40,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:40,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608156893] [2022-02-21 04:34:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:40,889 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:40,925 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:41,212 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:41,212 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:41,212 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:41,212 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:41,213 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:41,213 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:41,213 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:41,213 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:41,213 INFO L133 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration1_Lasso [2022-02-21 04:34:41,213 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:41,214 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:41,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:41,851 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:41,854 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:41,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:41,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:41,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:41,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:34:41,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:41,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:41,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:41,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:41,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:41,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:41,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:41,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:41,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:41,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:34:41,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:41,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:41,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:41,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:34:41,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:41,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:41,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:41,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:41,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:41,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:41,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:41,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:42,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 04:34:42,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:42,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:42,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:42,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:34:42,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:42,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:42,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:42,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:42,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:42,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:42,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:42,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:42,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 04:34:42,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:42,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:42,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:42,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:34:42,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:34:42,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:42,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:42,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:42,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:42,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:42,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:42,165 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:42,195 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 04:34:42,195 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2022-02-21 04:34:42,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:42,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:42,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:34:42,248 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:42,269 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:34:42,269 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:42,270 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-02-21 04:34:42,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:34:42,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:42,304 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 04:34:42,308 INFO L390 LassoCheck]: Loop: "assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1;" "main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2022-02-21 04:34:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:42,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:34:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:42,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:42,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {23#unseeded} is VALID [2022-02-21 04:34:42,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {23#unseeded} is VALID [2022-02-21 04:34:42,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#unseeded} assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); {23#unseeded} is VALID [2022-02-21 04:34:42,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {23#unseeded} call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {23#unseeded} is VALID [2022-02-21 04:34:42,365 INFO L290 TraceCheckUtils]: 4: Hoare triple {23#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; {23#unseeded} is VALID [2022-02-21 04:34:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:42,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:34:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:42,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:42,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(>= oldRank0 (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; {68#(and (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~length~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|))))} is VALID [2022-02-21 04:34:42,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {68#(and (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~length~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|))))} main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {51#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))) unseeded)} is VALID [2022-02-21 04:34:42,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:42,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:42,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:42,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,420 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 [2022-02-21 04:34:42,421 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 41 transitions. Complement of second has 7 states. [2022-02-21 04:34:42,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:34:42,478 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:42,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,479 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:34:42,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:42,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:42,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:42,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:42,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:42,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2022-02-21 04:34:42,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:42,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:42,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:42,485 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:34:42,487 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:34:42,487 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:42,489 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:34:42,489 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 41 transitions. cyclomatic complexity: 14 [2022-02-21 04:34:42,490 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:34:42,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:42,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:42,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:42,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:42,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:42,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:42,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:42,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:42,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:42,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:34:42,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:34:42,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:34:42,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:34:42,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:34:42,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:34:42,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:42,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:42,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:34:42,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:42,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:42,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:42,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:42,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:42,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:42,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:42,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:42,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:42,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:42,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:42,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:42,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:42,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:42,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:34:42,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:42,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:42,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:42,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:42,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:42,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:42,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:42,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:42,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 41 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:34:42,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,504 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-21 04:34:42,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:42,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:34:42,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:34:42,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:42,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. cyclomatic complexity: 14 [2022-02-21 04:34:42,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:42,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2022-02-21 04:34:42,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 04:34:42,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 04:34:42,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-02-21 04:34:42,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:42,517 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 04:34:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-02-21 04:34:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-02-21 04:34:42,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:42,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,531 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,533 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:42,535 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 04:34:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 04:34:42,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:42,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:42,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 14 transitions. [2022-02-21 04:34:42,536 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 14 transitions. [2022-02-21 04:34:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:42,537 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 04:34:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 04:34:42,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:42,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:42,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:42,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-02-21 04:34:42,539 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 04:34:42,539 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 04:34:42,539 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:34:42,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-02-21 04:34:42,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:42,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:42,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:42,540 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:34:42,540 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:42,541 INFO L791 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 116#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 122#L515 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 120#L515-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 121#L517 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; 117#L520-3 assume !(main_~k~0#1 < main_~length~0#1); 114#L525-2 [2022-02-21 04:34:42,541 INFO L793 eck$LassoCheckResult]: Loop: 114#L525-2 call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4); 113#L525 assume !!(main_#t~mem6#1 != main_#t~mem7#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~post10#1.base, main_#t~post10#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~a~0#1.base, main_~a~0#1.offset := main_#t~post10#1.base, 4 + main_#t~post10#1.offset;havoc main_#t~post10#1.base, main_#t~post10#1.offset; 114#L525-2 [2022-02-21 04:34:42,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:42,541 INFO L85 PathProgramCache]: Analyzing trace with hash 889568363, now seen corresponding path program 1 times [2022-02-21 04:34:42,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:42,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209201369] [2022-02-21 04:34:42,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:42,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:42,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {148#true} is VALID [2022-02-21 04:34:42,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {148#true} is VALID [2022-02-21 04:34:42,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#true} assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); {150#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 04:34:42,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {150#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 04:34:42,583 INFO L290 TraceCheckUtils]: 4: Hoare triple {150#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; {151#(and (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:34:42,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#(and (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~k~0#1 < main_~length~0#1); {149#false} is VALID [2022-02-21 04:34:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:42,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:42,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209201369] [2022-02-21 04:34:42,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209201369] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:34:42,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:34:42,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:34:42,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59406604] [2022-02-21 04:34:42,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:34:42,587 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:34:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 1 times [2022-02-21 04:34:42,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:42,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423467558] [2022-02-21 04:34:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:42,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:42,603 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:42,609 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:42,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:42,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:34:42,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:34:42,708 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:42,750 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 04:34:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:34:42,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:42,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2022-02-21 04:34:42,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:42,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2022-02-21 04:34:42,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 04:34:42,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 04:34:42,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2022-02-21 04:34:42,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:42,774 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-02-21 04:34:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2022-02-21 04:34:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-02-21 04:34:42,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:42,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,777 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,778 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:42,779 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 04:34:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-02-21 04:34:42,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:42,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:42,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 13 transitions. [2022-02-21 04:34:42,780 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 13 transitions. [2022-02-21 04:34:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:42,781 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 04:34:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-02-21 04:34:42,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:42,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:42,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:42,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2022-02-21 04:34:42,784 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 04:34:42,784 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 04:34:42,784 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:34:42,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2022-02-21 04:34:42,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:42,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:42,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:42,787 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:42,787 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:42,788 INFO L791 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 174#L515 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 172#L515-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 173#L517 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; 169#L520-3 assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; 170#L520-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 171#L520-3 assume !(main_~k~0#1 < main_~length~0#1); 166#L525-2 [2022-02-21 04:34:42,788 INFO L793 eck$LassoCheckResult]: Loop: 166#L525-2 call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4); 165#L525 assume !!(main_#t~mem6#1 != main_#t~mem7#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~post10#1.base, main_#t~post10#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~a~0#1.base, main_~a~0#1.offset := main_#t~post10#1.base, 4 + main_#t~post10#1.offset;havoc main_#t~post10#1.base, main_#t~post10#1.offset; 166#L525-2 [2022-02-21 04:34:42,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash 176707625, now seen corresponding path program 1 times [2022-02-21 04:34:42,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:42,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659681022] [2022-02-21 04:34:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:42,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:42,837 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:42,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 2 times [2022-02-21 04:34:42,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:42,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891301833] [2022-02-21 04:34:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:42,847 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:42,853 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:42,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1982663218, now seen corresponding path program 1 times [2022-02-21 04:34:42,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:42,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709626061] [2022-02-21 04:34:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:42,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:43,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {204#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {204#true} is VALID [2022-02-21 04:34:43,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {204#true} is VALID [2022-02-21 04:34:43,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); {206#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 04:34:43,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {206#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {207#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:34:43,223 INFO L290 TraceCheckUtils]: 4: Hoare triple {207#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; {208#(and (or (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)) 0)) (and (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= (+ |ULTIMATE.start_main_~a~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4))))) (or (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (and (= |ULTIMATE.start_main_~k~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 3)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 04:34:43,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#(and (or (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)) 0)) (and (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= (+ |ULTIMATE.start_main_~a~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4))))) (or (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (and (= |ULTIMATE.start_main_~k~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 3)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; {209#(and (or (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)) 0)) (and (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4))) (= (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)))) (or (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (and (= |ULTIMATE.start_main_~k~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 3)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 04:34:43,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#(and (or (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)) 0)) (and (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4))) (= (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)))) (or (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)) 0) (and (= |ULTIMATE.start_main_~k~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 3)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {210#(and (or (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)) 0)) (and (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4))) (= (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (or (<= |ULTIMATE.start_main_~k~0#1| 1) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 4)) (not (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 3)))} is VALID [2022-02-21 04:34:43,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {210#(and (or (not (= (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)) 0)) (and (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4))) (= (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)))) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (or (<= |ULTIMATE.start_main_~k~0#1| 1) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 4)) (not (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 3)))} assume !(main_~k~0#1 < main_~length~0#1); {211#(and (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 4) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 3)) (= (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-21 04:34:43,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#(and (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 4) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 3)) (= (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)))} call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4); {212#(and (= |ULTIMATE.start_main_#t~mem7#1| |ULTIMATE.start_main_#t~mem6#1|) (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 4) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 3)) (= (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-21 04:34:43,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#(and (= |ULTIMATE.start_main_#t~mem7#1| |ULTIMATE.start_main_#t~mem6#1|) (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 4) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)) 3)) (= (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_#t~mem6#1 != main_#t~mem7#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~post10#1.base, main_#t~post10#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~a~0#1.base, main_~a~0#1.offset := main_#t~post10#1.base, 4 + main_#t~post10#1.offset;havoc main_#t~post10#1.base, main_#t~post10#1.offset; {205#false} is VALID [2022-02-21 04:34:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:43,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:43,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709626061] [2022-02-21 04:34:43,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709626061] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:34:43,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861682745] [2022-02-21 04:34:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:43,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:34:43,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:43,244 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:34:43,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 04:34:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:43,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:34:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:43,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:43,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-02-21 04:34:43,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 04:34:43,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 04:34:43,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-02-21 04:34:43,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {204#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {204#true} is VALID [2022-02-21 04:34:43,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {204#true} is VALID [2022-02-21 04:34:43,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); {206#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 04:34:43,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {206#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {207#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:34:43,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {207#(and (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; {228#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~arr~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:34:43,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~arr~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; {228#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~arr~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:34:43,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {228#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~arr~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {235#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~arr~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:34:43,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~arr~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~k~0#1 < main_~length~0#1); {239#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~arr~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:34:43,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#(and (<= |ULTIMATE.start_main_~length~0#1| 1) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~arr~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= |ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4); {243#(= |ULTIMATE.start_main_#t~mem7#1| |ULTIMATE.start_main_#t~mem6#1|)} is VALID [2022-02-21 04:34:43,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(= |ULTIMATE.start_main_#t~mem7#1| |ULTIMATE.start_main_#t~mem6#1|)} assume !!(main_#t~mem6#1 != main_#t~mem7#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~post10#1.base, main_#t~post10#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~a~0#1.base, main_~a~0#1.offset := main_#t~post10#1.base, 4 + main_#t~post10#1.offset;havoc main_#t~post10#1.base, main_#t~post10#1.offset; {205#false} is VALID [2022-02-21 04:34:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:43,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:34:43,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 04:34:43,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 70 [2022-02-21 04:34:43,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 17 [2022-02-21 04:34:43,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 04:34:43,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 101 [2022-02-21 04:34:43,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(= |ULTIMATE.start_main_#t~mem7#1| |ULTIMATE.start_main_#t~mem6#1|)} assume !!(main_#t~mem6#1 != main_#t~mem7#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~post10#1.base, main_#t~post10#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~a~0#1.base, main_~a~0#1.offset := main_#t~post10#1.base, 4 + main_#t~post10#1.offset;havoc main_#t~post10#1.base, main_#t~post10#1.offset; {205#false} is VALID [2022-02-21 04:34:43,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4))))} call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4); {243#(= |ULTIMATE.start_main_#t~mem7#1| |ULTIMATE.start_main_#t~mem6#1|)} is VALID [2022-02-21 04:34:43,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#(or (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~length~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)))))} assume !(main_~k~0#1 < main_~length~0#1); {250#(= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4))))} is VALID [2022-02-21 04:34:43,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {258#(or (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)))) (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~length~0#1|))} main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {254#(or (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~length~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)))))} is VALID [2022-02-21 04:34:43,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#(or (and (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= (+ |ULTIMATE.start_main_~a~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)))) (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~length~0#1|))} assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; {258#(or (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~arr~0#1.base|) (+ |ULTIMATE.start_main_~arr~0#1.offset| (- 4) (* |ULTIMATE.start_main_~length~0#1| 4)))) (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:34:43,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {206#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; {262#(or (and (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (= (+ |ULTIMATE.start_main_~a~0#1.offset| 4) (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~length~0#1| 4)))) (< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:34:43,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {206#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {206#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 04:34:43,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); {206#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 04:34:43,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {204#true} is VALID [2022-02-21 04:34:43,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {204#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {204#true} is VALID [2022-02-21 04:34:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:43,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861682745] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:34:43,922 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:34:43,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-02-21 04:34:43,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068750800] [2022-02-21 04:34:43,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:34:43,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:43,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 04:34:43,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-02-21 04:34:43,993 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:44,194 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 04:34:44,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 04:34:44,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:44,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:44,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2022-02-21 04:34:44,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:44,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 15 transitions. [2022-02-21 04:34:44,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 04:34:44,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 04:34:44,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2022-02-21 04:34:44,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:44,218 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-21 04:34:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2022-02-21 04:34:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-02-21 04:34:44,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:44,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:44,219 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:44,219 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:44,219 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-21 04:34:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-21 04:34:44,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:44,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:44,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 15 transitions. [2022-02-21 04:34:44,220 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 15 transitions. [2022-02-21 04:34:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:44,222 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-21 04:34:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-21 04:34:44,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:44,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:44,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:44,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:34:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-02-21 04:34:44,222 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-02-21 04:34:44,222 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-02-21 04:34:44,223 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:34:44,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2022-02-21 04:34:44,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:44,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:44,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:44,223 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:44,223 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:44,223 INFO L791 eck$LassoCheckResult]: Stem: 298#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 306#L515 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 304#L515-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 305#L517 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; 300#L520-3 assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; 301#L520-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 302#L520-3 assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; 303#L520-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 307#L520-3 assume !(main_~k~0#1 < main_~length~0#1); 297#L525-2 [2022-02-21 04:34:44,223 INFO L793 eck$LassoCheckResult]: Loop: 297#L525-2 call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4); 296#L525 assume !!(main_#t~mem6#1 != main_#t~mem7#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~post10#1.base, main_#t~post10#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~a~0#1.base, main_~a~0#1.offset := main_#t~post10#1.base, 4 + main_#t~post10#1.offset;havoc main_#t~post10#1.base, main_#t~post10#1.offset; 297#L525-2 [2022-02-21 04:34:44,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1982661529, now seen corresponding path program 2 times [2022-02-21 04:34:44,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:44,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857786580] [2022-02-21 04:34:44,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:44,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:44,245 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:44,261 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:44,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 3 times [2022-02-21 04:34:44,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:44,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789707538] [2022-02-21 04:34:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:44,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:44,292 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:44,296 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1627751052, now seen corresponding path program 2 times [2022-02-21 04:34:44,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:44,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121576365] [2022-02-21 04:34:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:44,321 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:44,338 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:44,596 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:44,596 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:44,596 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:44,596 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:44,596 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:44,596 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:44,596 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:44,596 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:44,596 INFO L133 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration4_Lasso [2022-02-21 04:34:44,596 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:44,596 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:44,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:44,652 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~length~0#1 4) ULTIMATE.start_main_~arr~0#1.offset (- 4)))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 04:34:44,654 INFO L158 Benchmark]: Toolchain (without parser) took 5048.43ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 95.0MB in the beginning and 89.1MB in the end (delta: 5.9MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2022-02-21 04:34:44,655 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 83.9MB. Free memory was 41.2MB in the beginning and 41.2MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:34:44,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.27ms. Allocated memory is still 130.0MB. Free memory was 94.7MB in the beginning and 96.3MB in the end (delta: -1.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:34:44,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.93ms. Allocated memory is still 130.0MB. Free memory was 96.3MB in the beginning and 94.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:34:44,655 INFO L158 Benchmark]: Boogie Preprocessor took 17.75ms. Allocated memory is still 130.0MB. Free memory was 94.7MB in the beginning and 93.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:34:44,656 INFO L158 Benchmark]: RCFGBuilder took 340.30ms. Allocated memory is still 130.0MB. Free memory was 93.0MB in the beginning and 81.6MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:34:44,656 INFO L158 Benchmark]: BuchiAutomizer took 4139.14ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 81.2MB in the beginning and 89.1MB in the end (delta: -7.9MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2022-02-21 04:34:44,657 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 83.9MB. Free memory was 41.2MB in the beginning and 41.2MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.27ms. Allocated memory is still 130.0MB. Free memory was 94.7MB in the beginning and 96.3MB in the end (delta: -1.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.93ms. Allocated memory is still 130.0MB. Free memory was 96.3MB in the beginning and 94.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.75ms. Allocated memory is still 130.0MB. Free memory was 94.7MB in the beginning and 93.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 340.30ms. Allocated memory is still 130.0MB. Free memory was 93.0MB in the beginning and 81.6MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4139.14ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 81.2MB in the beginning and 89.1MB in the end (delta: -7.9MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~length~0#1 4) ULTIMATE.start_main_~arr~0#1.offset (- 4)))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~length~0#1 4) ULTIMATE.start_main_~arr~0#1.offset (- 4)))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:34:44,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:44,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~length~0#1 4) ULTIMATE.start_main_~arr~0#1.offset (- 4)))_1 was not added to the transformula!