./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/mutual_simple2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-recursive-malloc/mutual_simple2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b69d1be7eda006c1c689f3f3f9bbb5e6181bea96390d4e74f3b51d245324fff1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:38,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:38,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:38,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:38,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:38,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:38,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:38,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:38,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:38,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:38,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:38,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:38,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:38,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:38,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:38,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:38,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:38,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:38,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:38,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:38,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:38,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:38,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:38,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:38,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:38,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:38,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:38,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:38,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:38,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:38,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:38,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:38,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:38,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:38,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:38,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:38,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:38,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:38,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:38,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:38,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:38,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:35:38,413 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:38,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:38,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:38,415 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:38,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:38,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:38,416 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:38,416 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:38,416 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:38,416 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:38,417 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:38,417 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:38,418 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:38,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:38,418 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:38,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:38,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:38,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:38,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:38,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:38,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:38,419 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:38,419 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:38,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:38,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:38,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:38,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:38,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:38,421 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:38,421 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b69d1be7eda006c1c689f3f3f9bbb5e6181bea96390d4e74f3b51d245324fff1 [2022-02-21 03:35:38,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:38,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:38,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:38,642 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:38,642 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:38,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/mutual_simple2.i [2022-02-21 03:35:38,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957e32e81/18379f5eded14824a5e8cf482706e269/FLAGda76eebcd [2022-02-21 03:35:39,057 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:39,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mutual_simple2.i [2022-02-21 03:35:39,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957e32e81/18379f5eded14824a5e8cf482706e269/FLAGda76eebcd [2022-02-21 03:35:39,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957e32e81/18379f5eded14824a5e8cf482706e269 [2022-02-21 03:35:39,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:39,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:39,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:39,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:39,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:39,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257a953d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39, skipping insertion in model container [2022-02-21 03:35:39,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:39,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:39,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:39,246 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:39,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:39,269 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:39,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39 WrapperNode [2022-02-21 03:35:39,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:39,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:39,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:39,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:39,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,299 INFO L137 Inliner]: procedures = 12, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 15 [2022-02-21 03:35:39,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:39,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:39,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:39,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:39,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:39,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:39,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:39,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:39,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39" (1/1) ... [2022-02-21 03:35:39,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:39,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:39,378 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 03:35:39,398 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 03:35:39,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:39,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:39,419 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-21 03:35:39,420 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-21 03:35:39,420 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-02-21 03:35:39,421 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-02-21 03:35:39,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:39,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:39,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:39,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:39,472 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:39,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:39,635 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:39,646 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:39,647 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:35:39,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:39 BoogieIcfgContainer [2022-02-21 03:35:39,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:39,649 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:39,649 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:39,651 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:39,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:39,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:39" (1/3) ... [2022-02-21 03:35:39,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b95733d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:39, skipping insertion in model container [2022-02-21 03:35:39,667 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:39,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:39" (2/3) ... [2022-02-21 03:35:39,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b95733d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:39, skipping insertion in model container [2022-02-21 03:35:39,667 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:39,668 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:39" (3/3) ... [2022-02-21 03:35:39,669 INFO L388 chiAutomizerObserver]: Analyzing ICFG mutual_simple2.i [2022-02-21 03:35:39,707 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:39,709 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:39,709 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:39,709 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:39,709 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:39,710 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:39,710 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:39,710 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:39,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:35:39,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:39,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:39,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:39,759 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:35:39,760 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:39,760 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:39,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:35:39,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:39,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:39,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:39,776 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:35:39,776 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:39,782 INFO L791 eck$LassoCheckResult]: Stem: 6#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int(main_#t~nondet9#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet9#1; 9#L44true call f(main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset);< 12#fENTRYtrue [2022-02-21 03:35:39,784 INFO L793 eck$LassoCheckResult]: Loop: 12#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~r.base, ~r.offset := #in~r.base, #in~r.offset;call ULTIMATE.dealloc(~r.base, ~r.offset);call #t~mem1 := read~int(~q.base, ~q.offset, 4); 7#L14true assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~s~0.base, ~s~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call #t~mem3 := read~int(~q.base, ~q.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~q.base, ~q.offset, 4);havoc #t~mem3;havoc #t~post4; 15#L21true call g(~q.base, ~q.offset, ~s~0.base, ~s~0.offset);< 13#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;call ULTIMATE.dealloc(~s.base, ~s.offset);call #t~mem5 := read~int(~p.base, ~p.offset, 4); 18#L27true assume !(#t~mem5 < 0);havoc #t~mem5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);~r~0.base, ~r~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; 17#L33true call f(~p.base, ~p.offset, ~r~0.base, ~r~0.offset);< 12#fENTRYtrue [2022-02-21 03:35:39,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash 43767, now seen corresponding path program 1 times [2022-02-21 03:35:39,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:39,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906410381] [2022-02-21 03:35:39,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:39,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:39,903 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:39,928 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:39,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash 891860259, now seen corresponding path program 1 times [2022-02-21 03:35:39,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:39,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945629281] [2022-02-21 03:35:39,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:39,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:39,988 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:40,014 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:40,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:40,017 INFO L85 PathProgramCache]: Analyzing trace with hash -306262119, now seen corresponding path program 1 times [2022-02-21 03:35:40,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:40,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611735141] [2022-02-21 03:35:40,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:40,081 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:40,138 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:42,632 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:42,633 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:42,633 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:42,633 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:42,634 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:42,634 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:42,634 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:42,634 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:42,634 INFO L133 ssoRankerPreferences]: Filename of dumped script: mutual_simple2.i_Iteration1_Lasso [2022-02-21 03:35:42,634 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:42,635 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:42,647 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 03:35:42,915 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:42,916 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:42,919 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 03:35:42,920 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 03:35:42,922 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 03:35:42,923 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 03:35:42,924 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 03:35:42,926 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 03:35:42,927 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 03:35:42,929 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 03:35:42,931 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 03:35:42,932 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 03:35:42,934 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 03:35:42,935 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 03:35:42,936 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 03:35:42,938 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 03:35:42,939 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 03:35:42,941 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 03:35:42,942 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 03:35:42,944 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 03:35:42,945 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 03:35:42,947 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 03:35:42,949 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 03:35:42,950 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 03:35:42,952 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 03:35:42,953 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 03:35:42,955 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 03:35:42,956 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 03:35:42,958 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 03:35:42,959 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 03:35:42,961 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 03:35:42,962 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 03:35:42,964 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 03:35:42,965 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 03:35:42,967 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 03:35:42,969 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 03:35:42,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:42,986 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 03:35:42,987 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 03:35:42,988 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 03:35:42,990 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 03:35:42,991 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 03:35:43,510 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:43,514 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:43,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:43,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:43,527 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 03:35:43,532 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 03:35:43,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:43,540 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:35:43,540 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 03:35:43,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:43,554 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 03:35:43,579 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2022-02-21 03:35:43,579 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2022-02-21 03:35:43,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:43,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:43,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:43,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:43,686 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 03:35:43,688 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 03:35:43,692 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 03:35:43,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:43,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:43,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:43,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:43,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:43,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:43,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:43,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:43,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:43,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:43,764 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 03:35:43,765 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 03:35:43,767 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 03:35:43,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:43,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:43,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:43,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:43,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:43,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:43,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:43,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:43,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:43,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:43,808 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 03:35:43,809 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 03:35:43,811 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 03:35:43,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:43,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:43,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:43,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:43,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:43,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:43,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:43,854 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 03:35:43,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:43,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:43,856 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 03:35:43,858 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 03:35:43,860 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 03:35:43,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:43,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:43,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:43,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:43,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:43,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:43,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:43,905 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 03:35:43,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:43,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:43,908 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:43,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:35:43,910 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 03:35:43,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:43,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:43,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:43,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:43,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:43,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:43,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:43,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:43,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:43,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:43,956 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:43,969 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 03:35:43,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:43,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:43,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:43,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:43,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:35:43,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:43,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:43,995 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:44,032 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:35:44,033 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:35:44,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:44,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:44,050 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:44,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:44,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:35:44,097 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:44,097 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:44,098 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1) = 1*v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1 Supporting invariants [] [2022-02-21 03:35:44,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:44,159 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:35:44,165 INFO L390 LassoCheck]: Loop: "~q.base, ~q.offset := #in~q.base, #in~q.offset;~r.base, ~r.offset := #in~r.base, #in~r.offset;call ULTIMATE.dealloc(~r.base, ~r.offset);call #t~mem1 := read~int(~q.base, ~q.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~s~0.base, ~s~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call #t~mem3 := read~int(~q.base, ~q.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~q.base, ~q.offset, 4);havoc #t~mem3;havoc #t~post4;" "call g(~q.base, ~q.offset, ~s~0.base, ~s~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;call ULTIMATE.dealloc(~s.base, ~s.offset);call #t~mem5 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem5 < 0);havoc #t~mem5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);~r~0.base, ~r~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;" "call f(~p.base, ~p.offset, ~r~0.base, ~r~0.offset);"< [2022-02-21 03:35:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:35:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:44,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {27#unseeded} is VALID [2022-02-21 03:35:44,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int(main_#t~nondet9#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet9#1; {27#unseeded} is VALID [2022-02-21 03:35:44,245 INFO L272 TraceCheckUtils]: 2: Hoare triple {27#unseeded} call f(main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset); {27#unseeded} is VALID [2022-02-21 03:35:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-21 03:35:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:44,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:44,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-02-21 03:35:44,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(>= oldRank0 (select (select |#memory_int| |f_#in~q.base|) |f_#in~q.offset|))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~r.base, ~r.offset := #in~r.base, #in~r.offset;call ULTIMATE.dealloc(~r.base, ~r.offset);call #t~mem1 := read~int(~q.base, ~q.offset, 4); {66#(<= (select (select |#memory_int| f_~q.base) f_~q.offset) oldRank0)} is VALID [2022-02-21 03:35:44,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(<= (select (select |#memory_int| f_~q.base) f_~q.offset) oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~s~0.base, ~s~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call #t~mem3 := read~int(~q.base, ~q.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~q.base, ~q.offset, 4);havoc #t~mem3;havoc #t~post4; {70#(<= (+ (select (select |#memory_int| f_~q.base) f_~q.offset) 1) oldRank0)} is VALID [2022-02-21 03:35:44,558 INFO L272 TraceCheckUtils]: 2: Hoare triple {70#(<= (+ (select (select |#memory_int| f_~q.base) f_~q.offset) 1) oldRank0)} call g(~q.base, ~q.offset, ~s~0.base, ~s~0.offset); {74#(<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) oldRank0)} is VALID [2022-02-21 03:35:44,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {74#(<= (+ (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 1) oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;call ULTIMATE.dealloc(~s.base, ~s.offset);call #t~mem5 := read~int(~p.base, ~p.offset, 4); {78#(and (<= |g_#t~mem5| (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1) oldRank0))} is VALID [2022-02-21 03:35:44,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {78#(and (<= |g_#t~mem5| (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1) oldRank0))} assume !(#t~mem5 < 0);havoc #t~mem5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);~r~0.base, ~r~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset; {82#(and (<= (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1) oldRank0) (<= 0 (select (select |#memory_int| g_~p.base) g_~p.offset)))} is VALID [2022-02-21 03:35:44,562 INFO L272 TraceCheckUtils]: 5: Hoare triple {82#(and (<= (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1) oldRank0) (<= 0 (select (select |#memory_int| g_~p.base) g_~p.offset)))} call f(~p.base, ~p.offset, ~r~0.base, ~r~0.offset); {55#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |f_#in~q.base|) |f_#in~q.offset|))))} is VALID [2022-02-21 03:35:44,562 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 03:35:44,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:44,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:44,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:35:44,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,614 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2022-02-21 03:35:44,615 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:44,969 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 53 transitions. Complement of second has 22 states. [2022-02-21 03:35:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:44,969 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:44,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:35:44,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:44,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:44,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:44,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:44,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:44,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:44,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:44,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 53 transitions. [2022-02-21 03:35:44,976 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:44,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:44,977 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:35:44,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:44,980 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:35:44,980 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:44,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:44,982 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:44,982 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 53 transitions. cyclomatic complexity: 7 [2022-02-21 03:35:44,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 53 transitions. cyclomatic complexity: 7 [2022-02-21 03:35:44,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:44,982 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:44,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:35:44,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:35:44,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:35:44,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:35:44,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:35:44,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:35:44,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:35:44,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:35:44,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:35:44,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:35:44,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:35:44,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:35:44,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:44,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:44,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:44,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:35:44,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:35:44,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:35:44,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:35:44,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:35:44,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:35:44,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:35:44,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:35:44,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:35:44,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:44,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:35:45,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:35:45,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:35:45,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:35:45,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:35:45,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:35:45,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:35:45,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:35:45,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:35:45,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:35:45,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:35:45,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 53 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:35:45,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,006 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-02-21 03:35:45,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:35:45,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:35:45,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 12 letters. [2022-02-21 03:35:45,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:45,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 53 transitions. cyclomatic complexity: 7 [2022-02-21 03:35:45,015 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:45,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2022-02-21 03:35:45,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:45,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:45,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:45,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:45,021 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:45,021 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:45,021 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:45,021 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:45,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:45,021 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:45,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:45,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:35:45 BoogieIcfgContainer [2022-02-21 03:35:45,028 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:45,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:45,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:45,029 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:45,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:39" (3/4) ... [2022-02-21 03:35:45,031 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:45,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:45,033 INFO L158 Benchmark]: Toolchain (without parser) took 5959.76ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 50.1MB in the beginning and 45.7MB in the end (delta: 4.4MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2022-02-21 03:35:45,033 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:45,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.04ms. Allocated memory is still 88.1MB. Free memory was 50.0MB in the beginning and 64.6MB in the end (delta: -14.6MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-02-21 03:35:45,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.51ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 63.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:45,038 INFO L158 Benchmark]: Boogie Preprocessor took 34.37ms. Allocated memory is still 88.1MB. Free memory was 63.1MB in the beginning and 62.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:45,038 INFO L158 Benchmark]: RCFGBuilder took 312.38ms. Allocated memory is still 88.1MB. Free memory was 61.8MB in the beginning and 49.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:35:45,039 INFO L158 Benchmark]: BuchiAutomizer took 5379.22ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 49.0MB in the beginning and 46.8MB in the end (delta: 2.2MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2022-02-21 03:35:45,039 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 130.0MB. Free memory was 46.8MB in the beginning and 45.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:45,043 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.15ms. Allocated memory is still 88.1MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.04ms. Allocated memory is still 88.1MB. Free memory was 50.0MB in the beginning and 64.6MB in the end (delta: -14.6MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.51ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 63.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.37ms. Allocated memory is still 88.1MB. Free memory was 63.1MB in the beginning and 62.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 312.38ms. Allocated memory is still 88.1MB. Free memory was 61.8MB in the beginning and 49.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 5379.22ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 49.0MB in the beginning and 46.8MB in the end (delta: 2.2MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 130.0MB. Free memory was 46.8MB in the beginning and 45.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[q][q] and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 11 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital202 mio100 ax100 hnf100 lsp94 ukn70 mio100 lsp26 div100 bol100 ite100 ukn100 eq155 hnf98 smp100 dnf287 smp82 tf100 neg87 sie146 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 126ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:35:45,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE