./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.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 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 14:59:53,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:59:53,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:59:53,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:59:53,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:59:53,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:59:53,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:59:53,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:59:53,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:59:53,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:59:53,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:59:53,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:59:53,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:59:53,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:59:53,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:59:53,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:59:53,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:59:53,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:59:53,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:59:53,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:59:53,710 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:59:53,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:59:53,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:59:53,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:59:53,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:59:53,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:59:53,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:59:53,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:59:53,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:59:53,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:59:53,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:59:53,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:59:53,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:59:53,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:59:53,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:59:53,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:59:53,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:59:53,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:59:53,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:59:53,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:59:53,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:59:53,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:59:53,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 14:59:53,759 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:59:53,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:59:53,760 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:59:53,760 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:59:53,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:59:53,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:59:53,761 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:59:53,761 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 14:59:53,762 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 14:59:53,762 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 14:59:53,762 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 14:59:53,762 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 14:59:53,763 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 14:59:53,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:59:53,763 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:59:53,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:59:53,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:59:53,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 14:59:53,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 14:59:53,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 14:59:53,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:59:53,764 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 14:59:53,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:59:53,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 14:59:53,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:59:53,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:59:53,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:59:53,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:59:53,766 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 14:59:53,766 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 -> 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f [2022-07-14 14:59:53,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:59:53,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:59:53,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:59:53,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:59:53,967 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:59:53,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2022-07-14 14:59:54,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a743c69/2c6dddfaa9ae4325ae25fa0c5db1f7b4/FLAG13799183e [2022-07-14 14:59:54,418 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:59:54,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2022-07-14 14:59:54,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a743c69/2c6dddfaa9ae4325ae25fa0c5db1f7b4/FLAG13799183e [2022-07-14 14:59:54,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a743c69/2c6dddfaa9ae4325ae25fa0c5db1f7b4 [2022-07-14 14:59:54,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:59:54,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:59:54,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:59:54,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:59:54,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:59:54,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44b8dd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54, skipping insertion in model container [2022-07-14 14:59:54,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:59:54,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:59:54,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:59:54,654 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:59:54,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:59:54,714 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:59:54,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54 WrapperNode [2022-07-14 14:59:54,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:59:54,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:59:54,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:59:54,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:59:54,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,759 INFO L137 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2022-07-14 14:59:54,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:59:54,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:59:54,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:59:54,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:59:54,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:59:54,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:59:54,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:59:54,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:59:54,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54" (1/1) ... [2022-07-14 14:59:54,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:54,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:54,818 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-07-14 14:59:54,834 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-07-14 14:59:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 14:59:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 14:59:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 14:59:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 14:59:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:59:54,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:59:54,916 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:59:54,917 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:59:55,102 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:59:55,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:59:55,107 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 14:59:55,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:59:55 BoogieIcfgContainer [2022-07-14 14:59:55,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:59:55,108 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 14:59:55,109 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 14:59:55,113 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 14:59:55,114 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:59:55,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 02:59:54" (1/3) ... [2022-07-14 14:59:55,115 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18e6bed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:59:55, skipping insertion in model container [2022-07-14 14:59:55,115 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:59:55,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:54" (2/3) ... [2022-07-14 14:59:55,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18e6bed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:59:55, skipping insertion in model container [2022-07-14 14:59:55,116 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:59:55,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:59:55" (3/3) ... [2022-07-14 14:59:55,117 INFO L354 chiAutomizerObserver]: Analyzing ICFG a.06-alloca.i [2022-07-14 14:59:55,157 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 14:59:55,157 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 14:59:55,157 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 14:59:55,158 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 14:59:55,158 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 14:59:55,158 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 14:59:55,158 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 14:59:55,158 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 14:59:55,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:55,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-14 14:59:55,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:55,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:55,182 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:59:55,182 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:55,182 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 14:59:55,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:55,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-14 14:59:55,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:55,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:55,185 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:59:55,185 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:55,189 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 19#L557-20true [2022-07-14 14:59:55,190 INFO L754 eck$LassoCheckResult]: Loop: 19#L557-20true call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 17#L557-1true assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 16#L557-3true test_fun_#t~short14#1 := test_fun_#t~short9#1; 8#L557-4true assume test_fun_#t~short14#1; 15#L557-9true test_fun_#t~short18#1 := test_fun_#t~short14#1; 14#L557-10true assume !test_fun_#t~short18#1; 12#L557-12true test_fun_#t~short20#1 := test_fun_#t~short18#1; 18#L557-13true assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 10#L557-15true test_fun_#t~short22#1 := test_fun_#t~short20#1; 6#L557-16true assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 20#L557-18true assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 19#L557-20true [2022-07-14 14:59:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 14:59:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:55,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264247540] [2022-07-14 14:59:55,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:55,350 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:55,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:55,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:55,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1442805661, now seen corresponding path program 1 times [2022-07-14 14:59:55,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:55,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392200139] [2022-07-14 14:59:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:55,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:55,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392200139] [2022-07-14 14:59:55,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392200139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:55,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:55,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:59:55,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581174197] [2022-07-14 14:59:55,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:55,480 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:59:55,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:55,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:59:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:59:55,513 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:55,567 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-07-14 14:59:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:59:55,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2022-07-14 14:59:55,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-07-14 14:59:55,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 30 transitions. [2022-07-14 14:59:55,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-14 14:59:55,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-07-14 14:59:55,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-07-14 14:59:55,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:55,579 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-14 14:59:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-07-14 14:59:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2022-07-14 14:59:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-07-14 14:59:55,596 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-14 14:59:55,596 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-14 14:59:55,596 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 14:59:55,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-07-14 14:59:55,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-07-14 14:59:55,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:55,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:55,599 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:59:55,599 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:55,599 INFO L752 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 62#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 65#L557-20 [2022-07-14 14:59:55,599 INFO L754 eck$LassoCheckResult]: Loop: 65#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 74#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 73#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 66#L557-4 assume test_fun_#t~short14#1; 67#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 72#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 70#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 71#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 69#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 63#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 64#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 65#L557-20 [2022-07-14 14:59:55,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:55,601 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-14 14:59:55,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:55,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978867568] [2022-07-14 14:59:55,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:55,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:55,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:55,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:55,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1500063963, now seen corresponding path program 1 times [2022-07-14 14:59:55,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:55,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36147232] [2022-07-14 14:59:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:55,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:55,708 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:55,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:55,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1876539869, now seen corresponding path program 1 times [2022-07-14 14:59:55,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:55,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146137599] [2022-07-14 14:59:55,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:55,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:55,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:56,915 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:59:56,915 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:59:56,915 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:59:56,915 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:59:56,915 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:59:56,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:56,916 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:59:56,916 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:59:56,916 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration2_Lasso [2022-07-14 14:59:56,916 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:59:56,916 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:59:56,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-07-14 14:59:56,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-07-14 14:59:56,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:56,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-07-14 14:59:56,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:56,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-07-14 14:59:56,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:56,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-07-14 14:59:56,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-07-14 14:59:56,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:56,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-07-14 14:59:56,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-07-14 14:59:56,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:56,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-07-14 14:59:56,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:57,970 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:59:57,973 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:59:57,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:57,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:57,976 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-07-14 14:59:57,978 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-07-14 14:59:57,980 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-07-14 14:59:57,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:57,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:57,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:57,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:57,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:57,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:57,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:58,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,019 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-07-14 14:59:58,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,022 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-07-14 14:59:58,024 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-07-14 14:59:58,024 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-07-14 14:59:58,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:58,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:58,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:58,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-14 14:59:58,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,052 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-07-14 14:59:58,053 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-07-14 14:59:58,054 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-07-14 14:59:58,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:58,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:58,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:58,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,079 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-07-14 14:59:58,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,080 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-07-14 14:59:58,081 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-07-14 14:59:58,083 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-07-14 14:59:58,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:58,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:58,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:58,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,105 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-07-14 14:59:58,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,106 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-07-14 14:59:58,108 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-07-14 14:59:58,109 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-07-14 14:59:58,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:58,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:58,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:58,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,138 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-07-14 14:59:58,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,139 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-07-14 14:59:58,140 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-07-14 14:59:58,184 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-07-14 14:59:58,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:58,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:58,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:58,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-14 14:59:58,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,220 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-07-14 14:59:58,221 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-07-14 14:59:58,222 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-07-14 14:59:58,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:58,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:58,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,258 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-07-14 14:59:58,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,259 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-07-14 14:59:58,259 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-07-14 14:59:58,260 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-07-14 14:59:58,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:58,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:58,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,322 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-07-14 14:59:58,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,324 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:58,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 14:59:58,328 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-07-14 14:59:58,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:58,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:58,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:58,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:58,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,366 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:58,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 14:59:58,368 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-07-14 14:59:58,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:58,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:58,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:58,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:58,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:58,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 14:59:58,409 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-07-14 14:59:58,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:58,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:58,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:58,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:58,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,437 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:58,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 14:59:58,438 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-07-14 14:59:58,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:58,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:58,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:58,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:58,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,484 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:58,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 14:59:58,486 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-07-14 14:59:58,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:58,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:58,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:58,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:58,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,526 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:58,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-14 14:59:58,529 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-07-14 14:59:58,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:58,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:58,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:58,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-14 14:59:58,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,569 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:58,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-14 14:59:58,570 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-07-14 14:59:58,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:58,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:58,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:58,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:58,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:58,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:58,598 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:59:58,616 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-14 14:59:58,616 INFO L444 ModelExtractionUtils]: 13 out of 40 variables were initially zero. Simplification set additionally 24 variables to zero. [2022-07-14 14:59:58,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:58,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:58,619 INFO L229 MonitoredProcess]: Starting monitored process 17 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-07-14 14:59:58,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 14:59:58,683 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:59:58,707 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:59:58,708 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:59:58,708 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1 + 4294967293 Supporting invariants [] [2022-07-14 14:59:58,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:58,843 INFO L293 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2022-07-14 14:59:58,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:58,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:59:58,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:58,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 14:59:58,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:59,114 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-14 14:59:59,115 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:59,254 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 101 transitions. Complement of second has 12 states. [2022-07-14 14:59:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-14 14:59:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-07-14 14:59:59,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 11 letters. [2022-07-14 14:59:59,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:59,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 13 letters. Loop has 11 letters. [2022-07-14 14:59:59,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:59,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 22 letters. [2022-07-14 14:59:59,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:59,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2022-07-14 14:59:59,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-07-14 14:59:59,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 66 states and 92 transitions. [2022-07-14 14:59:59,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-14 14:59:59,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-14 14:59:59,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2022-07-14 14:59:59,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:59:59,262 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 92 transitions. [2022-07-14 14:59:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2022-07-14 14:59:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2022-07-14 14:59:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 44 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-07-14 14:59:59,265 INFO L392 hiAutomatonCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-07-14 14:59:59,266 INFO L374 stractBuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-07-14 14:59:59,266 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 14:59:59,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2022-07-14 14:59:59,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-07-14 14:59:59,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:59,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:59,267 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 14:59:59,267 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:59,267 INFO L752 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 382#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 401#L557-1 [2022-07-14 14:59:59,267 INFO L754 eck$LassoCheckResult]: Loop: 401#L557-1 assume !test_fun_#t~short9#1; 397#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 398#L557-4 assume test_fun_#t~short14#1; 416#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 394#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 390#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 391#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 388#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 378#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 379#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 405#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 401#L557-1 [2022-07-14 14:59:59,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,268 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-07-14 14:59:59,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455586351] [2022-07-14 14:59:59,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,293 INFO L85 PathProgramCache]: Analyzing trace with hash 962628681, now seen corresponding path program 1 times [2022-07-14 14:59:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155702076] [2022-07-14 14:59:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:59,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:59,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155702076] [2022-07-14 14:59:59,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155702076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:59,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:59,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:59:59,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562295865] [2022-07-14 14:59:59,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:59,305 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:59:59,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:59,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:59:59,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:59:59,306 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:59,324 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2022-07-14 14:59:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:59:59,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 82 transitions. [2022-07-14 14:59:59,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-07-14 14:59:59,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 82 transitions. [2022-07-14 14:59:59,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-14 14:59:59,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-14 14:59:59,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 82 transitions. [2022-07-14 14:59:59,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:59:59,327 INFO L369 hiAutomatonCegarLoop]: Abstraction has 59 states and 82 transitions. [2022-07-14 14:59:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 82 transitions. [2022-07-14 14:59:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-07-14 14:59:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-07-14 14:59:59,329 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-07-14 14:59:59,329 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-07-14 14:59:59,329 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 14:59:59,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2022-07-14 14:59:59,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-14 14:59:59,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:59,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:59,330 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 14:59:59,330 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:59,331 INFO L752 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 495#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 510#L557-1 [2022-07-14 14:59:59,331 INFO L754 eck$LassoCheckResult]: Loop: 510#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 508#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 496#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 497#L557-6 assume test_fun_#t~short13#1;call test_fun_#t~mem12#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem12#1 > -2147483648 - test_fun_#t~mem11#1; 485#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 486#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 506#L557-10 assume !test_fun_#t~short18#1; 502#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 503#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 500#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 491#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 492#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 513#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 510#L557-1 [2022-07-14 14:59:59,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,331 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2022-07-14 14:59:59,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498777979] [2022-07-14 14:59:59,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,345 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash 623036047, now seen corresponding path program 1 times [2022-07-14 14:59:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129062711] [2022-07-14 14:59:59,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:59,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129062711] [2022-07-14 14:59:59,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129062711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:59,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:59,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:59:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841576025] [2022-07-14 14:59:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:59,371 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:59:59,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:59:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:59:59,372 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:59,390 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2022-07-14 14:59:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:59:59,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 78 transitions. [2022-07-14 14:59:59,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2022-07-14 14:59:59,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 78 transitions. [2022-07-14 14:59:59,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-14 14:59:59,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-14 14:59:59,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 78 transitions. [2022-07-14 14:59:59,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:59:59,393 INFO L369 hiAutomatonCegarLoop]: Abstraction has 58 states and 78 transitions. [2022-07-14 14:59:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 78 transitions. [2022-07-14 14:59:59,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-07-14 14:59:59,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-07-14 14:59:59,395 INFO L392 hiAutomatonCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-07-14 14:59:59,395 INFO L374 stractBuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-07-14 14:59:59,395 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 14:59:59,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2022-07-14 14:59:59,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-07-14 14:59:59,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:59,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:59,396 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 14:59:59,396 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:59,396 INFO L752 eck$LassoCheckResult]: Stem: 595#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 596#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 601#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 621#L557-1 [2022-07-14 14:59:59,397 INFO L754 eck$LassoCheckResult]: Loop: 621#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 618#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 602#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 603#L557-6 assume test_fun_#t~short13#1;call test_fun_#t~mem12#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem12#1 > -2147483648 - test_fun_#t~mem11#1; 591#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 592#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 612#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 608#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 609#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 606#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 597#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 598#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 626#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 621#L557-1 [2022-07-14 14:59:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2022-07-14 14:59:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168201111] [2022-07-14 14:59:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,408 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1151971315, now seen corresponding path program 1 times [2022-07-14 14:59:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952382112] [2022-07-14 14:59:59,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:59,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:59,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:59,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952382112] [2022-07-14 14:59:59,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952382112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:59,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:59,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:59:59,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456625534] [2022-07-14 14:59:59,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:59,478 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:59:59,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:59,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 14:59:59,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:59:59,480 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 17 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:59,632 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-07-14 14:59:59,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 14:59:59,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 140 transitions. [2022-07-14 14:59:59,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-07-14 14:59:59,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 87 states and 107 transitions. [2022-07-14 14:59:59,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-07-14 14:59:59,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-07-14 14:59:59,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 107 transitions. [2022-07-14 14:59:59,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:59:59,636 INFO L369 hiAutomatonCegarLoop]: Abstraction has 87 states and 107 transitions. [2022-07-14 14:59:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 107 transitions. [2022-07-14 14:59:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2022-07-14 14:59:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-07-14 14:59:59,638 INFO L392 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-07-14 14:59:59,638 INFO L374 stractBuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-07-14 14:59:59,638 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 14:59:59,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2022-07-14 14:59:59,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-07-14 14:59:59,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:59,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:59,639 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 14:59:59,639 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:59,639 INFO L752 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 781#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 786#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 806#L557-1 [2022-07-14 14:59:59,639 INFO L754 eck$LassoCheckResult]: Loop: 806#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 803#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 804#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 793#L557-6 assume !test_fun_#t~short13#1; 776#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 777#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 799#L557-10 assume !test_fun_#t~short18#1; 800#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 810#L557-13 assume !test_fun_#t~short20#1; 791#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 782#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 783#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 811#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 806#L557-1 [2022-07-14 14:59:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,640 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 4 times [2022-07-14 14:59:59,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910734498] [2022-07-14 14:59:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,697 INFO L85 PathProgramCache]: Analyzing trace with hash 231856079, now seen corresponding path program 1 times [2022-07-14 14:59:59,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193142911] [2022-07-14 14:59:59,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:59,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:59,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193142911] [2022-07-14 14:59:59,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193142911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:59,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:59,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:59:59,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903882206] [2022-07-14 14:59:59,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:59,721 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:59:59,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:59,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:59:59,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:59:59,722 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:59,735 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-07-14 14:59:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:59:59,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2022-07-14 14:59:59,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-07-14 14:59:59,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 43 states and 50 transitions. [2022-07-14 14:59:59,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-14 14:59:59,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-14 14:59:59,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2022-07-14 14:59:59,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:59:59,737 INFO L369 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-14 14:59:59,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2022-07-14 14:59:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-14 14:59:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-07-14 14:59:59,741 INFO L392 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-14 14:59:59,741 INFO L374 stractBuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-14 14:59:59,741 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 14:59:59,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2022-07-14 14:59:59,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-07-14 14:59:59,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:59,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:59,742 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 14:59:59,742 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:59,742 INFO L752 eck$LassoCheckResult]: Stem: 889#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 890#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 895#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 913#L557-1 [2022-07-14 14:59:59,742 INFO L754 eck$LassoCheckResult]: Loop: 913#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 914#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 922#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 903#L557-6 assume !test_fun_#t~short13#1; 885#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 886#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 908#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 904#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 905#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 901#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 891#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 892#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 917#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 913#L557-1 [2022-07-14 14:59:59,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,742 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 5 times [2022-07-14 14:59:59,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518357795] [2022-07-14 14:59:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:59,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1544998325, now seen corresponding path program 1 times [2022-07-14 14:59:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718446956] [2022-07-14 14:59:59,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:59,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:59,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718446956] [2022-07-14 14:59:59,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718446956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:59,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:59,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 14:59:59,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588983259] [2022-07-14 14:59:59,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:59,811 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:59:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:59,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:59:59,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:59:59,812 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:59,834 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-07-14 14:59:59,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:59:59,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 54 transitions. [2022-07-14 14:59:59,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-14 14:59:59,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 39 states and 42 transitions. [2022-07-14 14:59:59,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-14 14:59:59,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-14 14:59:59,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2022-07-14 14:59:59,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:59:59,837 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-14 14:59:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2022-07-14 14:59:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-14 14:59:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-07-14 14:59:59,841 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-14 14:59:59,841 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-14 14:59:59,842 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 14:59:59,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2022-07-14 14:59:59,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-14 14:59:59,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:59,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:59,842 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 14:59:59,843 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:59,843 INFO L752 eck$LassoCheckResult]: Stem: 993#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 999#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 1015#L557-1 [2022-07-14 14:59:59,844 INFO L754 eck$LassoCheckResult]: Loop: 1015#L557-1 assume !test_fun_#t~short9#1; 1013#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 1000#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 1001#L557-6 assume test_fun_#t~short13#1;call test_fun_#t~mem12#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem12#1 > -2147483648 - test_fun_#t~mem11#1; 989#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 990#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 1011#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 1006#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 1007#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 1004#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 995#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 996#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 1018#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 1015#L557-1 [2022-07-14 14:59:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 6 times [2022-07-14 14:59:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169933126] [2022-07-14 14:59:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,860 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1738777329, now seen corresponding path program 1 times [2022-07-14 14:59:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746763985] [2022-07-14 14:59:59,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,891 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:59,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash -403715764, now seen corresponding path program 1 times [2022-07-14 14:59:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:59,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416381321] [2022-07-14 14:59:59,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:59,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:59,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:01,050 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:00:01,050 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:00:01,050 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:00:01,050 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:00:01,051 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:00:01,051 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:01,051 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:00:01,051 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:00:01,051 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration8_Lasso [2022-07-14 15:00:01,051 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:00:01,051 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:00:01,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:01,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:02,421 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:00:02,421 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:00:02,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:02,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:02,423 INFO L229 MonitoredProcess]: Starting monitored process 18 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-07-14 15:00:02,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 15:00:02,425 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-07-14 15:00:02,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:02,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:02,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:02,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:02,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:02,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:02,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:02,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:02,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:02,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:02,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:02,452 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:00:02,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-14 15:00:02,454 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-07-14 15:00:02,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:02,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:02,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:02,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:02,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:02,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:02,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:02,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:02,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:02,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:02,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:02,485 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:00:02,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-14 15:00:02,491 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-07-14 15:00:02,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:02,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:02,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:02,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:02,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:02,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:02,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:02,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:02,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:02,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:02,524 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:00:02,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-14 15:00:02,526 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-07-14 15:00:02,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:02,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:02,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:02,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:02,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:02,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:02,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:02,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:02,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:02,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:02,577 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:00:02,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-14 15:00:02,579 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-07-14 15:00:02,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:02,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:02,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:02,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:02,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:02,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:02,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:02,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-14 15:00:02,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:02,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:02,608 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:00:02,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 15:00:02,609 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-07-14 15:00:02,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:02,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:02,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:02,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:02,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:02,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:02,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:02,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-14 15:00:02,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:02,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:02,636 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:00:02,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 15:00:02,638 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-07-14 15:00:02,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:02,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:02,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:02,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:02,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:02,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:02,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:02,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:02,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:02,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:02,685 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:00:02,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-14 15:00:02,686 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-07-14 15:00:02,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:02,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:02,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:02,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:02,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:02,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:02,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:02,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:02,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:02,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:02,729 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:00:02,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-14 15:00:02,732 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-07-14 15:00:02,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:02,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:02,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:02,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:02,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:02,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:02,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:02,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:02,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:02,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:02,769 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:00:02,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-14 15:00:02,771 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-07-14 15:00:02,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:02,777 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-14 15:00:02,777 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:00:02,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:02,802 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2022-07-14 15:00:02,802 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-14 15:00:02,868 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:00:03,076 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2022-07-14 15:00:03,077 INFO L444 ModelExtractionUtils]: 35 out of 76 variables were initially zero. Simplification set additionally 34 variables to zero. [2022-07-14 15:00:03,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:03,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:03,087 INFO L229 MonitoredProcess]: Starting monitored process 28 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-07-14 15:00:03,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-14 15:00:03,088 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:00:03,103 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-07-14 15:00:03,103 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:00:03,103 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2, ULTIMATE.start_test_fun_~y#1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2 - 4294967293*ULTIMATE.start_test_fun_~y#1 Supporting invariants [-1*ULTIMATE.start_test_fun_~y#1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 >= 0] [2022-07-14 15:00:03,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:03,249 INFO L293 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2022-07-14 15:00:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:03,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 15:00:03,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:03,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 15:00:03,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 15:00:03,422 INFO L356 Elim1Store]: treesize reduction 104, result has 32.0 percent of original size [2022-07-14 15:00:03,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 134 [2022-07-14 15:00:03,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:03,475 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 15:00:03,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 197 [2022-07-14 15:00:03,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-14 15:00:03,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-14 15:00:03,964 INFO L356 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2022-07-14 15:00:03,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 83 treesize of output 30 [2022-07-14 15:00:03,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 15:00:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:03,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 15:00:03,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:04,138 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-14 15:00:04,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 84 [2022-07-14 15:00:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:04,257 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2022-07-14 15:00:04,258 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:00:04,344 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 87 transitions. Complement of second has 11 states. [2022-07-14 15:00:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-14 15:00:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:00:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-07-14 15:00:04,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 3 letters. Loop has 13 letters. [2022-07-14 15:00:04,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:04,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 16 letters. Loop has 13 letters. [2022-07-14 15:00:04,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:04,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 3 letters. Loop has 26 letters. [2022-07-14 15:00:04,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:04,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 87 transitions. [2022-07-14 15:00:04,348 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:00:04,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2022-07-14 15:00:04,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 15:00:04,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 15:00:04,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 15:00:04,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:00:04,348 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:00:04,348 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:00:04,348 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:00:04,348 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 15:00:04,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 15:00:04,348 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:00:04,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 15:00:04,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:00:04 BoogieIcfgContainer [2022-07-14 15:00:04,352 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:00:04,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:00:04,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:00:04,353 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:00:04,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:59:55" (3/4) ... [2022-07-14 15:00:04,355 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 15:00:04,355 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:00:04,355 INFO L158 Benchmark]: Toolchain (without parser) took 9920.22ms. Allocated memory was 81.8MB in the beginning and 163.6MB in the end (delta: 81.8MB). Free memory was 47.3MB in the beginning and 76.7MB in the end (delta: -29.4MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2022-07-14 15:00:04,355 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:00:04,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.52ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 47.0MB in the beginning and 81.7MB in the end (delta: -34.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 15:00:04,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.02ms. Allocated memory is still 113.2MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:00:04,356 INFO L158 Benchmark]: Boogie Preprocessor took 31.90ms. Allocated memory is still 113.2MB. Free memory was 79.6MB in the beginning and 78.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:00:04,356 INFO L158 Benchmark]: RCFGBuilder took 314.86ms. Allocated memory is still 113.2MB. Free memory was 78.0MB in the beginning and 64.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 15:00:04,356 INFO L158 Benchmark]: BuchiAutomizer took 9243.98ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 64.4MB in the beginning and 77.8MB in the end (delta: -13.4MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2022-07-14 15:00:04,356 INFO L158 Benchmark]: Witness Printer took 2.16ms. Allocated memory is still 163.6MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:00:04,357 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.52ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 47.0MB in the beginning and 81.7MB in the end (delta: -34.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.02ms. Allocated memory is still 113.2MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.90ms. Allocated memory is still 113.2MB. Free memory was 79.6MB in the beginning and 78.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.86ms. Allocated memory is still 113.2MB. Free memory was 78.0MB in the beginning and 64.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 9243.98ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 64.4MB in the beginning and 77.8MB in the end (delta: -13.4MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Witness Printer took 2.16ms. Allocated memory is still 163.6MB. Free memory is still 76.7MB. 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 8 terminating modules (6 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 7 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + -4294967293 * y and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.2s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 7.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 101 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 160 mSDtfsCounter, 285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital449 mio100 ax104 hnf100 lsp94 ukn55 mio100 lsp34 div100 bol105 ite100 ukn100 eq179 hnf89 smp100 dnf138 smp97 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 335ms VariablesStem: 14 VariablesLoop: 9 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 15:00:04,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE