./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-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/c.01-no-inv-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 f49dce48b63f0ee8eed4ac47c25c384a83e3c23200b58c130c184e2b953e32f3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:00:40,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:00:40,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:00:40,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:00:40,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:00:40,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:00:40,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:00:40,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:00:40,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:00:40,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:00:40,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:00:40,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:00:40,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:00:40,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:00:40,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:00:40,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:00:40,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:00:40,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:00:40,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:00:40,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:00:40,831 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:00:40,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:00:40,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:00:40,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:00:40,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:00:40,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:00:40,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:00:40,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:00:40,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:00:40,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:00:40,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:00:40,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:00:40,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:00:40,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:00:40,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:00:40,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:00:40,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:00:40,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:00:40,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:00:40,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:00:40,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:00:40,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:00:40,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 15:00:40,868 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:00:40,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:00:40,868 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:00:40,869 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:00:40,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:00:40,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:00:40,870 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:00:40,870 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:00:40,870 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:00:40,870 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:00:40,870 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:00:40,870 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:00:40,870 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:00:40,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:00:40,871 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:00:40,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:00:40,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:00:40,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:00:40,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:00:40,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:00:40,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:00:40,872 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:00:40,872 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:00:40,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:00:40,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:00:40,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:00:40,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:00:40,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:00:40,873 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:00:40,873 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 -> f49dce48b63f0ee8eed4ac47c25c384a83e3c23200b58c130c184e2b953e32f3 [2022-07-14 15:00:41,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:00:41,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:00:41,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:00:41,098 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:00:41,099 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:00:41,100 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i [2022-07-14 15:00:41,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd5ed4af/924231f7933a4fd792426c29b6ab44c4/FLAGb47f91384 [2022-07-14 15:00:41,558 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:00:41,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i [2022-07-14 15:00:41,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd5ed4af/924231f7933a4fd792426c29b6ab44c4/FLAGb47f91384 [2022-07-14 15:00:41,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd5ed4af/924231f7933a4fd792426c29b6ab44c4 [2022-07-14 15:00:41,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:00:41,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:00:41,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:00:41,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:00:41,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:00:41,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5f297b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41, skipping insertion in model container [2022-07-14 15:00:41,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:00:41,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:00:41,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:00:41,845 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:00:41,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:00:41,896 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:00:41,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41 WrapperNode [2022-07-14 15:00:41,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:00:41,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:00:41,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:00:41,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:00:41,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,938 INFO L137 Inliner]: procedures = 111, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-07-14 15:00:41,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:00:41,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:00:41,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:00:41,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:00:41,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:00:41,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:00:41,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:00:41,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:00:41,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41" (1/1) ... [2022-07-14 15:00:41,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:41,999 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 15:00:42,002 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 15:00:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:00:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:00:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:00:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:00:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:00:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:00:42,082 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:00:42,083 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:00:42,182 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:00:42,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:00:42,186 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:00:42,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:00:42 BoogieIcfgContainer [2022-07-14 15:00:42,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:00:42,188 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:00:42,188 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:00:42,191 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:00:42,191 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:00:42,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:00:41" (1/3) ... [2022-07-14 15:00:42,192 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@293f623f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:00:42, skipping insertion in model container [2022-07-14 15:00:42,192 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:00:42,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:00:41" (2/3) ... [2022-07-14 15:00:42,193 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@293f623f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:00:42, skipping insertion in model container [2022-07-14 15:00:42,193 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:00:42,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:00:42" (3/3) ... [2022-07-14 15:00:42,194 INFO L354 chiAutomizerObserver]: Analyzing ICFG c.01-no-inv-alloca.i [2022-07-14 15:00:42,231 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:00:42,231 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:00:42,231 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:00:42,231 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:00:42,231 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:00:42,231 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:00:42,231 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:00:42,232 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:00:42,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:00:42,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 15:00:42,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:42,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:42,251 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:00:42,251 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 15:00:42,251 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:00:42,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:00:42,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 15:00:42,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:42,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:42,253 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:00:42,253 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 15:00:42,258 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~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#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~mem10#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 5#L555-3true [2022-07-14 15:00:42,258 INFO L754 eck$LassoCheckResult]: Loop: 5#L555-3true call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 12#L555-1true assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 8#L557-5true assume !true; 9#L557-6true call test_fun_#t~mem11#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem11#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 5#L555-3true [2022-07-14 15:00:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:42,263 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:00:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:42,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921243197] [2022-07-14 15:00:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:42,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:42,416 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:42,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1144552, now seen corresponding path program 1 times [2022-07-14 15:00:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:42,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846340820] [2022-07-14 15:00:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:42,508 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:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:00:42,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846340820] [2022-07-14 15:00:42,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846340820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:00:42,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:00:42,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:00:42,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299998435] [2022-07-14 15:00:42,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:00:42,513 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:00:42,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:00:42,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 15:00:42,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 15:00:42,544 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:00:42,550 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-07-14 15:00:42,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 15:00:42,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2022-07-14 15:00:42,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 15:00:42,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2022-07-14 15:00:42,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-14 15:00:42,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-14 15:00:42,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2022-07-14 15:00:42,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:00:42,564 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-14 15:00:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2022-07-14 15:00:42,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-14 15:00:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-07-14 15:00:42,605 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-14 15:00:42,606 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-14 15:00:42,606 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:00:42,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-07-14 15:00:42,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-14 15:00:42,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:42,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:42,607 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:00:42,607 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:00:42,607 INFO L752 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#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~mem10#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 36#L555-3 [2022-07-14 15:00:42,608 INFO L754 eck$LassoCheckResult]: Loop: 36#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 37#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 38#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 39#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#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 < 1073741824; 41#L557-3 assume !test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1; 40#L557-6 call test_fun_#t~mem11#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem11#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 36#L555-3 [2022-07-14 15:00:42,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-14 15:00:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:42,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454573565] [2022-07-14 15:00:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:42,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:42,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:42,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:42,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:42,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1099516495, now seen corresponding path program 1 times [2022-07-14 15:00:42,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:42,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516486932] [2022-07-14 15:00:42,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:42,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:42,724 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:42,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:00:42,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516486932] [2022-07-14 15:00:42,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516486932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:00:42,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:00:42,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 15:00:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509046743] [2022-07-14 15:00:42,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:00:42,726 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:00:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:00:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:00:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 15:00:42,727 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:00:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:00:42,784 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-07-14 15:00:42,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:00:42,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-07-14 15:00:42,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-14 15:00:42,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2022-07-14 15:00:42,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-14 15:00:42,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-14 15:00:42,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-07-14 15:00:42,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:00:42,787 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-14 15:00:42,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-07-14 15:00:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2022-07-14 15:00:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:00:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-07-14 15:00:42,791 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-14 15:00:42,792 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-14 15:00:42,792 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:00:42,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-07-14 15:00:42,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-14 15:00:42,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:42,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:42,793 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:00:42,793 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:00:42,793 INFO L752 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 68#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#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~mem10#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 69#L555-3 [2022-07-14 15:00:42,793 INFO L754 eck$LassoCheckResult]: Loop: 69#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 70#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 71#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 72#L557-1 assume !test_fun_#t~short9#1; 77#L557-3 assume !test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1; 73#L557-6 call test_fun_#t~mem11#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem11#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 69#L555-3 [2022-07-14 15:00:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-14 15:00:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:42,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932654627] [2022-07-14 15:00:42,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:42,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:42,823 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:42,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1099518417, now seen corresponding path program 1 times [2022-07-14 15:00:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:42,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616037341] [2022-07-14 15:00:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:42,870 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:42,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:42,878 INFO L85 PathProgramCache]: Analyzing trace with hash 179567635, now seen corresponding path program 1 times [2022-07-14 15:00:42,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:42,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682022475] [2022-07-14 15:00:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:42,917 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:42,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:43,498 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:00:43,499 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:00:43,499 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:00:43,499 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:00:43,499 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:00:43,499 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:43,499 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:00:43,499 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:00:43,500 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca.i_Iteration3_Lasso [2022-07-14 15:00:43,500 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:00:43,500 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:00:43,514 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:43,518 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:43,520 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:43,521 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:43,523 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:43,886 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:43,889 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:43,891 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:43,892 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:43,894 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:43,896 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:43,901 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:43,903 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:43,905 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:43,907 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:43,908 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:43,910 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:43,912 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:44,205 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:00:44,210 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:00:44,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,228 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 15:00:44,229 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 15:00:44,231 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:44,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:44,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:44,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:44,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,290 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 15:00:44,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,292 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 15:00:44,293 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 15:00:44,294 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:44,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:44,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:44,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:44,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:44,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,330 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 15:00:44,331 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 15:00:44,389 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:44,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:44,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:44,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:44,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,431 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 15:00:44,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,433 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 15:00:44,435 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 15:00:44,435 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:44,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:44,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:44,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:44,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,459 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 15:00:44,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,460 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 15:00:44,461 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 15:00:44,462 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:44,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:44,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:44,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,520 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 15:00:44,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,521 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 15:00:44,552 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:44,558 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 15:00:44,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:44,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:44,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:44,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,596 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 15:00:44,596 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 15:00:44,598 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:44,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:44,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:44,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,634 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 15:00:44,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,635 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 15:00:44,636 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 15:00:44,637 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:44,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:44,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:44,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,677 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 15:00:44,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,678 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 15:00:44,680 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 15:00:44,681 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:44,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:44,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:44,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,715 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 15:00:44,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,716 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 15:00:44,717 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 15:00:44,719 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:44,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:44,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:44,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,782 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 15:00:44,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,784 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 15:00:44,785 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 15:00:44,786 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:44,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:44,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:44,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,832 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 15:00:44,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,833 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 15:00:44,834 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 15:00:44,836 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:44,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:44,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:44,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:44,875 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 15:00:44,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,876 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 15:00:44,877 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 15:00:44,878 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:44,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:44,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:44,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:44,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:44,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:44,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:44,898 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:00:44,912 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-14 15:00:44,912 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-14 15:00:44,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:44,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:44,917 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 15:00:44,917 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 15:00:44,959 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:00:44,984 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:00:44,984 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:00:44,985 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1 + 1 Supporting invariants [] [2022-07-14 15:00:45,003 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 15:00:45,059 INFO L293 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2022-07-14 15:00:45,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:45,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 15:00:45,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:45,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 15:00:45,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:45,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 15:00:45,193 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:45,195 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-14 15:00:45,196 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:00:45,242 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 27 transitions. Complement of second has 6 states. [2022-07-14 15:00:45,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:00:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:00:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-07-14 15:00:45,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 6 letters. [2022-07-14 15:00:45,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:45,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2022-07-14 15:00:45,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:45,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 12 letters. [2022-07-14 15:00:45,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:45,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-07-14 15:00:45,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:00:45,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 26 transitions. [2022-07-14 15:00:45,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-14 15:00:45,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-14 15:00:45,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-07-14 15:00:45,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:00:45,249 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-14 15:00:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-07-14 15:00:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2022-07-14 15:00:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:00:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2022-07-14 15:00:45,250 INFO L392 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-07-14 15:00:45,250 INFO L374 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-07-14 15:00:45,250 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:00:45,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2022-07-14 15:00:45,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:00:45,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:45,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:45,251 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:00:45,251 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:00:45,251 INFO L752 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 232#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#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~mem10#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 237#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 239#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 233#L557-5 [2022-07-14 15:00:45,252 INFO L754 eck$LassoCheckResult]: Loop: 233#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 234#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#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 < 1073741824; 242#L557-3 assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem10#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 233#L557-5 [2022-07-14 15:00:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:45,252 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2022-07-14 15:00:45,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:45,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613497949] [2022-07-14 15:00:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:45,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:45,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:45,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 1 times [2022-07-14 15:00:45,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:45,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260729236] [2022-07-14 15:00:45,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:45,288 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:45,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907761, now seen corresponding path program 1 times [2022-07-14 15:00:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:45,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687640365] [2022-07-14 15:00:45,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:45,315 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:45,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:45,858 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:00:45,863 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:00:45,863 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:00:45,863 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:00:45,864 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:00:45,864 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:45,864 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:00:45,864 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:00:45,864 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca.i_Iteration4_Lasso [2022-07-14 15:00:45,864 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:00:45,864 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:00:45,866 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:45,885 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:45,888 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:45,890 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:45,892 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:45,893 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:45,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:46,217 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:46,219 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:46,221 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:46,223 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:46,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:46,227 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:46,229 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:46,231 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:46,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:00:46,234 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:46,236 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:46,238 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:46,240 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:46,525 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:00:46,525 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:00:46,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:46,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:46,530 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 15:00:46,550 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:46,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:46,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:46,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:46,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:46,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:46,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:46,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:46,558 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 15:00:46,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:46,584 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 15:00:46,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:46,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:46,586 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 15:00:46,587 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 15:00:46,589 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:46,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:46,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:46,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:46,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:46,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:46,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:46,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:46,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:46,626 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 15:00:46,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:46,628 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:46,629 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:46,630 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:46,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:46,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:46,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:46,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:46,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:46,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:46,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:46,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-14 15:00:46,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:46,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:46,672 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:46,674 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:46,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:00:46,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:46,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:46,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:46,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:46,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:46,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:46,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:46,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:46,712 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:46,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:46,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:46,714 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:46,720 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:46,721 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:46,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:46,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:00:46,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:46,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:46,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:46,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:00:46,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:00:46,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:46,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-14 15:00:46,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:46,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:46,746 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:46,746 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:46,748 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:46,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:46,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:46,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:46,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:46,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:46,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:46,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:46,787 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:46,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:46,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:46,788 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:46,790 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:46,790 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:46,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:46,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:46,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:46,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:46,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:46,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:46,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:46,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:46,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:46,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:46,842 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:46,849 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:46,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:46,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:46,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:46,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:46,856 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:46,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:46,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:46,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:46,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-14 15:00:46,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:46,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:46,891 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:46,897 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:46,898 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:46,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:46,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:46,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:46,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:46,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:46,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:46,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:00:46,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-14 15:00:46,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:46,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:46,938 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:46,939 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:46,940 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:46,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:00:46,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:00:46,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:00:46,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:00:46,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:00:46,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:00:46,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:00:46,979 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-14 15:00:46,980 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 15:00:46,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:00:46,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:46,981 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:46,981 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:46,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:00:46,989 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-14 15:00:46,989 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:00:46,989 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(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) = -2*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 + 2147483647 Supporting invariants [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 - 1 >= 0] [2022-07-14 15:00:47,004 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:47,073 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:47,080 INFO L293 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2022-07-14 15:00:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:47,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:00:47,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:47,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 15:00:47,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:47,177 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:47,178 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:00:47,178 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:00:47,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 50 transitions. Complement of second has 7 states. [2022-07-14 15:00:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:00:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:00:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-07-14 15:00:47,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2022-07-14 15:00:47,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:47,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2022-07-14 15:00:47,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:47,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-14 15:00:47,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:00:47,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2022-07-14 15:00:47,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:00:47,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 27 states and 37 transitions. [2022-07-14 15:00:47,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-14 15:00:47,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-14 15:00:47,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2022-07-14 15:00:47,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:00:47,207 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-07-14 15:00:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2022-07-14 15:00:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-07-14 15:00:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-07-14 15:00:47,209 INFO L392 hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-07-14 15:00:47,209 INFO L374 stractBuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-07-14 15:00:47,209 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:00:47,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2022-07-14 15:00:47,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:00:47,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:47,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:47,211 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 15:00:47,211 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:00:47,211 INFO L752 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 430#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#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~mem10#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 436#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 437#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 433#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 435#L557-1 assume !test_fun_#t~short9#1; 445#L557-3 assume !test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1; 441#L557-6 call test_fun_#t~mem11#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem11#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 438#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 440#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 431#L557-5 [2022-07-14 15:00:47,211 INFO L754 eck$LassoCheckResult]: Loop: 431#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 432#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#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 < 1073741824; 442#L557-3 assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem10#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 431#L557-5 [2022-07-14 15:00:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash 765805624, now seen corresponding path program 2 times [2022-07-14 15:00:47,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:47,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362792892] [2022-07-14 15:00:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:47,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:47,228 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:47,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:47,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 2 times [2022-07-14 15:00:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:47,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523210551] [2022-07-14 15:00:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:47,245 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:47,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash -750914783, now seen corresponding path program 1 times [2022-07-14 15:00:47,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:47,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147137144] [2022-07-14 15:00:47,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:47,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:00:47,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147137144] [2022-07-14 15:00:47,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147137144] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:00:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226622563] [2022-07-14 15:00:47,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:47,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:47,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:47,337 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:00:47,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-14 15:00:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:47,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 15:00:47,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:47,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 15:00:47,517 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:00:47,517 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 2 case distinctions, treesize of input 39 treesize of output 38 [2022-07-14 15:00:47,591 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:00:47,592 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 2 case distinctions, treesize of input 45 treesize of output 44 [2022-07-14 15:00:47,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 15:00:47,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2022-07-14 15:00:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:47,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:00:47,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2022-07-14 15:00:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:47,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226622563] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:00:47,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:00:47,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-07-14 15:00:47,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76742497] [2022-07-14 15:00:47,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:00:47,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:00:47,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 15:00:47,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-07-14 15:00:47,910 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 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:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:00:48,164 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-07-14 15:00:48,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 15:00:48,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2022-07-14 15:00:48,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:00:48,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 30 states and 35 transitions. [2022-07-14 15:00:48,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-14 15:00:48,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-14 15:00:48,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2022-07-14 15:00:48,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:00:48,168 INFO L369 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-14 15:00:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2022-07-14 15:00:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2022-07-14 15:00:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-07-14 15:00:48,170 INFO L392 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-07-14 15:00:48,170 INFO L374 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-07-14 15:00:48,170 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:00:48,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2022-07-14 15:00:48,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:00:48,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:00:48,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:00:48,171 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:00:48,171 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:00:48,171 INFO L752 eck$LassoCheckResult]: Stem: 626#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 627#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#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~mem10#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 628#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 629#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 635#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 636#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#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 < 1073741824; 639#L557-3 assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem10#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 640#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 641#L557-1 assume !test_fun_#t~short9#1; 642#L557-3 assume !test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1; 637#L557-6 call test_fun_#t~mem11#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem11#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 630#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 632#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 633#L557-5 [2022-07-14 15:00:48,171 INFO L754 eck$LassoCheckResult]: Loop: 633#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 634#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#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 < 1073741824; 638#L557-3 assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem10#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 633#L557-5 [2022-07-14 15:00:48,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1418285825, now seen corresponding path program 2 times [2022-07-14 15:00:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:48,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392971708] [2022-07-14 15:00:48,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:48,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:48,210 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:48,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:48,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 3 times [2022-07-14 15:00:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:48,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261767746] [2022-07-14 15:00:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:48,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:48,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:00:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:00:48,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:00:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:00:48,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1735228488, now seen corresponding path program 3 times [2022-07-14 15:00:48,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:00:48,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223709792] [2022-07-14 15:00:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:00:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:00:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:00:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:48,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:00:48,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223709792] [2022-07-14 15:00:48,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223709792] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:00:48,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657724439] [2022-07-14 15:00:48,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 15:00:48,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:00:48,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:00:48,325 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:00:48,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-14 15:00:48,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-14 15:00:48,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:00:48,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 15:00:48,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:00:48,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 15:00:48,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 15:00:48,616 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:00:48,616 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 2 case distinctions, treesize of input 43 treesize of output 42 [2022-07-14 15:00:48,746 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:00:48,746 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 2 case distinctions, treesize of input 55 treesize of output 54 [2022-07-14 15:00:48,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 15:00:48,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 31 [2022-07-14 15:00:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:00:48,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:01:25,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2022-07-14 15:01:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:01:25,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657724439] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:01:25,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:01:25,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2022-07-14 15:01:25,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151185564] [2022-07-14 15:01:25,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:01:25,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:01:25,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 15:01:25,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=442, Unknown=1, NotChecked=0, Total=552 [2022-07-14 15:01:25,372 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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 15:01:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:01:26,081 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-07-14 15:01:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 15:01:26,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 65 transitions. [2022-07-14 15:01:26,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:01:26,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 38 states and 43 transitions. [2022-07-14 15:01:26,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-14 15:01:26,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-14 15:01:26,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2022-07-14 15:01:26,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:01:26,083 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-07-14 15:01:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2022-07-14 15:01:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2022-07-14 15:01:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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:01:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-14 15:01:26,085 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-14 15:01:26,085 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-14 15:01:26,086 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:01:26,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2022-07-14 15:01:26,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:01:26,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:26,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:26,087 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-14 15:01:26,087 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:01:26,087 INFO L752 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 859#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#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~mem10#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#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_~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;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_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#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(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 864#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 865#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 886#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 884#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#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 < 1073741824; 871#L557-3 assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem10#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 862#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 863#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#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 < 1073741824; 872#L557-3 assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem10#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 880#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 875#L557-1 assume !test_fun_#t~short9#1; 874#L557-3 assume !test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1; 869#L557-6 call test_fun_#t~mem11#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem11#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 866#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 868#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 860#L557-5 [2022-07-14 15:01:26,087 INFO L754 eck$LassoCheckResult]: Loop: 860#L557-5 call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_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~mem6#1 > test_fun_#t~mem7#1; 861#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#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 < 1073741824; 870#L557-3 assume !!test_fun_#t~short9#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem10#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 860#L557-5 [2022-07-14 15:01:26,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:26,088 INFO L85 PathProgramCache]: Analyzing trace with hash 433972120, now seen corresponding path program 4 times [2022-07-14 15:01:26,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:26,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881319286] [2022-07-14 15:01:26,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:26,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:26,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:26,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 4 times [2022-07-14 15:01:26,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:26,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409216412] [2022-07-14 15:01:26,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:26,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:26,137 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:26,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash 611882945, now seen corresponding path program 5 times [2022-07-14 15:01:26,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:26,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874704445] [2022-07-14 15:01:26,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:26,177 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:26,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:28,970 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:01:28,970 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:01:28,970 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:01:28,970 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:01:28,971 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:01:28,971 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:28,971 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:01:28,971 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:01:28,971 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca.i_Iteration7_Lasso [2022-07-14 15:01:28,971 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:01:28,971 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:01:28,973 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:01:28,976 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:01:28,983 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:01:28,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:28,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:28,989 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:01:28,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:28,992 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:01:29,517 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:01:29,519 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:01:29,520 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:01:29,523 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:01:29,524 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:01:29,527 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:01:29,528 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:01:29,530 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:01:29,531 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:01:30,032 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:01:30,032 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:01:30,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:30,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:30,034 INFO L229 MonitoredProcess]: Starting monitored process 29 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:01:30,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-14 15:01:30,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:30,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:30,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:30,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:30,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:30,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:30,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:30,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:30,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:30,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-14 15:01:30,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:30,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:30,062 INFO L229 MonitoredProcess]: Starting monitored process 30 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:01:30,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-14 15:01:30,065 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:01:30,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:30,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:30,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:30,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:30,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:30,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:30,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:30,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-14 15:01:30,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:30,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:30,090 INFO L229 MonitoredProcess]: Starting monitored process 31 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:01:30,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-14 15:01:30,092 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:01:30,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:30,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:30,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:30,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:30,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:30,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:30,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:30,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:30,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-14 15:01:30,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:30,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:30,115 INFO L229 MonitoredProcess]: Starting monitored process 32 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:01:30,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-14 15:01:30,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:30,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:30,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:30,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:30,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:30,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:30,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:30,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:30,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:30,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-14 15:01:30,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:30,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:30,155 INFO L229 MonitoredProcess]: Starting monitored process 33 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:01:30,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-14 15:01:30,158 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:01:30,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:30,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:30,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:30,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:30,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:30,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:30,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:30,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-14 15:01:30,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:30,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:30,187 INFO L229 MonitoredProcess]: Starting monitored process 34 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:01:30,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-14 15:01:30,189 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:01:30,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:30,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:30,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:30,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:30,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:30,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:30,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:30,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:30,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-14 15:01:30,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:30,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:30,213 INFO L229 MonitoredProcess]: Starting monitored process 35 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:01:30,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-14 15:01:30,215 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:01:30,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:30,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:30,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:30,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:30,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:30,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:30,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:30,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:30,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:30,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:30,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:30,248 INFO L229 MonitoredProcess]: Starting monitored process 36 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:01:30,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-14 15:01:30,249 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:01:30,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:30,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:30,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:30,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:30,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:30,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:30,268 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:01:30,274 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-14 15:01:30,275 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-14 15:01:30,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:30,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:30,276 INFO L229 MonitoredProcess]: Starting monitored process 37 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:01:30,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-14 15:01:30,277 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:01:30,283 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-14 15:01:30,283 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:01:30,284 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_3 + 2147483647 Supporting invariants [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)_3 - 1 >= 0] [2022-07-14 15:01:30,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-14 15:01:30,356 INFO L293 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2022-07-14 15:01:30,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:30,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:01:30,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:30,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 15:01:30,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:30,513 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:01:30,514 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:01:30,514 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:01:30,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:30,588 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 45 transitions. Complement of second has 7 states. [2022-07-14 15:01:30,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:01:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:01:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-07-14 15:01:30,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 16 letters. Loop has 3 letters. [2022-07-14 15:01:30,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:30,590 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:01:30,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:30,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:01:30,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:30,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 15:01:30,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:30,707 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:01:30,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:01:30,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:01:30,756 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 45 transitions. Complement of second has 7 states. [2022-07-14 15:01:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:01:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:01:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-07-14 15:01:30,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 16 letters. Loop has 3 letters. [2022-07-14 15:01:30,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:30,759 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:01:30,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:30,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:01:30,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:30,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 15:01:30,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:30,912 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:01:30,912 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:01:30,912 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:01:30,954 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 55 transitions. Complement of second has 6 states. [2022-07-14 15:01:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:01:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:01:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-07-14 15:01:30,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 3 letters. [2022-07-14 15:01:30,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:30,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 3 letters. [2022-07-14 15:01:30,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:30,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 6 letters. [2022-07-14 15:01:30,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:30,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2022-07-14 15:01:30,957 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:01:30,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2022-07-14 15:01:30,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 15:01:30,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 15:01:30,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 15:01:30,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:01:30,957 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:01:30,957 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:01:30,957 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:01:30,957 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:01:30,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 15:01:30,957 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:01:30,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 15:01:30,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:01:30 BoogieIcfgContainer [2022-07-14 15:01:30,962 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:01:30,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:01:30,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:01:30,962 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:01:30,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:00:42" (3/4) ... [2022-07-14 15:01:30,965 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 15:01:30,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:01:30,965 INFO L158 Benchmark]: Toolchain (without parser) took 49386.71ms. Allocated memory was 109.1MB in the beginning and 161.5MB in the end (delta: 52.4MB). Free memory was 74.0MB in the beginning and 95.3MB in the end (delta: -21.3MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2022-07-14 15:01:30,965 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 55.0MB in the beginning and 55.0MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:01:30,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.34ms. Allocated memory is still 109.1MB. Free memory was 73.8MB in the beginning and 78.8MB in the end (delta: -5.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-07-14 15:01:30,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.01ms. Allocated memory is still 109.1MB. Free memory was 78.8MB in the beginning and 76.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:01:30,966 INFO L158 Benchmark]: Boogie Preprocessor took 35.56ms. Allocated memory is still 109.1MB. Free memory was 76.7MB in the beginning and 75.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:01:30,966 INFO L158 Benchmark]: RCFGBuilder took 211.96ms. Allocated memory is still 109.1MB. Free memory was 75.5MB in the beginning and 64.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 15:01:30,966 INFO L158 Benchmark]: BuchiAutomizer took 48773.74ms. Allocated memory was 109.1MB in the beginning and 161.5MB in the end (delta: 52.4MB). Free memory was 64.0MB in the beginning and 95.3MB in the end (delta: -31.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-07-14 15:01:30,966 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 161.5MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:01:30,967 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.17ms. Allocated memory is still 83.9MB. Free memory was 55.0MB in the beginning and 55.0MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.34ms. Allocated memory is still 109.1MB. Free memory was 73.8MB in the beginning and 78.8MB in the end (delta: -5.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.01ms. Allocated memory is still 109.1MB. Free memory was 78.8MB in the beginning and 76.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.56ms. Allocated memory is still 109.1MB. Free memory was 76.7MB in the beginning and 75.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 211.96ms. Allocated memory is still 109.1MB. Free memory was 75.5MB in the beginning and 64.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 48773.74ms. Allocated memory was 109.1MB in the beginning and 161.5MB in the end (delta: 52.4MB). Free memory was 64.0MB in the beginning and 95.3MB in the end (delta: -31.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 161.5MB. Free memory is still 95.3MB. 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 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 4 locations. One deterministic module has affine ranking function 2147483647 + -2 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. One nondeterministic module has affine ranking function 2147483647 + -2 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.7s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 46.6s. Construction of modules took 0.3s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 89 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 300 IncrementalHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 55 mSDtfsCounter, 300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital615 mio100 ax104 hnf100 lsp93 ukn40 mio100 lsp34 div100 bol100 ite100 ukn100 eq187 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 9 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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:01:30,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:31,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:31,434 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