./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-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 d2e8c7278f9710711a8ba5cefeb9f745a5377c275c5c72390d2d78403afcf1c7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 14:59:25,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:59:25,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:59:25,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:59:25,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:59:25,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:59:25,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:59:25,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:59:25,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:59:25,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:59:25,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:59:25,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:59:25,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:59:25,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:59:25,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:59:25,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:59:25,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:59:25,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:59:25,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:59:25,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:59:25,280 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:59:25,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:59:25,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:59:25,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:59:25,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:59:25,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:59:25,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:59:25,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:59:25,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:59:25,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:59:25,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:59:25,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:59:25,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:59:25,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:59:25,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:59:25,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:59:25,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:59:25,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:59:25,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:59:25,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:59:25,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:59:25,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:59:25,297 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 14:59:25,319 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:59:25,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:59:25,320 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:59:25,320 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:59:25,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:59:25,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:59:25,322 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:59:25,322 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 14:59:25,322 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 14:59:25,323 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 14:59:25,323 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 14:59:25,323 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 14:59:25,323 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 14:59:25,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:59:25,323 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:59:25,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:59:25,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:59:25,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 14:59:25,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 14:59:25,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 14:59:25,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:59:25,325 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 14:59:25,325 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:59:25,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 14:59:25,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:59:25,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:59:25,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:59:25,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:59:25,327 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 14:59:25,327 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 -> d2e8c7278f9710711a8ba5cefeb9f745a5377c275c5c72390d2d78403afcf1c7 [2022-07-14 14:59:25,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:59:25,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:59:25,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:59:25,549 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:59:25,549 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:59:25,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2022-07-14 14:59:25,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f817b33/8ecfe824c31141ec99711353111a4b51/FLAG24b8a28f6 [2022-07-14 14:59:25,985 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:59:25,988 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2022-07-14 14:59:26,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f817b33/8ecfe824c31141ec99711353111a4b51/FLAG24b8a28f6 [2022-07-14 14:59:26,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f817b33/8ecfe824c31141ec99711353111a4b51 [2022-07-14 14:59:26,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:59:26,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:59:26,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:59:26,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:59:26,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:59:26,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6796c130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26, skipping insertion in model container [2022-07-14 14:59:26,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:59:26,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:59:26,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:59:26,302 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:59:26,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:59:26,365 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:59:26,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26 WrapperNode [2022-07-14 14:59:26,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:59:26,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:59:26,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:59:26,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:59:26,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,414 INFO L137 Inliner]: procedures = 110, calls = 67, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2022-07-14 14:59:26,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:59:26,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:59:26,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:59:26,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:59:26,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:59:26,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:59:26,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:59:26,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:59:26,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26" (1/1) ... [2022-07-14 14:59:26,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:26,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:26,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:26,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 14:59:26,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 14:59:26,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 14:59:26,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 14:59:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 14:59:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:59:26,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:59:26,632 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:59:26,633 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:59:26,860 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:59:26,864 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:59:26,864 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 14:59:26,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:59:26 BoogieIcfgContainer [2022-07-14 14:59:26,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:59:26,866 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 14:59:26,867 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 14:59:26,869 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 14:59:26,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:59:26,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 02:59:26" (1/3) ... [2022-07-14 14:59:26,871 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ee98710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:59:26, skipping insertion in model container [2022-07-14 14:59:26,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:59:26,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:59:26" (2/3) ... [2022-07-14 14:59:26,872 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ee98710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:59:26, skipping insertion in model container [2022-07-14 14:59:26,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:59:26,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:59:26" (3/3) ... [2022-07-14 14:59:26,873 INFO L354 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca.i [2022-07-14 14:59:26,915 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 14:59:26,915 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 14:59:26,915 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 14:59:26,915 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 14:59:26,915 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 14:59:26,916 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 14:59:26,916 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 14:59:26,916 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 14:59:26,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:26,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:26,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:26,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:26,940 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:26,940 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:26,940 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 14:59:26,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:26,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:26,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:26,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:26,943 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:26,944 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:26,948 INFO L752 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 9#L553true assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 3#L553-2true call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 22#L558true assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 18#L558-2true call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 23#L563true assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 19#L563-2true call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 26#L568true assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 25#L568-2true call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 14#L573true assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 7#L573-2true call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 11#L578true assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 15#L578-2true call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 20#L583true assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 24#L583-2true call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 17#L588true assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 6#L588-2true call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 8#L593true assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 16#L598-4true [2022-07-14 14:59:26,949 INFO L754 eck$LassoCheckResult]: Loop: 16#L598-4true call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 12#L598true assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 21#L598-2true assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 16#L598-4true [2022-07-14 14:59:26,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:26,953 INFO L85 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2022-07-14 14:59:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:26,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009593649] [2022-07-14 14:59:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:26,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:27,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:27,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009593649] [2022-07-14 14:59:27,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009593649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:27,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:27,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 14:59:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600904566] [2022-07-14 14:59:27,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:27,319 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:27,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2022-07-14 14:59:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:27,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284783395] [2022-07-14 14:59:27,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:27,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:27,344 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:27,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:27,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 14:59:27,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-14 14:59:27,608 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:27,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:27,979 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-07-14 14:59:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 14:59:27,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 112 transitions. [2022-07-14 14:59:27,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:28,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 66 states and 92 transitions. [2022-07-14 14:59:28,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-14 14:59:28,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-14 14:59:28,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2022-07-14 14:59:28,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:28,002 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 92 transitions. [2022-07-14 14:59:28,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2022-07-14 14:59:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 34. [2022-07-14 14:59:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-07-14 14:59:28,023 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-07-14 14:59:28,023 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-07-14 14:59:28,023 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 14:59:28,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2022-07-14 14:59:28,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:28,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:28,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:28,027 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:28,027 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:28,027 INFO L752 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 146#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 151#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 155#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 144#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 145#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 147#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 148#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 162#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 134#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 135#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 150#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 136#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 137#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 153#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 142#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 143#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 149#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 138#L598-4 [2022-07-14 14:59:28,027 INFO L754 eck$LassoCheckResult]: Loop: 138#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 139#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 154#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 138#L598-4 [2022-07-14 14:59:28,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1775784008, now seen corresponding path program 1 times [2022-07-14 14:59:28,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:28,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927234777] [2022-07-14 14:59:28,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:28,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:28,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:28,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927234777] [2022-07-14 14:59:28,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927234777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:28,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:28,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:59:28,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256917941] [2022-07-14 14:59:28,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:28,108 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:28,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2022-07-14 14:59:28,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:28,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258193945] [2022-07-14 14:59:28,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:28,137 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:28,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:28,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:59:28,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:59:28,339 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:28,378 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-07-14 14:59:28,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:59:28,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2022-07-14 14:59:28,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:28,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 45 transitions. [2022-07-14 14:59:28,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-07-14 14:59:28,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-07-14 14:59:28,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 45 transitions. [2022-07-14 14:59:28,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:28,380 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-07-14 14:59:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 45 transitions. [2022-07-14 14:59:28,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-14 14:59:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-07-14 14:59:28,382 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-07-14 14:59:28,382 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-07-14 14:59:28,382 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 14:59:28,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2022-07-14 14:59:28,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:28,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:28,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:28,383 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:28,383 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:28,384 INFO L752 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 224#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 229#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 242#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 241#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 240#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 238#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 236#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 237#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 239#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 212#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 235#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 232#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 234#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 230#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 218#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 219#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 227#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 216#L598-4 [2022-07-14 14:59:28,384 INFO L754 eck$LassoCheckResult]: Loop: 216#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 217#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 231#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 216#L598-4 [2022-07-14 14:59:28,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1239319610, now seen corresponding path program 1 times [2022-07-14 14:59:28,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:28,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569434680] [2022-07-14 14:59:28,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:28,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:28,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:28,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569434680] [2022-07-14 14:59:28,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569434680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:28,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:28,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 14:59:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789013100] [2022-07-14 14:59:28,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:28,471 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:28,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:28,472 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2022-07-14 14:59:28,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:28,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663045509] [2022-07-14 14:59:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:28,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:28,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:28,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:28,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 14:59:28,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 14:59:28,690 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 12 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:28,804 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-07-14 14:59:28,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:59:28,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2022-07-14 14:59:28,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:28,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2022-07-14 14:59:28,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-07-14 14:59:28,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-07-14 14:59:28,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2022-07-14 14:59:28,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:28,807 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 63 transitions. [2022-07-14 14:59:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2022-07-14 14:59:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-07-14 14:59:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-07-14 14:59:28,808 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-14 14:59:28,808 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-14 14:59:28,809 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 14:59:28,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2022-07-14 14:59:28,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:28,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:28,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:28,809 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:28,809 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:28,810 INFO L752 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 318#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 312#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 313#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 334#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 332#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 319#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 320#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 330#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 306#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 307#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 322#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 328#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 331#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 324#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 314#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 315#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 321#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 310#L598-4 [2022-07-14 14:59:28,810 INFO L754 eck$LassoCheckResult]: Loop: 310#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 311#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 325#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 310#L598-4 [2022-07-14 14:59:28,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:28,810 INFO L85 PathProgramCache]: Analyzing trace with hash -652513596, now seen corresponding path program 1 times [2022-07-14 14:59:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:28,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708542552] [2022-07-14 14:59:28,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:28,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:28,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708542552] [2022-07-14 14:59:28,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708542552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:28,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:28,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 14:59:28,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109512935] [2022-07-14 14:59:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:28,898 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:28,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:28,899 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2022-07-14 14:59:28,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:28,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947073304] [2022-07-14 14:59:28,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:28,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:28,921 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:28,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:29,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 14:59:29,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-14 14:59:29,065 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:29,170 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-07-14 14:59:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:59:29,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2022-07-14 14:59:29,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:29,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2022-07-14 14:59:29,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-14 14:59:29,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-14 14:59:29,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2022-07-14 14:59:29,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:29,173 INFO L369 hiAutomatonCegarLoop]: Abstraction has 45 states and 59 transitions. [2022-07-14 14:59:29,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2022-07-14 14:59:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-07-14 14:59:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-07-14 14:59:29,175 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-14 14:59:29,175 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-14 14:59:29,175 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 14:59:29,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-07-14 14:59:29,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:29,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:29,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:29,175 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:29,175 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:29,176 INFO L752 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 396#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 410#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 406#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 407#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 418#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 420#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 411#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 412#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 426#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 425#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 400#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 424#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 419#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 423#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 417#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 404#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 405#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 413#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 397#L598-4 [2022-07-14 14:59:29,176 INFO L754 eck$LassoCheckResult]: Loop: 397#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 398#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 416#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 397#L598-4 [2022-07-14 14:59:29,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:29,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1353578174, now seen corresponding path program 1 times [2022-07-14 14:59:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:29,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519048456] [2022-07-14 14:59:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:29,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:29,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:29,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519048456] [2022-07-14 14:59:29,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519048456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:29,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:29,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 14:59:29,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26328735] [2022-07-14 14:59:29,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:29,261 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2022-07-14 14:59:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:29,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223925792] [2022-07-14 14:59:29,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:29,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:29,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:29,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:29,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:29,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 14:59:29,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:59:29,449 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:29,550 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-14 14:59:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:59:29,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-07-14 14:59:29,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:29,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2022-07-14 14:59:29,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-14 14:59:29,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-14 14:59:29,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2022-07-14 14:59:29,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:29,552 INFO L369 hiAutomatonCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-07-14 14:59:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2022-07-14 14:59:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-07-14 14:59:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-07-14 14:59:29,554 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-14 14:59:29,554 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-14 14:59:29,554 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 14:59:29,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2022-07-14 14:59:29,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:29,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:29,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:29,555 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:29,555 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:29,555 INFO L752 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 485#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 500#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 504#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 515#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 514#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 512#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 513#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 517#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 516#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 486#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 487#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 511#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 507#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 510#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 505#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 492#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 493#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 501#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 490#L598-4 [2022-07-14 14:59:29,555 INFO L754 eck$LassoCheckResult]: Loop: 490#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 491#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 506#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 490#L598-4 [2022-07-14 14:59:29,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:29,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2033636544, now seen corresponding path program 1 times [2022-07-14 14:59:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:29,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191433788] [2022-07-14 14:59:29,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:29,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:29,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191433788] [2022-07-14 14:59:29,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191433788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:29,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:29,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 14:59:29,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22163860] [2022-07-14 14:59:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:29,627 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2022-07-14 14:59:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:29,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47899252] [2022-07-14 14:59:29,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:29,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:29,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:29,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:29,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:29,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:59:29,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:59:29,775 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:29,868 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-07-14 14:59:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 14:59:29,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 67 transitions. [2022-07-14 14:59:29,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:29,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 67 transitions. [2022-07-14 14:59:29,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-07-14 14:59:29,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-07-14 14:59:29,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 67 transitions. [2022-07-14 14:59:29,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:29,870 INFO L369 hiAutomatonCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-07-14 14:59:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 67 transitions. [2022-07-14 14:59:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-07-14 14:59:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-14 14:59:29,872 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-14 14:59:29,872 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-14 14:59:29,872 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 14:59:29,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2022-07-14 14:59:29,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:29,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:29,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:29,873 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:29,874 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:29,874 INFO L752 eck$LassoCheckResult]: Stem: 581#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 595#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 600#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 604#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 593#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 594#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 596#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 597#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 611#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 583#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 584#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 599#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 585#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 586#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 602#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 591#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 592#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 598#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 587#L598-4 [2022-07-14 14:59:29,874 INFO L754 eck$LassoCheckResult]: Loop: 587#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 588#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 603#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 587#L598-4 [2022-07-14 14:59:29,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:29,874 INFO L85 PathProgramCache]: Analyzing trace with hash 486323390, now seen corresponding path program 1 times [2022-07-14 14:59:29,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:29,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450444515] [2022-07-14 14:59:29,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:29,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:29,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:29,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450444515] [2022-07-14 14:59:29,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450444515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:29,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:29,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 14:59:29,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883070486] [2022-07-14 14:59:29,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:29,977 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2022-07-14 14:59:29,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:29,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150225720] [2022-07-14 14:59:29,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:29,984 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:29,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:30,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:30,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 14:59:30,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-14 14:59:30,118 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:30,207 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-07-14 14:59:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 14:59:30,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2022-07-14 14:59:30,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:30,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 59 transitions. [2022-07-14 14:59:30,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2022-07-14 14:59:30,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2022-07-14 14:59:30,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 59 transitions. [2022-07-14 14:59:30,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:30,209 INFO L369 hiAutomatonCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-07-14 14:59:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 59 transitions. [2022-07-14 14:59:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-07-14 14:59:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-07-14 14:59:30,211 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-07-14 14:59:30,211 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-07-14 14:59:30,211 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 14:59:30,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2022-07-14 14:59:30,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:30,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:30,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:30,212 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:30,212 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:30,212 INFO L752 eck$LassoCheckResult]: Stem: 681#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 682#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 697#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 700#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 720#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 719#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 718#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 717#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 716#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 715#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 683#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 684#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 699#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 685#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 686#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 701#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 689#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 690#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 698#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 687#L598-4 [2022-07-14 14:59:30,212 INFO L754 eck$LassoCheckResult]: Loop: 687#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 688#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 702#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 687#L598-4 [2022-07-14 14:59:30,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:30,213 INFO L85 PathProgramCache]: Analyzing trace with hash 486321468, now seen corresponding path program 1 times [2022-07-14 14:59:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:30,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947027126] [2022-07-14 14:59:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:30,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:30,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:30,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947027126] [2022-07-14 14:59:30,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947027126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:30,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:30,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:59:30,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623790962] [2022-07-14 14:59:30,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:30,274 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:30,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2022-07-14 14:59:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:30,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133660166] [2022-07-14 14:59:30,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:30,283 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:30,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:30,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:59:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:59:30,438 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 9 Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:30,496 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-07-14 14:59:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:59:30,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2022-07-14 14:59:30,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:30,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 54 transitions. [2022-07-14 14:59:30,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-14 14:59:30,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-14 14:59:30,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2022-07-14 14:59:30,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:30,500 INFO L369 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-07-14 14:59:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2022-07-14 14:59:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-14 14:59:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-07-14 14:59:30,501 INFO L392 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-07-14 14:59:30,501 INFO L374 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-07-14 14:59:30,501 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 14:59:30,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2022-07-14 14:59:30,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:30,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:30,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:30,502 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:30,502 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:30,502 INFO L752 eck$LassoCheckResult]: Stem: 774#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 788#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 782#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 783#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 786#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 787#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 789#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 790#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 800#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 778#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 779#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 793#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 780#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 781#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 797#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 784#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 785#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 794#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 776#L598-4 [2022-07-14 14:59:30,502 INFO L754 eck$LassoCheckResult]: Loop: 776#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 777#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 796#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 776#L598-4 [2022-07-14 14:59:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:30,503 INFO L85 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2022-07-14 14:59:30,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:30,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030537588] [2022-07-14 14:59:30,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:30,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:30,525 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:30,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:30,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:30,539 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2022-07-14 14:59:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:30,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376411338] [2022-07-14 14:59:30,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:30,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:30,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:30,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2022-07-14 14:59:30,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:30,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137900145] [2022-07-14 14:59:30,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:30,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:30,604 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:30,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:35,221 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:59:35,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:59:35,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:59:35,221 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:59:35,221 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:59:35,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:35,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:59:35,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:59:35,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration9_Lasso [2022-07-14 14:59:35,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:59:35,222 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:59:35,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:35,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:36,178 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:59:36,182 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:59:36,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 14:59:36,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 14:59:36,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 14:59:36,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,310 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 14:59:36,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 14:59:36,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 14:59:36,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,413 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 14:59:36,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 14:59:36,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:36,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:36,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,475 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 14:59:36,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,503 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 14:59:36,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,534 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 14:59:36,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-14 14:59:36,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 14:59:36,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-14 14:59:36,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,586 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 14:59:36,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,611 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-14 14:59:36,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,639 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-14 14:59:36,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 [2022-07-14 14:59:36,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,663 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 14:59:36,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:36,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:36,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,692 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 14:59:36,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,715 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-14 14:59:36,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,741 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-14 14:59:36,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,765 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-14 14:59:36,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,800 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-14 14:59:36,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-14 14:59:36,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,824 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 14:59:36,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-14 14:59:36,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,870 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 14:59:36,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-14 14:59:36,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,898 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-14 14:59:36,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:36,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,924 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-14 14:59:36,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,948 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 [2022-07-14 14:59:36,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,949 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-14 14:59:36,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:36,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-14 14:59:36,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:36,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:36,978 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:36,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-14 14:59:36,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:36,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:36,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:36,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:36,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:36,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:36,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:36,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:36,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-14 14:59:37,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,003 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-14 14:59:37,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:37,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:37,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:37,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-14 14:59:37,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,034 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-14 14:59:37,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:37,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:37,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-14 14:59:37,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,071 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-14 14:59:37,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:37,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:37,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:37,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-14 14:59:37,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,103 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-14 14:59:37,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:59:37,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:59:37,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:59:37,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-14 14:59:37,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,127 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-14 14:59:37,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:37,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:37,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-14 14:59:37,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,166 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-14 14:59:37,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:37,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:37,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-14 14:59:37,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,198 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-14 14:59:37,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:37,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:37,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:37,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,238 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-14 14:59:37,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:37,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:37,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:37,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,301 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-14 14:59:37,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:37,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:37,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-14 14:59:37,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,345 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-14 14:59:37,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:37,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:37,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:37,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,405 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-14 14:59:37,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:37,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:37,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-14 14:59:37,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,449 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-14 14:59:37,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:37,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:37,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:37,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-14 14:59:37,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,479 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-14 14:59:37,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:37,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:37,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:37,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:37,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:37,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:37,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:37,503 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:59:37,531 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-14 14:59:37,531 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:59:37,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:37,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:37,533 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:37,564 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:59:37,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-14 14:59:37,582 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-14 14:59:37,582 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:59:37,583 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_1 + 100 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 - 2 >= 0] [2022-07-14 14:59:37,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:37,722 INFO L293 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2022-07-14 14:59:37,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:37,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-14 14:59:37,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:37,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-14 14:59:37,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 14:59:37,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 14:59:37,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 14:59:38,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 14:59:38,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 14:59:38,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 14:59:38,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 14:59:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:38,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 14:59:38,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:38,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:38,286 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 3 loop predicates [2022-07-14 14:59:38,287 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:38,532 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 9. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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) Result 57 states and 69 transitions. Complement of second has 17 states. [2022-07-14 14:59:38,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2022-07-14 14:59:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-07-14 14:59:38,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 19 letters. Loop has 3 letters. [2022-07-14 14:59:38,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:38,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 22 letters. Loop has 3 letters. [2022-07-14 14:59:38,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:38,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 19 letters. Loop has 6 letters. [2022-07-14 14:59:38,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:38,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 69 transitions. [2022-07-14 14:59:38,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 14:59:38,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 33 states and 42 transitions. [2022-07-14 14:59:38,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-14 14:59:38,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-07-14 14:59:38,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2022-07-14 14:59:38,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:38,537 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-07-14 14:59:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2022-07-14 14:59:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-14 14:59:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-14 14:59:38,539 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-14 14:59:38,539 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-14 14:59:38,539 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 14:59:38,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2022-07-14 14:59:38,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:38,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:38,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:38,539 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:38,539 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:38,539 INFO L752 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1178#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1172#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1173#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1174#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1175#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1176#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1177#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1185#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1164#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 1165#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1180#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1167#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1168#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 1184#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1169#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 1170#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1181#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1162#L598-4 [2022-07-14 14:59:38,539 INFO L754 eck$LassoCheckResult]: Loop: 1162#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1163#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1182#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1162#L598-4 [2022-07-14 14:59:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:38,540 INFO L85 PathProgramCache]: Analyzing trace with hash -492624188, now seen corresponding path program 1 times [2022-07-14 14:59:38,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:38,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283893973] [2022-07-14 14:59:38,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:38,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:38,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:38,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283893973] [2022-07-14 14:59:38,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283893973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:38,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:38,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 14:59:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715980578] [2022-07-14 14:59:38,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:38,654 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:38,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2022-07-14 14:59:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:38,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112247115] [2022-07-14 14:59:38,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:38,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:38,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:38,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 14:59:38,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-14 14:59:38,795 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 8 Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:38,891 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-07-14 14:59:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:59:38,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2022-07-14 14:59:38,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:38,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2022-07-14 14:59:38,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-07-14 14:59:38,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-07-14 14:59:38,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2022-07-14 14:59:38,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:38,892 INFO L369 hiAutomatonCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-07-14 14:59:38,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2022-07-14 14:59:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2022-07-14 14:59:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-07-14 14:59:38,894 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-07-14 14:59:38,894 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-07-14 14:59:38,894 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-14 14:59:38,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2022-07-14 14:59:38,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:38,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:38,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:38,894 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:38,894 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:38,894 INFO L752 eck$LassoCheckResult]: Stem: 1243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1244#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1258#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1254#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1255#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1256#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1257#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1259#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1260#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1267#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1249#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 1250#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1263#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 1266#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1268#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 1264#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1251#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 1252#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1262#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1247#L598-4 [2022-07-14 14:59:38,894 INFO L754 eck$LassoCheckResult]: Loop: 1247#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1248#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1265#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1247#L598-4 [2022-07-14 14:59:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:38,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1587573180, now seen corresponding path program 1 times [2022-07-14 14:59:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:38,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177288507] [2022-07-14 14:59:38,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:38,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:38,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:38,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177288507] [2022-07-14 14:59:38,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177288507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:38,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:38,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 14:59:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635634574] [2022-07-14 14:59:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:38,964 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:38,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:38,965 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2022-07-14 14:59:38,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:38,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319543533] [2022-07-14 14:59:38,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:38,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:38,972 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:38,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:39,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 14:59:39,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 14:59:39,092 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 6 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:39,203 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-14 14:59:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 14:59:39,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2022-07-14 14:59:39,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:39,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2022-07-14 14:59:39,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-07-14 14:59:39,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-07-14 14:59:39,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2022-07-14 14:59:39,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:39,204 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-14 14:59:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2022-07-14 14:59:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2022-07-14 14:59:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-14 14:59:39,205 INFO L392 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-14 14:59:39,206 INFO L374 stractBuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-14 14:59:39,206 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-14 14:59:39,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2022-07-14 14:59:39,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:39,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:39,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:39,206 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:39,206 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:39,206 INFO L752 eck$LassoCheckResult]: Stem: 1321#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1336#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1329#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1330#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1334#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1335#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1337#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1338#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1344#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1323#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 1324#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1340#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1325#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1326#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 1342#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1331#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 1332#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1341#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1327#L598-4 [2022-07-14 14:59:39,206 INFO L754 eck$LassoCheckResult]: Loop: 1327#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1328#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1343#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1327#L598-4 [2022-07-14 14:59:39,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:39,207 INFO L85 PathProgramCache]: Analyzing trace with hash 189281224, now seen corresponding path program 1 times [2022-07-14 14:59:39,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:39,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477704701] [2022-07-14 14:59:39,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:39,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:39,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:39,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477704701] [2022-07-14 14:59:39,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477704701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:39,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:39,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-14 14:59:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113256544] [2022-07-14 14:59:39,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:39,332 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:39,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2022-07-14 14:59:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:39,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21735636] [2022-07-14 14:59:39,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:39,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:39,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:39,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:39,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:39,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 14:59:39,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-07-14 14:59:39,483 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 4 Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:39,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:39,558 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-07-14 14:59:39,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 14:59:39,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2022-07-14 14:59:39,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:39,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2022-07-14 14:59:39,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-14 14:59:39,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-07-14 14:59:39,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2022-07-14 14:59:39,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:39,561 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-14 14:59:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2022-07-14 14:59:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-07-14 14:59:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-14 14:59:39,563 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-14 14:59:39,563 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-14 14:59:39,563 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-14 14:59:39,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2022-07-14 14:59:39,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:39,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:39,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:39,564 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:39,564 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:39,564 INFO L752 eck$LassoCheckResult]: Stem: 1390#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1404#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1398#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1399#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1402#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1403#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1405#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1406#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1411#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1392#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 1393#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1408#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1394#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1395#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 1409#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1400#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 1401#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1407#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 1396#L598-4 [2022-07-14 14:59:39,564 INFO L754 eck$LassoCheckResult]: Loop: 1396#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1397#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1410#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1396#L598-4 [2022-07-14 14:59:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2022-07-14 14:59:39,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:39,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880522767] [2022-07-14 14:59:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:39,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:39,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:39,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2022-07-14 14:59:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:39,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234380945] [2022-07-14 14:59:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:39,598 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:39,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:39,603 INFO L85 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2022-07-14 14:59:39,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:39,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957634116] [2022-07-14 14:59:39,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:39,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:39,641 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:39,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:43,980 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:59:43,981 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:59:43,981 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:59:43,981 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:59:43,981 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:59:43,981 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:43,981 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:59:43,981 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:59:43,981 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration13_Lasso [2022-07-14 14:59:43,981 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:59:43,981 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:59:43,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:59:44,853 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:59:44,854 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:59:44,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:44,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:44,855 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:44,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-14 14:59:44,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:44,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:44,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:44,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:44,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:44,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:44,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:44,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:44,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-14 14:59:44,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:44,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:44,882 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:44,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-14 14:59:44,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:44,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:44,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:44,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:44,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:44,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:44,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:44,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:44,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:44,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:44,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:44,921 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:44,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-14 14:59:44,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:44,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:44,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:44,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:44,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:44,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:44,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:44,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:44,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-14 14:59:44,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:44,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:44,948 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:44,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-14 14:59:44,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:44,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:44,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:44,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:44,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:44,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:44,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:44,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:44,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-14 14:59:44,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:44,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:44,977 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:44,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-14 14:59:44,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 [2022-07-14 14:59:44,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:44,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:44,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:44,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:44,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:44,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:44,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:45,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:45,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:45,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:45,003 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:45,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-14 14:59:45,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:45,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:45,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:45,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:45,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:45,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:45,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:45,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:45,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-14 14:59:45,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:45,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:45,044 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:45,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-14 14:59:45,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:45,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:45,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:45,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:45,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:45,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:45,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:45,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:45,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:45,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:45,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:45,085 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:45,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-14 14:59:45,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:45,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:45,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:45,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:45,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:45,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:45,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:45,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:45,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:45,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:45,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:45,124 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:45,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-14 14:59:45,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:45,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:45,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:45,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:45,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:45,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:45,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:45,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:59:45,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:45,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:45,164 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:45,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-14 14:59:45,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:59:45,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:59:45,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:59:45,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:59:45,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:59:45,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:59:45,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:59:45,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:59:45,189 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-14 14:59:45,189 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:59:45,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:59:45,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:59:45,190 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:59:45,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-14 14:59:45,192 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:59:45,198 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-14 14:59:45,198 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:59:45,198 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0#1.base) ULTIMATE.start_main_~z~0#1.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0#1.base) ULTIMATE.start_main_~z~0#1.offset)_2 + 100 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 - 2 >= 0] [2022-07-14 14:59:45,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:45,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-14 14:59:45,331 INFO L293 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2022-07-14 14:59:45,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:45,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-14 14:59:45,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:45,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-14 14:59:45,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 14:59:45,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-14 14:59:45,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-14 14:59:45,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-14 14:59:45,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-14 14:59:45,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-14 14:59:45,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-14 14:59:45,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-14 14:59:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:45,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 14:59:45,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:59:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:45,793 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2022-07-14 14:59:45,793 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:45,934 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 3. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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) Result 28 states and 33 transitions. Complement of second has 15 states. [2022-07-14 14:59:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 14:59:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2022-07-14 14:59:45,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 3 letters. [2022-07-14 14:59:45,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:45,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 22 letters. Loop has 3 letters. [2022-07-14 14:59:45,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:45,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 6 letters. [2022-07-14 14:59:45,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:59:45,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2022-07-14 14:59:45,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:45,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 23 transitions. [2022-07-14 14:59:45,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-14 14:59:45,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-07-14 14:59:45,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2022-07-14 14:59:45,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:45,937 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-14 14:59:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2022-07-14 14:59:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-14 14:59:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-07-14 14:59:45,937 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-14 14:59:45,938 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-14 14:59:45,938 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-14 14:59:45,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2022-07-14 14:59:45,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:59:45,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:59:45,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:59:45,938 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:59:45,938 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:59:45,938 INFO L752 eck$LassoCheckResult]: Stem: 1720#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1721#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1734#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1728#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1729#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1732#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1733#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1735#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1736#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1741#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1724#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 1725#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1738#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1726#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1727#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 1740#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1730#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 1731#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1737#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1722#L598-4 [2022-07-14 14:59:45,938 INFO L754 eck$LassoCheckResult]: Loop: 1722#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1723#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1739#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1722#L598-4 [2022-07-14 14:59:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2022-07-14 14:59:45,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:45,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115891177] [2022-07-14 14:59:45,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:45,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:59:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:59:46,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:59:46,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115891177] [2022-07-14 14:59:46,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115891177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:59:46,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:59:46,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-14 14:59:46,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797139184] [2022-07-14 14:59:46,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:59:46,085 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:59:46,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:59:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 14 times [2022-07-14 14:59:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:59:46,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939204029] [2022-07-14 14:59:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:59:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:59:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:46,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:59:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:59:46,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:59:46,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:59:46,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 14:59:46,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-07-14 14:59:46,214 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:59:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:59:46,261 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-07-14 14:59:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 14:59:46,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2022-07-14 14:59:46,262 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 14:59:46,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2022-07-14 14:59:46,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 14:59:46,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 14:59:46,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 14:59:46,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:59:46,262 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:59:46,262 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:59:46,262 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:59:46,262 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-14 14:59:46,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 14:59:46,262 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 14:59:46,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 14:59:46,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 02:59:46 BoogieIcfgContainer [2022-07-14 14:59:46,267 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 14:59:46,267 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 14:59:46,267 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 14:59:46,267 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 14:59:46,267 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:59:26" (3/4) ... [2022-07-14 14:59:46,269 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 14:59:46,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 14:59:46,269 INFO L158 Benchmark]: Toolchain (without parser) took 20255.09ms. Allocated memory was 104.9MB in the beginning and 232.8MB in the end (delta: 127.9MB). Free memory was 74.1MB in the beginning and 171.4MB in the end (delta: -97.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2022-07-14 14:59:46,270 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 61.9MB in the beginning and 61.9MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:59:46,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.31ms. Allocated memory was 104.9MB in the beginning and 146.8MB in the end (delta: 41.9MB). Free memory was 73.7MB in the beginning and 115.3MB in the end (delta: -41.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 14:59:46,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.62ms. Allocated memory is still 146.8MB. Free memory was 115.3MB in the beginning and 113.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:59:46,270 INFO L158 Benchmark]: Boogie Preprocessor took 39.60ms. Allocated memory is still 146.8MB. Free memory was 113.2MB in the beginning and 111.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:59:46,270 INFO L158 Benchmark]: RCFGBuilder took 410.39ms. Allocated memory is still 146.8MB. Free memory was 111.5MB in the beginning and 94.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-14 14:59:46,270 INFO L158 Benchmark]: BuchiAutomizer took 19400.19ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 94.7MB in the beginning and 171.4MB in the end (delta: -76.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2022-07-14 14:59:46,271 INFO L158 Benchmark]: Witness Printer took 2.09ms. Allocated memory is still 232.8MB. Free memory is still 171.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:59:46,274 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 61.9MB in the beginning and 61.9MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.31ms. Allocated memory was 104.9MB in the beginning and 146.8MB in the end (delta: 41.9MB). Free memory was 73.7MB in the beginning and 115.3MB in the end (delta: -41.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.62ms. Allocated memory is still 146.8MB. Free memory was 115.3MB in the beginning and 113.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.60ms. Allocated memory is still 146.8MB. Free memory was 113.2MB in the beginning and 111.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.39ms. Allocated memory is still 146.8MB. Free memory was 111.5MB in the beginning and 94.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 19400.19ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 94.7MB in the beginning and 171.4MB in the end (delta: -76.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Witness Printer took 2.09ms. Allocated memory is still 232.8MB. Free memory is still 171.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (12 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y][y] + 100 and consists of 14 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z][z] + 100 and consists of 13 locations. 12 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.3s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 16.4s. Construction of modules took 1.0s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 129 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 303 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 581 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 362 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2394 IncrementalHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 219 mSDtfsCounter, 2394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU12 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital332 mio100 ax105 hnf100 lsp89 ukn60 mio100 lsp35 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 14:59:46,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE