./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 ae007674 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-dev-ae00767 [2021-12-28 09:09:28,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 09:09:28,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 09:09:28,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 09:09:28,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 09:09:28,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 09:09:28,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 09:09:28,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 09:09:28,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 09:09:28,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 09:09:28,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 09:09:28,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 09:09:28,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 09:09:28,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 09:09:28,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 09:09:28,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 09:09:28,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 09:09:28,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 09:09:28,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 09:09:28,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 09:09:28,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 09:09:28,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 09:09:28,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 09:09:28,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 09:09:28,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 09:09:28,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 09:09:28,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 09:09:28,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 09:09:28,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 09:09:28,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 09:09:28,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 09:09:28,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 09:09:28,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 09:09:28,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 09:09:28,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 09:09:28,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 09:09:28,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 09:09:28,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 09:09:28,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 09:09:28,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 09:09:28,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 09:09:28,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-28 09:09:28,893 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 09:09:28,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 09:09:28,894 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 09:09:28,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 09:09:28,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 09:09:28,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 09:09:28,896 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 09:09:28,896 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-28 09:09:28,896 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-28 09:09:28,896 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-28 09:09:28,897 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-28 09:09:28,897 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-28 09:09:28,897 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-28 09:09:28,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 09:09:28,897 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 09:09:28,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 09:09:28,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 09:09:28,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-28 09:09:28,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-28 09:09:28,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-28 09:09:28,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 09:09:28,898 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-28 09:09:28,898 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 09:09:28,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-28 09:09:28,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 09:09:28,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 09:09:28,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 09:09:28,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 09:09:28,908 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-28 09:09:28,908 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 [2021-12-28 09:09:29,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 09:09:29,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 09:09:29,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 09:09:29,240 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 09:09:29,240 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 09:09:29,242 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 [2021-12-28 09:09:29,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4349fc495/b7091f6e97bb4e7a96790e8a054646b4/FLAGb452d4c1b [2021-12-28 09:09:29,760 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 09:09:29,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i [2021-12-28 09:09:29,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4349fc495/b7091f6e97bb4e7a96790e8a054646b4/FLAGb452d4c1b [2021-12-28 09:09:29,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4349fc495/b7091f6e97bb4e7a96790e8a054646b4 [2021-12-28 09:09:29,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 09:09:29,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 09:09:29,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 09:09:29,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 09:09:29,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 09:09:29,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:09:29" (1/1) ... [2021-12-28 09:09:29,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d13db67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:29, skipping insertion in model container [2021-12-28 09:09:29,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:09:29" (1/1) ... [2021-12-28 09:09:29,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 09:09:29,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 09:09:30,084 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:09:30,092 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 09:09:30,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:09:30,146 INFO L208 MainTranslator]: Completed translation [2021-12-28 09:09:30,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30 WrapperNode [2021-12-28 09:09:30,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 09:09:30,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 09:09:30,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 09:09:30,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 09:09:30,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30" (1/1) ... [2021-12-28 09:09:30,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30" (1/1) ... [2021-12-28 09:09:30,187 INFO L137 Inliner]: procedures = 111, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2021-12-28 09:09:30,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 09:09:30,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 09:09:30,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 09:09:30,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 09:09:30,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30" (1/1) ... [2021-12-28 09:09:30,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30" (1/1) ... [2021-12-28 09:09:30,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30" (1/1) ... [2021-12-28 09:09:30,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30" (1/1) ... [2021-12-28 09:09:30,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30" (1/1) ... [2021-12-28 09:09:30,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30" (1/1) ... [2021-12-28 09:09:30,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30" (1/1) ... [2021-12-28 09:09:30,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 09:09:30,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 09:09:30,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 09:09:30,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 09:09:30,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30" (1/1) ... [2021-12-28 09:09:30,221 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:30,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:30,245 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) [2021-12-28 09:09:30,251 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 [2021-12-28 09:09:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 09:09:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 09:09:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 09:09:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 09:09:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 09:09:30,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 09:09:30,332 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 09:09:30,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 09:09:30,461 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 09:09:30,465 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 09:09:30,465 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-28 09:09:30,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:09:30 BoogieIcfgContainer [2021-12-28 09:09:30,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 09:09:30,467 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-28 09:09:30,468 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-28 09:09:30,469 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-28 09:09:30,470 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:09:30,470 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.12 09:09:29" (1/3) ... [2021-12-28 09:09:30,471 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e98bd6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:09:30, skipping insertion in model container [2021-12-28 09:09:30,471 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:09:30,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:09:30" (2/3) ... [2021-12-28 09:09:30,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e98bd6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:09:30, skipping insertion in model container [2021-12-28 09:09:30,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:09:30,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:09:30" (3/3) ... [2021-12-28 09:09:30,480 INFO L388 chiAutomizerObserver]: Analyzing ICFG c.01-no-inv-alloca.i [2021-12-28 09:09:30,507 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-28 09:09:30,507 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-28 09:09:30,508 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-28 09:09:30,508 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-28 09:09:30,508 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-28 09:09:30,508 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-28 09:09:30,508 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-28 09:09:30,508 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-28 09:09:30,517 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) [2021-12-28 09:09:30,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-28 09:09:30,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:09:30,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:09:30,536 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:09:30,536 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-28 09:09:30,536 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-28 09:09:30,536 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) [2021-12-28 09:09:30,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-28 09:09:30,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:09:30,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:09:30,538 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:09:30,538 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-28 09:09:30,542 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#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); 6#L555-3true [2021-12-28 09:09:30,542 INFO L793 eck$LassoCheckResult]: Loop: 6#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); 13#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); 9#L557-5true assume !true; 10#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; 6#L555-3true [2021-12-28 09:09:30,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-28 09:09:30,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:30,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899628363] [2021-12-28 09:09:30,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:30,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:30,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:09:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:30,728 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:09:30,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:30,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1144552, now seen corresponding path program 1 times [2021-12-28 09:09:30,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:30,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672467016] [2021-12-28 09:09:30,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:30,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:09:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:09:30,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:09:30,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672467016] [2021-12-28 09:09:30,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672467016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:09:30,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:09:30,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 09:09:30,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839988968] [2021-12-28 09:09:30,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:09:30,801 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:09:30,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:09:30,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-28 09:09:30,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 09:09:30,829 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) [2021-12-28 09:09:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:09:30,833 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2021-12-28 09:09:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 09:09:30,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2021-12-28 09:09:30,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-28 09:09:30,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2021-12-28 09:09:30,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-28 09:09:30,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-28 09:09:30,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2021-12-28 09:09:30,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:09:30,843 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-12-28 09:09:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2021-12-28 09:09:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-28 09:09:30,865 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) [2021-12-28 09:09:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2021-12-28 09:09:30,866 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-12-28 09:09:30,866 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-12-28 09:09:30,866 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-28 09:09:30,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2021-12-28 09:09:30,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-28 09:09:30,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:09:30,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:09:30,868 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:09:30,868 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-28 09:09:30,868 INFO L791 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 [2021-12-28 09:09:30,869 INFO L793 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 [2021-12-28 09:09:30,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-28 09:09:30,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:30,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400236469] [2021-12-28 09:09:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:30,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:30,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:09:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:30,930 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:09:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1099516495, now seen corresponding path program 1 times [2021-12-28 09:09:30,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:30,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530740844] [2021-12-28 09:09:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:30,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:09:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:09:31,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:09:31,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530740844] [2021-12-28 09:09:31,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530740844] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:09:31,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:09:31,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 09:09:31,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45886230] [2021-12-28 09:09:31,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:09:31,008 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:09:31,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:09:31,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 09:09:31,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 09:09:31,009 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) [2021-12-28 09:09:31,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:09:31,058 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2021-12-28 09:09:31,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 09:09:31,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2021-12-28 09:09:31,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-12-28 09:09:31,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2021-12-28 09:09:31,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-28 09:09:31,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-28 09:09:31,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2021-12-28 09:09:31,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:09:31,061 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-28 09:09:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2021-12-28 09:09:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2021-12-28 09:09:31,062 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) [2021-12-28 09:09:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2021-12-28 09:09:31,062 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2021-12-28 09:09:31,062 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2021-12-28 09:09:31,062 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-28 09:09:31,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2021-12-28 09:09:31,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-28 09:09:31,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:09:31,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:09:31,063 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:09:31,063 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-28 09:09:31,064 INFO L791 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 [2021-12-28 09:09:31,064 INFO L793 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 [2021-12-28 09:09:31,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:31,064 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-28 09:09:31,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:31,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938869276] [2021-12-28 09:09:31,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:31,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:31,077 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:09:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:31,086 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:09:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1099518417, now seen corresponding path program 1 times [2021-12-28 09:09:31,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:31,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905115376] [2021-12-28 09:09:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:31,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:31,095 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:09:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:31,100 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:09:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash 179567635, now seen corresponding path program 1 times [2021-12-28 09:09:31,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:31,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110777010] [2021-12-28 09:09:31,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:31,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:31,119 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:09:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:31,161 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:09:31,719 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:09:31,720 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:09:31,720 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:09:31,720 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:09:31,720 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:09:31,720 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:31,721 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:09:31,721 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:09:31,721 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca.i_Iteration3_Lasso [2021-12-28 09:09:31,721 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:09:31,721 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:09:31,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:31,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:31,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:31,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:31,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:32,451 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:09:32,454 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:09:32,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,463 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) [2021-12-28 09:09:32,470 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 [2021-12-28 09:09:32,477 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 [2021-12-28 09:09:32,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:32,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:09:32,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:32,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:32,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:32,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:09:32,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:09:32,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:32,526 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 [2021-12-28 09:09:32,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,527 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) [2021-12-28 09:09:32,530 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 [2021-12-28 09:09:32,530 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 [2021-12-28 09:09:32,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:32,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:09:32,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:32,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:32,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:32,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:09:32,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:09:32,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:32,562 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 [2021-12-28 09:09:32,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,564 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) [2021-12-28 09:09:32,565 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 [2021-12-28 09:09:32,566 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 [2021-12-28 09:09:32,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:32,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:09:32,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:32,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:32,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:32,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:09:32,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:09:32,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:32,593 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 [2021-12-28 09:09:32,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,595 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) [2021-12-28 09:09:32,595 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 [2021-12-28 09:09:32,597 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 [2021-12-28 09:09:32,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:32,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:09:32,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:32,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:32,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:32,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:09:32,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:09:32,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:32,630 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 [2021-12-28 09:09:32,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,631 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) [2021-12-28 09:09:32,640 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 [2021-12-28 09:09:32,641 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 [2021-12-28 09:09:32,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:32,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:32,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:32,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:32,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:32,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:32,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:32,689 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 [2021-12-28 09:09:32,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,690 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) [2021-12-28 09:09:32,691 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 [2021-12-28 09:09:32,693 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 [2021-12-28 09:09:32,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:32,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:32,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:32,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:32,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:32,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:32,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:32,734 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 [2021-12-28 09:09:32,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,736 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) [2021-12-28 09:09:32,742 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 [2021-12-28 09:09:32,742 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 [2021-12-28 09:09:32,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:32,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:32,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:32,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:32,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:32,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:32,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:32,774 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 [2021-12-28 09:09:32,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,776 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) [2021-12-28 09:09:32,777 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 [2021-12-28 09:09:32,778 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 [2021-12-28 09:09:32,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:32,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:32,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:32,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:32,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:32,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:32,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:32,806 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 [2021-12-28 09:09:32,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,807 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) [2021-12-28 09:09:32,808 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 [2021-12-28 09:09:32,809 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 [2021-12-28 09:09:32,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:32,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:32,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:32,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:32,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:32,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:32,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:32,869 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 [2021-12-28 09:09:32,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,870 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) [2021-12-28 09:09:32,876 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 [2021-12-28 09:09:32,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:32,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:32,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:32,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:32,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:32,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:32,890 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 [2021-12-28 09:09:32,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:32,916 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 [2021-12-28 09:09:32,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,917 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) [2021-12-28 09:09:32,918 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 [2021-12-28 09:09:32,920 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 [2021-12-28 09:09:32,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:32,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:32,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:32,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:32,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:32,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:32,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:32,986 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 [2021-12-28 09:09:32,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:32,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:32,995 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) [2021-12-28 09:09:32,996 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 [2021-12-28 09:09:32,997 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 [2021-12-28 09:09:33,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:33,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:33,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:33,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:33,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:33,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:33,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:33,040 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 [2021-12-28 09:09:33,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:33,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:33,041 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) [2021-12-28 09:09:33,042 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 [2021-12-28 09:09:33,044 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 [2021-12-28 09:09:33,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:33,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:33,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:33,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:33,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:33,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:33,083 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:09:33,105 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-12-28 09:09:33,105 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2021-12-28 09:09:33,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:33,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:33,131 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) [2021-12-28 09:09:33,171 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 [2021-12-28 09:09:33,172 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:09:33,204 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-28 09:09:33,204 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:09:33,205 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 [] [2021-12-28 09:09:33,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-12-28 09:09:33,318 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2021-12-28 09:09:33,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:09:33,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 09:09:33,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:09:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:09:33,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-28 09:09:33,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:09:33,522 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 [2021-12-28 09:09:33,542 INFO L387 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 [2021-12-28 09:09:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:09:33,586 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 [2021-12-28 09:09:33,587 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) [2021-12-28 09:09:33,642 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. [2021-12-28 09:09:33,642 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 [2021-12-28 09:09:33,644 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) [2021-12-28 09:09:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-12-28 09:09:33,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 6 letters. [2021-12-28 09:09:33,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:09:33,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2021-12-28 09:09:33,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:09:33,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 12 letters. [2021-12-28 09:09:33,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:09:33,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2021-12-28 09:09:33,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:09:33,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 26 transitions. [2021-12-28 09:09:33,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-28 09:09:33,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-28 09:09:33,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2021-12-28 09:09:33,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:09:33,651 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-28 09:09:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2021-12-28 09:09:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2021-12-28 09:09:33,652 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) [2021-12-28 09:09:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2021-12-28 09:09:33,654 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2021-12-28 09:09:33,654 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2021-12-28 09:09:33,654 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-28 09:09:33,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2021-12-28 09:09:33,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:09:33,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:09:33,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:09:33,655 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-28 09:09:33,655 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:09:33,655 INFO L791 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 [2021-12-28 09:09:33,656 INFO L793 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 [2021-12-28 09:09:33,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:33,656 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2021-12-28 09:09:33,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:33,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651185085] [2021-12-28 09:09:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:33,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:33,689 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:09:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:33,711 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:09:33,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:33,717 INFO L85 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 1 times [2021-12-28 09:09:33,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:33,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255904155] [2021-12-28 09:09:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:33,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:33,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:09:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:33,733 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:09:33,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:33,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907761, now seen corresponding path program 1 times [2021-12-28 09:09:33,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:33,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144353921] [2021-12-28 09:09:33,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:33,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:33,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:09:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:33,763 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:09:34,304 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:09:34,305 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:09:34,305 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:09:34,305 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:09:34,305 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:09:34,305 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:34,305 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:09:34,305 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:09:34,305 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca.i_Iteration4_Lasso [2021-12-28 09:09:34,305 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:09:34,305 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:09:34,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:09:34,975 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:09:34,975 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:09:34,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:34,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:34,976 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) [2021-12-28 09:09:34,977 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 [2021-12-28 09:09:34,979 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 [2021-12-28 09:09:34,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:34,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:09:34,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:34,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:34,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:34,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:09:34,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:09:34,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:35,015 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 [2021-12-28 09:09:35,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:35,021 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) [2021-12-28 09:09:35,022 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 [2021-12-28 09:09:35,023 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 [2021-12-28 09:09:35,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:35,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:09:35,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:35,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:35,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:35,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:09:35,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:09:35,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:35,051 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 [2021-12-28 09:09:35,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:35,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:35,052 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) [2021-12-28 09:09:35,053 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 [2021-12-28 09:09:35,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:09:35,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:35,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:35,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:35,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:35,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:35,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:35,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:35,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-28 09:09:35,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:35,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:35,111 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) [2021-12-28 09:09:35,112 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 [2021-12-28 09:09:35,113 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 [2021-12-28 09:09:35,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:35,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:09:35,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:35,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:35,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:35,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:09:35,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:09:35,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:35,143 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 [2021-12-28 09:09:35,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:35,146 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) [2021-12-28 09:09:35,150 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 [2021-12-28 09:09:35,151 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 [2021-12-28 09:09:35,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:35,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:09:35,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:35,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:35,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:35,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:09:35,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:09:35,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:35,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-28 09:09:35,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:35,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:35,200 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) [2021-12-28 09:09:35,206 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 [2021-12-28 09:09:35,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:35,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:35,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:35,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:35,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:35,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:35,217 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 [2021-12-28 09:09:35,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:35,244 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 [2021-12-28 09:09:35,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:35,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:35,246 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) [2021-12-28 09:09:35,248 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 [2021-12-28 09:09:35,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 [2021-12-28 09:09:35,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:35,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:35,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:35,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:35,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:35,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:35,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:35,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-28 09:09:35,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:35,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:35,301 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) [2021-12-28 09:09:35,306 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 [2021-12-28 09:09:35,307 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 [2021-12-28 09:09:35,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:35,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:35,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:35,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:35,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:35,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:35,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:35,332 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 [2021-12-28 09:09:35,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:35,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:35,333 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) [2021-12-28 09:09:35,334 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 [2021-12-28 09:09:35,335 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 [2021-12-28 09:09:35,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:35,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:35,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:35,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:35,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:35,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:35,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:09:35,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-28 09:09:35,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:35,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:35,369 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) [2021-12-28 09:09:35,370 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 [2021-12-28 09:09:35,371 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 [2021-12-28 09:09:35,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:09:35,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:09:35,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:09:35,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:09:35,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:09:35,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:09:35,390 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:09:35,396 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-28 09:09:35,396 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-28 09:09:35,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:09:35,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:35,420 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) [2021-12-28 09:09:35,421 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 [2021-12-28 09:09:35,422 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:09:35,448 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-28 09:09:35,448 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:09:35,448 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] [2021-12-28 09:09:35,466 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 [2021-12-28 09:09:35,528 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2021-12-28 09:09:35,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:09:35,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 09:09:35,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:09:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:09:35,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-28 09:09:35,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:09:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:09:35,701 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 [2021-12-28 09:09:35,701 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) [2021-12-28 09:09:35,757 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. [2021-12-28 09:09:35,757 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 [2021-12-28 09:09:35,758 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) [2021-12-28 09:09:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2021-12-28 09:09:35,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2021-12-28 09:09:35,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:09:35,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2021-12-28 09:09:35,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:09:35,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 6 letters. [2021-12-28 09:09:35,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:09:35,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2021-12-28 09:09:35,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:09:35,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 27 states and 37 transitions. [2021-12-28 09:09:35,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-28 09:09:35,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-28 09:09:35,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2021-12-28 09:09:35,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:09:35,767 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2021-12-28 09:09:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2021-12-28 09:09:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2021-12-28 09:09:35,770 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) [2021-12-28 09:09:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-12-28 09:09:35,771 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-12-28 09:09:35,771 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-12-28 09:09:35,771 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-28 09:09:35,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2021-12-28 09:09:35,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:09:35,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:09:35,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:09:35,773 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 09:09:35,773 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:09:35,773 INFO L791 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 [2021-12-28 09:09:35,774 INFO L793 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 [2021-12-28 09:09:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:35,774 INFO L85 PathProgramCache]: Analyzing trace with hash 765805624, now seen corresponding path program 2 times [2021-12-28 09:09:35,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:35,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82794781] [2021-12-28 09:09:35,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:35,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:35,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:09:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:35,834 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:09:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 2 times [2021-12-28 09:09:35,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:35,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305629557] [2021-12-28 09:09:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:35,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:35,853 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:09:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:09:35,857 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:09:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:35,857 INFO L85 PathProgramCache]: Analyzing trace with hash -750914783, now seen corresponding path program 1 times [2021-12-28 09:09:35,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:35,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955850074] [2021-12-28 09:09:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:35,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:09:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:09:36,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:09:36,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955850074] [2021-12-28 09:09:36,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955850074] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:09:36,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865667774] [2021-12-28 09:09:36,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:36,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:09:36,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:36,039 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) [2021-12-28 09:09:36,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-28 09:09:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:09:36,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-28 09:09:36,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:09:36,158 INFO L387 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 [2021-12-28 09:09:36,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-28 09:09:36,298 INFO L353 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-28 09:09:36,299 INFO L387 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 [2021-12-28 09:09:36,396 INFO L353 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-28 09:09:36,396 INFO L387 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 [2021-12-28 09:09:36,463 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 09:09:36,464 INFO L387 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 [2021-12-28 09:09:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:09:36,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 09:10:12,864 INFO L387 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 [2021-12-28 09:10:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:10:12,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865667774] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 09:10:12,893 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 09:10:12,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2021-12-28 09:10:12,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130984315] [2021-12-28 09:10:12,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 09:10:12,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:10:12,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-28 09:10:12,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=289, Unknown=3, NotChecked=0, Total=380 [2021-12-28 09:10:12,977 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) [2021-12-28 09:10:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:10:13,255 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2021-12-28 09:10:13,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 09:10:13,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2021-12-28 09:10:13,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:10:13,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 30 states and 35 transitions. [2021-12-28 09:10:13,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-28 09:10:13,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-28 09:10:13,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2021-12-28 09:10:13,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:10:13,258 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-28 09:10:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2021-12-28 09:10:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2021-12-28 09:10:13,259 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) [2021-12-28 09:10:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2021-12-28 09:10:13,259 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-12-28 09:10:13,259 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-12-28 09:10:13,259 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-28 09:10:13,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2021-12-28 09:10:13,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:10:13,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:10:13,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:10:13,260 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:10:13,260 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:10:13,260 INFO L791 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 [2021-12-28 09:10:13,260 INFO L793 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 [2021-12-28 09:10:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:10:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1418285825, now seen corresponding path program 2 times [2021-12-28 09:10:13,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:10:13,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17350709] [2021-12-28 09:10:13,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:10:13,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:10:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:10:13,276 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:10:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:10:13,287 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:10:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:10:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 3 times [2021-12-28 09:10:13,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:10:13,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059839015] [2021-12-28 09:10:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:10:13,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:10:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:10:13,300 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:10:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:10:13,303 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:10:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:10:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1735228488, now seen corresponding path program 3 times [2021-12-28 09:10:13,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:10:13,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404900528] [2021-12-28 09:10:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:10:13,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:10:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:10:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:10:13,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:10:13,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404900528] [2021-12-28 09:10:13,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404900528] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:10:13,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515601467] [2021-12-28 09:10:13,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-28 09:10:13,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:10:13,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:10:13,464 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) [2021-12-28 09:10:13,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-28 09:10:13,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-28 09:10:13,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 09:10:13,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-28 09:10:13,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:10:13,577 INFO L387 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 [2021-12-28 09:10:13,633 INFO L387 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 [2021-12-28 09:10:13,841 INFO L353 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-28 09:10:13,842 INFO L387 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 [2021-12-28 09:10:14,085 INFO L353 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-28 09:10:14,085 INFO L387 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 [2021-12-28 09:10:14,196 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 09:10:14,196 INFO L387 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 [2021-12-28 09:10:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:10:14,243 INFO L328 TraceCheckSpWp]: Computing backward predicates...