./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:57:20,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:57:20,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:57:20,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:57:20,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:57:20,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:57:20,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:57:20,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:57:20,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:57:20,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:57:20,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:57:20,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:57:20,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:57:20,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:57:20,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:57:20,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:57:20,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:57:20,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:57:20,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:57:20,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:57:20,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:57:20,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:57:20,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:57:20,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:57:20,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:57:20,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:57:20,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:57:20,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:57:20,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:57:20,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:57:20,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:57:20,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:57:20,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:57:20,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:57:20,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:57:20,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:57:20,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:57:20,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:57:20,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:57:20,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:57:20,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:57:20,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:57:20,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:57:20,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:57:20,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:57:20,624 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:57:20,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:57:20,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:57:20,625 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:57:20,625 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:57:20,626 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:57:20,626 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:57:20,626 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:57:20,627 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:57:20,627 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:57:20,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:57:20,627 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:57:20,627 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:57:20,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:57:20,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:57:20,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:57:20,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:57:20,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:57:20,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:57:20,628 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:57:20,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:57:20,629 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:57:20,629 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:57:20,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:57:20,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:57:20,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:57:20,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:57:20,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:57:20,630 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:57:20,631 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 [2022-02-21 03:57:20,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:57:20,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:57:20,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:57:20,952 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:57:20,952 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:57:20,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2022-02-21 03:57:21,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e8ad5c46/ff34dcf7a7684097bac365895d2d0447/FLAGc1d711a43 [2022-02-21 03:57:21,375 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:57:21,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2022-02-21 03:57:21,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e8ad5c46/ff34dcf7a7684097bac365895d2d0447/FLAGc1d711a43 [2022-02-21 03:57:21,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e8ad5c46/ff34dcf7a7684097bac365895d2d0447 [2022-02-21 03:57:21,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:57:21,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:57:21,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:21,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:57:21,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:57:21,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:21" (1/1) ... [2022-02-21 03:57:21,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505fbc7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:21, skipping insertion in model container [2022-02-21 03:57:21,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:21" (1/1) ... [2022-02-21 03:57:21,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:57:21,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:57:22,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:22,042 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:57:22,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:22,137 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:57:22,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22 WrapperNode [2022-02-21 03:57:22,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:22,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:22,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:57:22,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:57:22,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22" (1/1) ... [2022-02-21 03:57:22,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22" (1/1) ... [2022-02-21 03:57:22,215 INFO L137 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-02-21 03:57:22,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:22,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:57:22,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:57:22,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:57:22,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22" (1/1) ... [2022-02-21 03:57:22,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22" (1/1) ... [2022-02-21 03:57:22,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22" (1/1) ... [2022-02-21 03:57:22,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22" (1/1) ... [2022-02-21 03:57:22,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22" (1/1) ... [2022-02-21 03:57:22,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22" (1/1) ... [2022-02-21 03:57:22,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22" (1/1) ... [2022-02-21 03:57:22,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:57:22,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:57:22,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:57:22,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:57:22,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22" (1/1) ... [2022-02-21 03:57:22,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:22,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:22,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:22,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:57:22,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:57:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:57:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:57:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 03:57:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 03:57:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:57:22,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-21 03:57:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:57:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:57:22,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:57:22,470 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:57:22,471 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:57:22,756 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:57:22,764 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:57:22,765 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:57:22,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:22 BoogieIcfgContainer [2022-02-21 03:57:22,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:57:22,767 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:57:22,768 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:57:22,770 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:57:22,770 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:22,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:57:21" (1/3) ... [2022-02-21 03:57:22,771 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@654b3430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:22, skipping insertion in model container [2022-02-21 03:57:22,771 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:22,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:22" (2/3) ... [2022-02-21 03:57:22,772 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@654b3430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:22, skipping insertion in model container [2022-02-21 03:57:22,772 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:22,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:22" (3/3) ... [2022-02-21 03:57:22,773 INFO L388 chiAutomizerObserver]: Analyzing ICFG test-0232_1-1.i [2022-02-21 03:57:22,813 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:57:22,813 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:57:22,813 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:57:22,813 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:57:22,813 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:57:22,813 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:57:22,813 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:57:22,813 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:57:22,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 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-02-21 03:57:22,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:57:22,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:22,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:22,846 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:57:22,846 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:57:22,847 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:57:22,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 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-02-21 03:57:22,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:57:22,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:22,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:22,851 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:57:22,851 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:57:22,856 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 16#L543-3true [2022-02-21 03:57:22,858 INFO L793 eck$LassoCheckResult]: Loop: 16#L543-3true assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 5#L534true assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 13#L534-2true call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 8#L529true assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 11#L543-1true assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 16#L543-3true [2022-02-21 03:57:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:57:22,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:22,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928742954] [2022-02-21 03:57:22,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:22,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:22,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:22,972 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:22,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2022-02-21 03:57:22,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:22,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860730854] [2022-02-21 03:57:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:22,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:23,045 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:23,075 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:23,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2022-02-21 03:57:23,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:23,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072236874] [2022-02-21 03:57:23,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:23,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {23#true} is VALID [2022-02-21 03:57:23,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {25#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-21 03:57:23,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {26#(and (= |ULTIMATE.start_append_#t~mem6#1.base| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| 0))} is VALID [2022-02-21 03:57:23,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#(and (= |ULTIMATE.start_append_#t~mem6#1.base| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| 0))} assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; {24#false} is VALID [2022-02-21 03:57:23,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {24#false} is VALID [2022-02-21 03:57:23,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#false} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {24#false} is VALID [2022-02-21 03:57:23,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {24#false} is VALID [2022-02-21 03:57:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:23,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:23,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072236874] [2022-02-21 03:57:23,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072236874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:23,217 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:23,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:57:23,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605873270] [2022-02-21 03:57:23,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:24,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:24,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:57:24,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:57:24,446 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:24,521 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-21 03:57:24,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:57:24,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:24,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:24,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2022-02-21 03:57:24,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:57:24,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2022-02-21 03:57:24,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:57:24,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:57:24,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-02-21 03:57:24,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:24,538 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-21 03:57:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-02-21 03:57:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2022-02-21 03:57:24,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:24,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:24,554 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:24,555 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:24,560 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:57:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:57:24,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:24,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:24,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 19 transitions. [2022-02-21 03:57:24,564 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 19 transitions. [2022-02-21 03:57:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:24,570 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:57:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:57:24,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:24,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:24,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:24,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:57:24,574 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:57:24,574 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:57:24,574 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:57:24,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:57:24,575 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:57:24,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:24,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:24,576 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:57:24,576 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:57:24,576 INFO L791 eck$LassoCheckResult]: Stem: 50#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 51#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 57#L543-3 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 52#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 48#L534-2 [2022-02-21 03:57:24,576 INFO L793 eck$LassoCheckResult]: Loop: 48#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 49#L529 assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 55#L543-1 assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 59#L543-3 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 60#L534 assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 48#L534-2 [2022-02-21 03:57:24,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2022-02-21 03:57:24,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:24,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362471792] [2022-02-21 03:57:24,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:24,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:24,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:24,629 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2022-02-21 03:57:24,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:24,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700906906] [2022-02-21 03:57:24,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:24,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:24,651 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:24,663 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2022-02-21 03:57:24,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:24,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972271016] [2022-02-21 03:57:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:24,733 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:24,760 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:26,562 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:26,562 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:26,562 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:26,562 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:26,562 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:26,562 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:26,562 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:26,562 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:26,562 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration2_Lasso [2022-02-21 03:57:26,562 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:26,563 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:26,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:26,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:26,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:26,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:26,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:26,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:26,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:26,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:26,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:26,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:26,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:26,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:27,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:29,078 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:57:29,081 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:57:29,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:29,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:57:29,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-02-21 03:57:29,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:29,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:29,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:29,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:29,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:29,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:57:29,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:29,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:29,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:29,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:29,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:57:29,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:29,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:29,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:29,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:29,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:29,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:57:29,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:29,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:29,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:29,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:29,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:29,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:57:29,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:29,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:29,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:29,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:57:29,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:29,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:57:29,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:29,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:29,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:57:29,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,342 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:29,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:57:29,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:29,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:29,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:29,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:57:29,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,383 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:29,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:57:29,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:29,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:29,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:29,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:57:29,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,426 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-02-21 03:57:29,427 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-02-21 03:57:29,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:29,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:29,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:29,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:57:29,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,454 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-02-21 03:57:29,455 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-02-21 03:57:29,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:29,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:29,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:57:29,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,484 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-02-21 03:57:29,485 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-02-21 03:57:29,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:29,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:29,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:29,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:29,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,533 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-02-21 03:57:29,534 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-02-21 03:57:29,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-02-21 03:57:29,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:29,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:29,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,570 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-02-21 03:57:29,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,573 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-02-21 03:57:29,574 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-02-21 03:57:29,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:29,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:29,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,622 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-02-21 03:57:29,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,624 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-02-21 03:57:29,625 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-02-21 03:57:29,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:29,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:29,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,663 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-02-21 03:57:29,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,665 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-02-21 03:57:29,666 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-02-21 03:57:29,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:29,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:29,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:57:29,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,701 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-02-21 03:57:29,702 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-02-21 03:57:29,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:29,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:29,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:29,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,738 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-02-21 03:57:29,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,740 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-02-21 03:57:29,741 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-02-21 03:57:29,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-02-21 03:57:29,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:29,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:29,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,783 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-02-21 03:57:29,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,785 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-02-21 03:57:29,787 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-02-21 03:57:29,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:29,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:29,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,842 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-02-21 03:57:29,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,844 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-02-21 03:57:29,846 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-02-21 03:57:29,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:29,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:29,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 03:57:29,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,882 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-02-21 03:57:29,883 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-02-21 03:57:29,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:29,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:29,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:29,939 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-02-21 03:57:29,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:29,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:29,956 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-02-21 03:57:29,972 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-02-21 03:57:29,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:29,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:29,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:29,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:29,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:29,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:29,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:29,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:29,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:30,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,024 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-02-21 03:57:30,026 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-02-21 03:57:30,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:30,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:30,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:30,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,100 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-02-21 03:57:30,101 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-02-21 03:57:30,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,109 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:57:30,109 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 03:57:30,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,216 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2022-02-21 03:57:30,216 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2022-02-21 03:57:30,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,423 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-02-21 03:57:30,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,425 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-02-21 03:57:30,426 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-02-21 03:57:30,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:30,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:30,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,467 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-02-21 03:57:30,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,468 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-02-21 03:57:30,469 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-02-21 03:57:30,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:30,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:30,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:30,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,512 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-02-21 03:57:30,527 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-02-21 03:57:30,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:30,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:30,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:30,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,569 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-02-21 03:57:30,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:30,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:30,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:30,597 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-02-21 03:57:30,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:30,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,638 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-02-21 03:57:30,641 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-02-21 03:57:30,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:30,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:30,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:30,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:30,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,682 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-02-21 03:57:30,682 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-02-21 03:57:30,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:30,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:30,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:30,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,728 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-02-21 03:57:30,729 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-02-21 03:57:30,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:30,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:30,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:30,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,770 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-02-21 03:57:30,771 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-02-21 03:57:30,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:30,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:30,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:30,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:30,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,833 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-02-21 03:57:30,834 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-02-21 03:57:30,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:30,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:30,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:30,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:30,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,890 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-02-21 03:57:30,908 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-02-21 03:57:30,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:30,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:30,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:30,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:30,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,952 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-02-21 03:57:30,952 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-02-21 03:57:30,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:30,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:30,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:30,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:30,979 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-02-21 03:57:30,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,981 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-02-21 03:57:30,981 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-02-21 03:57:30,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:30,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:30,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:30,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:30,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:30,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:30,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:30,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:30,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:31,006 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-02-21 03:57:31,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:31,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:31,007 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-02-21 03:57:31,008 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-02-21 03:57:31,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:31,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:31,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:31,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:31,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:31,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:31,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:31,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:57:31,081 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:57:31,081 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-02-21 03:57:31,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:31,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:31,107 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-02-21 03:57:31,132 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:57:31,140 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-02-21 03:57:31,150 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:57:31,150 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:57:31,150 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2022-02-21 03:57:31,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:31,244 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2022-02-21 03:57:31,249 INFO L390 LassoCheck]: Loop: "call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4);" "assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" "assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1;" "assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4);" "assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset;" [2022-02-21 03:57:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:31,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:57:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:31,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:31,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {100#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {100#unseeded} is VALID [2022-02-21 03:57:31,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {100#unseeded} is VALID [2022-02-21 03:57:31,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#unseeded} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {100#unseeded} is VALID [2022-02-21 03:57:31,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {100#unseeded} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {100#unseeded} is VALID [2022-02-21 03:57:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:31,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:57:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:31,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:31,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#(>= oldRank0 (+ 39 (* (- 2) ~c~0)))} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {103#(>= oldRank0 (+ 39 (* (- 2) ~c~0)))} is VALID [2022-02-21 03:57:31,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#(>= oldRank0 (+ 39 (* (- 2) ~c~0)))} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {103#(>= oldRank0 (+ 39 (* (- 2) ~c~0)))} is VALID [2022-02-21 03:57:31,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {103#(>= oldRank0 (+ 39 (* (- 2) ~c~0)))} assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {193#(and (>= oldRank0 (+ 39 (* (- 2) ~c~0))) (< ~c~0 20))} is VALID [2022-02-21 03:57:31,417 INFO L290 TraceCheckUtils]: 3: Hoare triple {193#(and (>= oldRank0 (+ 39 (* (- 2) ~c~0))) (< ~c~0 20))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {197#(and (<= (+ (div (+ oldRank0 (- 39)) (- 2)) 1) ~c~0) (< (div (+ oldRank0 (- 39)) (- 2)) 20))} is VALID [2022-02-21 03:57:31,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {197#(and (<= (+ (div (+ oldRank0 (- 39)) (- 2)) 1) ~c~0) (< (div (+ oldRank0 (- 39)) (- 2)) 20))} assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; {173#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 39 (* (- 2) ~c~0)))))} is VALID [2022-02-21 03:57:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:31,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-02-21 03:57:31,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:31,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:57:31,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,430 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:57:31,430 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-02-21 03:57:31,498 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 23 states and 32 transitions. Complement of second has 6 states. [2022-02-21 03:57:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:57:31,498 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:31,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2022-02-21 03:57:31,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:31,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:31,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-02-21 03:57:31,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:57:31,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:31,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:31,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2022-02-21 03:57:31,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:57:31,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:31,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:31,504 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2022-02-21 03:57:31,506 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:57:31,506 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-02-21 03:57:31,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:57:31,508 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:57:31,508 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 32 transitions. cyclomatic complexity: 12 [2022-02-21 03:57:31,508 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:57:31,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:57:31,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:57:31,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:57:31,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:57:31,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:57:31,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:57:31,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:57:31,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:57:31,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:57:31,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:57:31,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:57:31,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:57:31,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:57:31,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:57:31,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:57:31,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:31,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:31,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:31,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:57:31,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:57:31,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:57:31,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:57:31,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:57:31,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:57:31,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:31,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:31,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:31,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:57:31,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:57:31,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:57:31,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:57:31,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:57:31,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:57:31,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:31,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:31,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:31,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:57:31,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:57:31,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:57:31,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:57:31,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:57:31,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:57:31,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,519 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-02-21 03:57:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:57:31,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:57:31,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:31,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 10 letters. [2022-02-21 03:57:31,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:31,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. cyclomatic complexity: 12 [2022-02-21 03:57:31,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:57:31,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2022-02-21 03:57:31,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:57:31,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:57:31,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2022-02-21 03:57:31,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:57:31,525 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-02-21 03:57:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2022-02-21 03:57:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-02-21 03:57:31,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:31,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:31,528 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:31,528 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:31,528 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:31,531 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2022-02-21 03:57:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-02-21 03:57:31,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:31,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:31,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 24 transitions. [2022-02-21 03:57:31,531 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 24 transitions. [2022-02-21 03:57:31,531 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:31,532 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-21 03:57:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-21 03:57:31,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:31,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:31,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:31,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-02-21 03:57:31,537 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 03:57:31,537 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 03:57:31,537 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:57:31,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-02-21 03:57:31,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:57:31,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:31,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:31,540 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:31,540 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:57:31,540 INFO L791 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 238#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 247#L543-3 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 239#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 240#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 234#L529 assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 245#L543-1 assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 248#L543-4 assume !(main_~length~0#1 > 0); 244#L556-1 [2022-02-21 03:57:31,540 INFO L793 eck$LassoCheckResult]: Loop: 244#L556-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_#t~post22#1; 244#L556-1 [2022-02-21 03:57:31,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:31,540 INFO L85 PathProgramCache]: Analyzing trace with hash 149888859, now seen corresponding path program 1 times [2022-02-21 03:57:31,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:31,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403400818] [2022-02-21 03:57:31,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:31,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:31,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {333#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {333#true} is VALID [2022-02-21 03:57:31,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {333#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {335#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-21 03:57:31,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#(= |ULTIMATE.start_main_~length~0#1| 0)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {335#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-21 03:57:31,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {335#(= |ULTIMATE.start_main_~length~0#1| 0)} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {335#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-21 03:57:31,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {335#(= |ULTIMATE.start_main_~length~0#1| 0)} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {335#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-21 03:57:31,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {335#(= |ULTIMATE.start_main_~length~0#1| 0)} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {336#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:57:31,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {336#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {336#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:57:31,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {336#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~length~0#1 > 0); {334#false} is VALID [2022-02-21 03:57:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:31,618 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:31,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403400818] [2022-02-21 03:57:31,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403400818] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:31,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:31,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:57:31,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139052655] [2022-02-21 03:57:31,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:31,619 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:31,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:31,619 INFO L85 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2022-02-21 03:57:31,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:31,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771987391] [2022-02-21 03:57:31,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:31,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:31,625 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-02-21 03:57:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,632 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:31,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:31,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:57:31,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:57:31,817 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:31,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:31,876 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-21 03:57:31,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:57:31,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:31,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:31,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2022-02-21 03:57:31,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:57:31,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2022-02-21 03:57:31,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:57:31,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:57:31,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2022-02-21 03:57:31,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:57:31,893 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-21 03:57:31,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2022-02-21 03:57:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-02-21 03:57:31,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:31,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 23 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 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-02-21 03:57:31,894 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 23 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 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-02-21 03:57:31,894 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 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-02-21 03:57:31,894 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:31,895 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-21 03:57:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-21 03:57:31,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:31,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:31,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 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 19 states and 23 transitions. [2022-02-21 03:57:31,895 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 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 19 states and 23 transitions. [2022-02-21 03:57:31,895 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:31,896 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-21 03:57:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-21 03:57:31,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:31,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:31,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:31,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 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-02-21 03:57:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-02-21 03:57:31,897 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 03:57:31,897 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-21 03:57:31,897 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:57:31,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2022-02-21 03:57:31,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:57:31,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:31,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:31,898 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:31,898 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:57:31,898 INFO L791 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 363#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 372#L543-3 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 364#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 365#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 359#L529 assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 370#L543-1 assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 373#L543-4 assume main_~length~0#1 > 0; 367#L548 assume !(main_~length~0#1 < 0); 368#L548-2 call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_#t~post18#1; 369#L556-1 [2022-02-21 03:57:31,900 INFO L793 eck$LassoCheckResult]: Loop: 369#L556-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_#t~post22#1; 369#L556-1 [2022-02-21 03:57:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1985702188, now seen corresponding path program 1 times [2022-02-21 03:57:31,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:31,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698302989] [2022-02-21 03:57:31,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,925 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,942 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:31,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 2 times [2022-02-21 03:57:31,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:31,942 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391869444] [2022-02-21 03:57:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,947 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,950 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:31,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:31,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1427225639, now seen corresponding path program 1 times [2022-02-21 03:57:31,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:31,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941900403] [2022-02-21 03:57:31,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:31,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {463#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {463#true} is VALID [2022-02-21 03:57:31,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {465#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-21 03:57:31,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#(= |ULTIMATE.start_main_~length~0#1| 0)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {465#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-21 03:57:31,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {465#(= |ULTIMATE.start_main_~length~0#1| 0)} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {465#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-21 03:57:31,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {465#(= |ULTIMATE.start_main_~length~0#1| 0)} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {465#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-21 03:57:31,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#(= |ULTIMATE.start_main_~length~0#1| 0)} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {466#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:57:31,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#(<= |ULTIMATE.start_main_~length~0#1| 1)} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {466#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:57:31,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#(<= |ULTIMATE.start_main_~length~0#1| 1)} assume main_~length~0#1 > 0; {466#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:57:31,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(<= |ULTIMATE.start_main_~length~0#1| 1)} assume !(main_~length~0#1 < 0); {466#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:57:31,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#(<= |ULTIMATE.start_main_~length~0#1| 1)} call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_#t~post18#1; {467#(<= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-21 03:57:31,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(<= |ULTIMATE.start_main_~length~0#1| 0)} assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_#t~post22#1; {464#false} is VALID [2022-02-21 03:57:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:31,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:31,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941900403] [2022-02-21 03:57:31,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941900403] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:31,994 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:31,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:57:31,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170861848] [2022-02-21 03:57:31,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:32,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:32,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:57:32,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:57:32,161 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:32,240 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 03:57:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:57:32,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:32,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:32,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2022-02-21 03:57:32,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:57:32,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 25 states and 31 transitions. [2022-02-21 03:57:32,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:57:32,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:57:32,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2022-02-21 03:57:32,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:57:32,251 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-21 03:57:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2022-02-21 03:57:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2022-02-21 03:57:32,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:32,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 31 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-02-21 03:57:32,252 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 31 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-02-21 03:57:32,252 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-02-21 03:57:32,253 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:32,253 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-21 03:57:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-21 03:57:32,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:32,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:32,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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 25 states and 31 transitions. [2022-02-21 03:57:32,254 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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 25 states and 31 transitions. [2022-02-21 03:57:32,254 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:32,255 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-21 03:57:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-21 03:57:32,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:32,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:32,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:32,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-02-21 03:57:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-21 03:57:32,256 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:57:32,256 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:57:32,256 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:57:32,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:57:32,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:57:32,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:32,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:32,256 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:32,256 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:57:32,256 INFO L791 eck$LassoCheckResult]: Stem: 502#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 503#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 513#L543-3 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 504#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 499#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 500#L529 assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 511#L543-1 assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 515#L543-3 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 505#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 506#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 509#L529 assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 510#L543-1 assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 514#L543-4 assume main_~length~0#1 > 0; 507#L548 assume !(main_~length~0#1 < 0); 508#L548-2 call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_#t~post18#1; 512#L556-1 [2022-02-21 03:57:32,256 INFO L793 eck$LassoCheckResult]: Loop: 512#L556-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_#t~post22#1; 512#L556-1 [2022-02-21 03:57:32,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:32,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1723894012, now seen corresponding path program 1 times [2022-02-21 03:57:32,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:32,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781397961] [2022-02-21 03:57:32,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:32,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:32,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {627#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {627#true} is VALID [2022-02-21 03:57:32,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {627#true} is VALID [2022-02-21 03:57:32,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {627#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {629#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-21 03:57:32,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {629#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {629#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-21 03:57:32,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {629#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-21 03:57:32,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-21 03:57:32,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-21 03:57:32,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {631#(not (= |ULTIMATE.start_append_#t~mem6#1.base| 0))} is VALID [2022-02-21 03:57:32,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {631#(not (= |ULTIMATE.start_append_#t~mem6#1.base| 0))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {628#false} is VALID [2022-02-21 03:57:32,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#false} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {628#false} is VALID [2022-02-21 03:57:32,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {628#false} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {628#false} is VALID [2022-02-21 03:57:32,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {628#false} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {628#false} is VALID [2022-02-21 03:57:32,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#false} assume main_~length~0#1 > 0; {628#false} is VALID [2022-02-21 03:57:32,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {628#false} assume !(main_~length~0#1 < 0); {628#false} is VALID [2022-02-21 03:57:32,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {628#false} call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_#t~post18#1; {628#false} is VALID [2022-02-21 03:57:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:32,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:32,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781397961] [2022-02-21 03:57:32,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781397961] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:57:32,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105114285] [2022-02-21 03:57:32,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:32,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:32,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:32,320 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:57:32,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-02-21 03:57:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:32,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-21 03:57:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:32,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:32,554 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-02-21 03:57:32,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-02-21 03:57:32,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-21 03:57:32,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-02-21 03:57:32,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-02-21 03:57:32,608 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 9 treesize of output 7 [2022-02-21 03:57:32,645 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 21 treesize of output 15 [2022-02-21 03:57:32,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-02-21 03:57:32,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {627#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {627#true} is VALID [2022-02-21 03:57:32,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {638#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-21 03:57:32,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {638#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {642#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-21 03:57:32,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {642#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {642#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-21 03:57:32,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {642#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {649#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} is VALID [2022-02-21 03:57:32,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {649#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} is VALID [2022-02-21 03:57:32,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {649#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {649#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} is VALID [2022-02-21 03:57:32,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {631#(not (= |ULTIMATE.start_append_#t~mem6#1.base| 0))} is VALID [2022-02-21 03:57:32,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {631#(not (= |ULTIMATE.start_append_#t~mem6#1.base| 0))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {628#false} is VALID [2022-02-21 03:57:32,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#false} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {628#false} is VALID [2022-02-21 03:57:32,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {628#false} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {628#false} is VALID [2022-02-21 03:57:32,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {628#false} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {628#false} is VALID [2022-02-21 03:57:32,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#false} assume main_~length~0#1 > 0; {628#false} is VALID [2022-02-21 03:57:32,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {628#false} assume !(main_~length~0#1 < 0); {628#false} is VALID [2022-02-21 03:57:32,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {628#false} call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_#t~post18#1; {628#false} is VALID [2022-02-21 03:57:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:32,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:57:32,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:57:32,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2022-02-21 03:57:32,765 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 120 treesize of output 116 [2022-02-21 03:57:32,769 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 116 treesize of output 114 [2022-02-21 03:57:32,809 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 20 treesize of output 18 [2022-02-21 03:57:32,816 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 6 treesize of output 4 [2022-02-21 03:57:32,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {628#false} call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_#t~post18#1; {628#false} is VALID [2022-02-21 03:57:32,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {628#false} assume !(main_~length~0#1 < 0); {628#false} is VALID [2022-02-21 03:57:32,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#false} assume main_~length~0#1 > 0; {628#false} is VALID [2022-02-21 03:57:32,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {628#false} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {628#false} is VALID [2022-02-21 03:57:32,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {628#false} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {628#false} is VALID [2022-02-21 03:57:32,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#false} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {628#false} is VALID [2022-02-21 03:57:32,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {631#(not (= |ULTIMATE.start_append_#t~mem6#1.base| 0))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {628#false} is VALID [2022-02-21 03:57:32,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {631#(not (= |ULTIMATE.start_append_#t~mem6#1.base| 0))} is VALID [2022-02-21 03:57:32,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-21 03:57:32,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-21 03:57:32,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {629#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {630#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-21 03:57:32,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {629#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {629#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-21 03:57:32,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {627#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {629#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-21 03:57:32,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {627#true} is VALID [2022-02-21 03:57:32,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {627#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {627#true} is VALID [2022-02-21 03:57:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:32,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105114285] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:57:32,854 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:57:32,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2022-02-21 03:57:32,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221565504] [2022-02-21 03:57:32,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:57:32,854 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:32,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 3 times [2022-02-21 03:57:32,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:32,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774359974] [2022-02-21 03:57:32,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:32,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:32,860 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:32,863 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:33,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:33,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:57:33,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:57:33,001 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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-02-21 03:57:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:33,125 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-21 03:57:33,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:57:33,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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-02-21 03:57:33,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:33,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2022-02-21 03:57:33,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:57:33,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2022-02-21 03:57:33,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:57:33,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:57:33,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2022-02-21 03:57:33,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:57:33,156 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-02-21 03:57:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2022-02-21 03:57:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 03:57:33,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:33,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 18 transitions. Second operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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-02-21 03:57:33,156 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 18 transitions. Second operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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-02-21 03:57:33,157 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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-02-21 03:57:33,157 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:33,157 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-21 03:57:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-21 03:57:33,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:33,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:33,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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 17 states and 18 transitions. [2022-02-21 03:57:33,158 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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 17 states and 18 transitions. [2022-02-21 03:57:33,158 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:33,158 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-21 03:57:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-21 03:57:33,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:33,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:33,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:33,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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-02-21 03:57:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-02-21 03:57:33,159 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-02-21 03:57:33,159 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-02-21 03:57:33,159 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:57:33,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2022-02-21 03:57:33,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:57:33,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:33,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:33,160 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:33,160 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:57:33,160 INFO L791 eck$LassoCheckResult]: Stem: 746#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 747#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 756#L543-3 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 750#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 751#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 745#L529 assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 754#L543-1 assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 758#L543-3 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 752#L534 assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 742#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 743#L529 assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 753#L543-1 assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 757#L543-4 assume main_~length~0#1 > 0; 748#L548 assume !(main_~length~0#1 < 0); 749#L548-2 call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_#t~post18#1; 755#L556-1 [2022-02-21 03:57:33,160 INFO L793 eck$LassoCheckResult]: Loop: 755#L556-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_#t~post22#1; 755#L556-1 [2022-02-21 03:57:33,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:33,161 INFO L85 PathProgramCache]: Analyzing trace with hash -51113350, now seen corresponding path program 1 times [2022-02-21 03:57:33,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:33,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293097112] [2022-02-21 03:57:33,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:33,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:33,231 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 4 times [2022-02-21 03:57:33,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:33,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800215809] [2022-02-21 03:57:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:33,244 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:33,247 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:33,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:33,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1584513805, now seen corresponding path program 1 times [2022-02-21 03:57:33,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:33,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883972184] [2022-02-21 03:57:33,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:33,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:33,309 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:49,464 WARN L228 SmtUtils]: Spent 16.02s on a formula simplification. DAG size of input: 371 DAG size of output: 300 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-02-21 03:57:56,378 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:56,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:56,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:56,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:56,379 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:56,379 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,379 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:56,379 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:56,379 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration6_Lasso [2022-02-21 03:57:56,379 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:56,379 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:56,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,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-02-21 03:57:56,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,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-02-21 03:57:56,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-02-21 03:57:56,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-02-21 03:57:56,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,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-02-21 03:57:56,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,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-02-21 03:57:56,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-02-21 03:57:56,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-02-21 03:57:56,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,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-02-21 03:57:56,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-02-21 03:57:56,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,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-02-21 03:57:56,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-02-21 03:57:58,122 WARN L259 bleTransFormulaUtils]: 10 quantified variables [2022-02-21 03:57:58,124 WARN L259 bleTransFormulaUtils]: 6 quantified variables [2022-02-21 03:57:58,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:58,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:59,575 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:57:59,576 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:57:59,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:59,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,577 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-02-21 03:57:59,578 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-02-21 03:57:59,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-02-21 03:57:59,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:59,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:59,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:59,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:59,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:59,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:59,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:59,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:59,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:59,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:59,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,642 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-02-21 03:57:59,643 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-02-21 03:57:59,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:59,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:59,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:59,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:59,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:59,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:59,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:59,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:59,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:59,666 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-02-21 03:57:59,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:59,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,668 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-02-21 03:57:59,668 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-02-21 03:57:59,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:59,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:59,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:59,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:59,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:59,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:59,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:59,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:59,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:59,734 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-02-21 03:57:59,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:59,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,736 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-02-21 03:57:59,737 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-02-21 03:57:59,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:59,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:59,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:59,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:59,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:59,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:59,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:59,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:59,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:59,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:59,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:59,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,776 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-02-21 03:57:59,785 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-02-21 03:57:59,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:59,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:59,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:59,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:59,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:59,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:59,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:59,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:59,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:59,816 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-02-21 03:57:59,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:59,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,818 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-02-21 03:57:59,818 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-02-21 03:57:59,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:59,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:59,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:59,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:59,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:59,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:59,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:59,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:59,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:59,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:59,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,846 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-02-21 03:57:59,847 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-02-21 03:57:59,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:59,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:59,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:59,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:59,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:59,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:59,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:59,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:59,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:59,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:59,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,876 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-02-21 03:57:59,877 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-02-21 03:57:59,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:59,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:59,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:59,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:59,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:59,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:59,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:59,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:59,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:59,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 03:57:59,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:59,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,908 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-02-21 03:57:59,909 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-02-21 03:57:59,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:59,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:59,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:59,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:59,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:59,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:59,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:59,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:59,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:59,941 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-02-21 03:57:59,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:59,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,942 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-02-21 03:57:59,948 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-02-21 03:57:59,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:59,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:59,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:59,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:59,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:59,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:59,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:59,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:59,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:59,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 03:57:59,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:59,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,973 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-02-21 03:57:59,974 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-02-21 03:57:59,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:59,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:59,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:59,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:59,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:59,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:59,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:59,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:00,002 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-02-21 03:58:00,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:00,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:00,004 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-02-21 03:58:00,005 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-02-21 03:58:00,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:58:00,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:00,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:00,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:00,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:00,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:00,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:00,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:00,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:00,029 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-02-21 03:58:00,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:00,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:00,031 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-02-21 03:58:00,032 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-02-21 03:58:00,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:58:00,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:00,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:00,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:00,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:00,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:00,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:00,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:00,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:00,070 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-02-21 03:58:00,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:00,072 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-02-21 03:58:00,074 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-02-21 03:58:00,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:58:00,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:00,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:00,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:00,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:00,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:00,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:00,085 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:58:00,091 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:58:00,091 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-02-21 03:58:00,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:00,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:00,093 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:58:00,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:58:00,094 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:58:00,115 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:58:00,115 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:58:00,115 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1) = 1*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2022-02-21 03:58:00,132 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-02-21 03:58:00,251 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2022-02-21 03:58:00,255 INFO L390 LassoCheck]: Loop: "assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_#t~post22#1;" [2022-02-21 03:58:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:00,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:58:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:00,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:00,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {860#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {860#unseeded} is VALID [2022-02-21 03:58:00,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {860#unseeded} is VALID [2022-02-21 03:58:00,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {860#unseeded} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {860#unseeded} is VALID [2022-02-21 03:58:00,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {860#unseeded} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {860#unseeded} is VALID [2022-02-21 03:58:00,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {860#unseeded} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {860#unseeded} is VALID [2022-02-21 03:58:00,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {860#unseeded} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {860#unseeded} is VALID [2022-02-21 03:58:00,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {860#unseeded} assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {860#unseeded} is VALID [2022-02-21 03:58:00,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {860#unseeded} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); {860#unseeded} is VALID [2022-02-21 03:58:00,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#unseeded} assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; {860#unseeded} is VALID [2022-02-21 03:58:00,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#unseeded} call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); {860#unseeded} is VALID [2022-02-21 03:58:00,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#unseeded} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {860#unseeded} is VALID [2022-02-21 03:58:00,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#unseeded} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {860#unseeded} is VALID [2022-02-21 03:58:00,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#unseeded} assume main_~length~0#1 > 0; {860#unseeded} is VALID [2022-02-21 03:58:00,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#unseeded} assume !(main_~length~0#1 < 0); {860#unseeded} is VALID [2022-02-21 03:58:00,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#unseeded} call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_#t~post18#1; {860#unseeded} is VALID [2022-02-21 03:58:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:00,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:00,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:00,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {863#(>= oldRank0 |ULTIMATE.start_main_~length~0#1|)} assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_#t~post22#1; {1003#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~length~0#1|)))} is VALID [2022-02-21 03:58:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:58:00,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:00,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:00,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:58:00,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,389 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:58:00,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:00,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 19 transitions. Complement of second has 2 states. [2022-02-21 03:58:00,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:00,406 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:00,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. cyclomatic complexity: 3 [2022-02-21 03:58:00,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:00,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:00,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:00,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:58:00,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:00,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:00,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2022-02-21 03:58:00,410 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:00,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:00,410 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 18 transitions. cyclomatic complexity: 3 [2022-02-21 03:58:00,411 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:00,411 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:00,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:58:00,411 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:00,411 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 19 transitions. cyclomatic complexity: 3 [2022-02-21 03:58:00,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. cyclomatic complexity: 3 [2022-02-21 03:58:00,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:00,412 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:58:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 18 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:58:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:58:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 19 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:58:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 18 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:58:00,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:58:00,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 19 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:58:00,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 18 transitions. cyclomatic complexity: 3 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:58:00,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:58:00,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 19 transitions. cyclomatic complexity: 3 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:58:00,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 18 transitions. cyclomatic complexity: 3 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:58:00,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:58:00,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 19 transitions. cyclomatic complexity: 3 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:58:00,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 18 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:00,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:00,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 19 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:00,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 18 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:58:00,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:58:00,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 19 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:58:00,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 18 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:58:00,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:58:00,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 19 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:58:00,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,416 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:58:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-02-21 03:58:00,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:58:00,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 16 letters. Loop has 1 letters. [2022-02-21 03:58:00,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:58:00,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:00,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. cyclomatic complexity: 3 [2022-02-21 03:58:00,421 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:00,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2022-02-21 03:58:00,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:58:00,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:58:00,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:58:00,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:58:00,421 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:00,421 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:00,421 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:58:00,421 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:58:00,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:58:00,422 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:58:00,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:58:00,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:58:00 BoogieIcfgContainer [2022-02-21 03:58:00,427 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:58:00,428 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:58:00,428 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:58:00,428 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:58:00,428 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:22" (3/4) ... [2022-02-21 03:58:00,430 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:58:00,430 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:58:00,430 INFO L158 Benchmark]: Toolchain (without parser) took 38668.80ms. Allocated memory was 98.6MB in the beginning and 192.9MB in the end (delta: 94.4MB). Free memory was 60.3MB in the beginning and 53.6MB in the end (delta: 6.7MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. [2022-02-21 03:58:00,431 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:00,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.29ms. Allocated memory is still 98.6MB. Free memory was 60.1MB in the beginning and 74.0MB in the end (delta: -13.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-21 03:58:00,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.41ms. Allocated memory is still 98.6MB. Free memory was 74.0MB in the beginning and 71.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:00,431 INFO L158 Benchmark]: Boogie Preprocessor took 79.64ms. Allocated memory is still 98.6MB. Free memory was 71.9MB in the beginning and 70.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:00,431 INFO L158 Benchmark]: RCFGBuilder took 469.70ms. Allocated memory is still 98.6MB. Free memory was 70.1MB in the beginning and 49.8MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-21 03:58:00,432 INFO L158 Benchmark]: BuchiAutomizer took 37659.92ms. Allocated memory was 98.6MB in the beginning and 192.9MB in the end (delta: 94.4MB). Free memory was 49.8MB in the beginning and 54.6MB in the end (delta: -4.8MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. [2022-02-21 03:58:00,432 INFO L158 Benchmark]: Witness Printer took 2.18ms. Allocated memory is still 192.9MB. Free memory was 54.6MB in the beginning and 53.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:00,435 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.29ms. Allocated memory is still 98.6MB. Free memory was 60.1MB in the beginning and 74.0MB in the end (delta: -13.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.41ms. Allocated memory is still 98.6MB. Free memory was 74.0MB in the beginning and 71.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.64ms. Allocated memory is still 98.6MB. Free memory was 71.9MB in the beginning and 70.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 469.70ms. Allocated memory is still 98.6MB. Free memory was 70.1MB in the beginning and 49.8MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 37659.92ms. Allocated memory was 98.6MB in the beginning and 192.9MB in the end (delta: 94.4MB). Free memory was 49.8MB in the beginning and 54.6MB in the end (delta: -4.8MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. * Witness Printer took 2.18ms. Allocated memory is still 192.9MB. Free memory was 54.6MB in the beginning and 53.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 39 + -2 * c and consists of 4 locations. One deterministic module has affine ranking function length and consists of 2 locations. 4 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 36.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 71 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital4576 mio100 ax101 hnf100 lsp96 ukn22 mio100 lsp33 div100 bol100 ite100 ukn100 eq205 hnf87 smp100 dnf398 smp93 tf100 neg96 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 301ms VariablesStem: 11 VariablesLoop: 17 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:58:00,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:00,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:00,864 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