./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-linkedlists/ll_append-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:33:46,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:33:46,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:33:46,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:33:46,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:33:46,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:33:46,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:33:46,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:33:46,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:33:46,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:33:46,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:33:46,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:33:46,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:33:46,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:33:46,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:33:46,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:33:46,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:33:46,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:33:46,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:33:46,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:33:46,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:33:46,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:33:46,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:33:46,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:33:46,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:33:46,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:33:46,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:33:46,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:33:46,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:33:46,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:33:46,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:33:46,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:33:46,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:33:46,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:33:46,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:33:46,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:33:46,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:33:46,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:33:46,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:33:46,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:33:46,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:33:46,772 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:33:46,794 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:33:46,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:33:46,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:33:46,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:33:46,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:33:46,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:33:46,797 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:33:46,797 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:33:46,797 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:33:46,797 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:33:46,798 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:33:46,798 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:33:46,798 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:33:46,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:33:46,798 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:33:46,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:33:46,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:33:46,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:33:46,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:33:46,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:33:46,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:33:46,799 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:33:46,800 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:33:46,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:33:46,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:33:46,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:33:46,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:33:46,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:33:46,801 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:33:46,801 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 [2022-02-21 03:33:46,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:33:47,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:33:47,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:33:47,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:33:47,018 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:33:47,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2022-02-21 03:33:47,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66645d977/94d533cb5c9f439a925e8dd47884e4d7/FLAG1c2e0a5d6 [2022-02-21 03:33:47,464 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:33:47,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2022-02-21 03:33:47,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66645d977/94d533cb5c9f439a925e8dd47884e4d7/FLAG1c2e0a5d6 [2022-02-21 03:33:47,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66645d977/94d533cb5c9f439a925e8dd47884e4d7 [2022-02-21 03:33:47,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:33:47,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:33:47,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:33:47,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:33:47,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:33:47,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:33:47" (1/1) ... [2022-02-21 03:33:47,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a904e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:47, skipping insertion in model container [2022-02-21 03:33:47,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:33:47" (1/1) ... [2022-02-21 03:33:47,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:33:47,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:33:47,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:33:47,798 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:33:47,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:33:47,862 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:33:47,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:47 WrapperNode [2022-02-21 03:33:47,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:33:47,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:33:47,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:33:47,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:33:47,868 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:33:47" (1/1) ... [2022-02-21 03:33:47,889 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:33:47" (1/1) ... [2022-02-21 03:33:47,905 INFO L137 Inliner]: procedures = 115, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2022-02-21 03:33:47,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:33:47,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:33:47,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:33:47,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:33:47,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:47" (1/1) ... [2022-02-21 03:33:47,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:47" (1/1) ... [2022-02-21 03:33:47,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:47" (1/1) ... [2022-02-21 03:33:47,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:47" (1/1) ... [2022-02-21 03:33:47,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:47" (1/1) ... [2022-02-21 03:33:47,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:47" (1/1) ... [2022-02-21 03:33:47,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:47" (1/1) ... [2022-02-21 03:33:47,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:33:47,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:33:47,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:33:47,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:33:47,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:47" (1/1) ... [2022-02-21 03:33:47,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,975 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:33:47,977 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:33:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2022-02-21 03:33:47,999 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2022-02-21 03:33:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:33:48,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:33:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 03:33:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 03:33:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure length [2022-02-21 03:33:48,001 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2022-02-21 03:33:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:33:48,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:33:48,101 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:33:48,102 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:33:48,266 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:33:48,270 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:33:48,271 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:33:48,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:48 BoogieIcfgContainer [2022-02-21 03:33:48,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:33:48,274 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:33:48,274 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:33:48,277 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:33:48,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:48,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:33:47" (1/3) ... [2022-02-21 03:33:48,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@719300ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:33:48, skipping insertion in model container [2022-02-21 03:33:48,279 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:48,279 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:47" (2/3) ... [2022-02-21 03:33:48,280 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@719300ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:33:48, skipping insertion in model container [2022-02-21 03:33:48,280 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:48,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:48" (3/3) ... [2022-02-21 03:33:48,281 INFO L388 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2022-02-21 03:33:48,309 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:33:48,309 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:33:48,309 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:33:48,309 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:33:48,309 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:33:48,309 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:33:48,310 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:33:48,310 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:33:48,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:33:48,345 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:33:48,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:48,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:48,349 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:33:48,350 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:48,350 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:33:48,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:33:48,362 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:33:48,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:48,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:48,363 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:33:48,363 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:48,368 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 15#L574true assume !(main_~n~0#1 < 1); 27#L577true call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 14#new_llENTRYtrue [2022-02-21 03:33:48,369 INFO L793 eck$LassoCheckResult]: Loop: 14#new_llENTRYtrue ~n := #in~n; 21#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 16#L552true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 14#new_llENTRYtrue [2022-02-21 03:33:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2022-02-21 03:33:48,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:48,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760713276] [2022-02-21 03:33:48,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:48,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:48,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:48,529 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2022-02-21 03:33:48,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:48,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710390157] [2022-02-21 03:33:48,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:48,572 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:48,606 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:48,608 INFO L85 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2022-02-21 03:33:48,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:48,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051660454] [2022-02-21 03:33:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:48,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:48,641 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:49,704 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:49,705 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:49,705 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:49,705 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:49,705 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:49,705 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:49,705 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:49,705 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:49,706 INFO L133 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2022-02-21 03:33:49,706 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:49,706 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:49,718 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:33:49,722 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:33:49,724 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:33:49,727 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:33:49,729 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:33:49,731 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:33:49,732 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:33:49,735 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:33:49,736 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:33:49,738 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:33:49,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,750 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:33:49,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,753 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:33:49,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,756 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:33:49,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,764 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:33:49,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,778 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:33:49,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,782 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:33:49,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,785 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:33:49,788 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:33:49,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,791 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:33:49,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:49,800 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:33:49,802 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:33:49,804 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:33:49,805 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:33:49,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:33:50,172 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:50,175 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:50,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,178 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:33:50,183 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:33:50,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,197 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:33:50,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,225 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:33:50,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,228 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:33:50,233 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:33:50,233 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:33:50,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,270 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:33:50,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,272 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:33:50,274 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:33:50,276 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:33:50,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,327 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:33:50,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,329 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:33:50,330 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:33:50,331 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:33:50,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:33:50,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,370 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:33:50,370 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:33:50,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:50,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:50,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,400 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:33:50,401 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:33:50,402 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:33:50,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,439 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:33:50,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,440 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:33:50,441 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:33:50,442 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:33:50,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:50,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,475 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:33:50,476 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:33:50,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:50,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:50,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,507 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:33:50,509 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:33:50,510 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:33:50,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:50,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,535 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:33:50,537 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:33:50,538 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:33:50,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:50,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,564 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:33:50,571 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:33:50,575 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:33:50,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,609 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:33:50,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,610 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:33:50,611 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:33:50,612 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:33:50,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:50,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:50,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:50,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,690 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:33:50,692 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:33:50,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:50,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,727 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:33:50,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,728 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:33:50,734 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:33:50,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,747 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:33:50,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,781 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:33:50,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,782 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:33:50,783 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:33:50,785 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:33:50,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:50,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,808 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:33:50,809 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:33:50,810 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:33:50,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,856 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:33:50,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,858 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:33:50,858 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:33:50,859 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:33:50,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,884 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:33:50,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,885 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:33:50,886 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:33:50,891 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:33:50,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,913 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:33:50,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,914 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:33:50,917 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:33:50,918 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:33:50,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:50,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,942 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:33:50,944 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:33:50,945 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:33:50,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:50,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:50,978 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:33:50,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:50,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:50,980 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:33:50,980 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:33:50,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:33:50,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:50,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:50,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:50,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:50,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:50,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:50,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,024 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:33:51,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,026 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:33:51,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:33:51,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:33:51,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:33:51,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,051 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:33:51,052 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:33:51,053 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:33:51,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,082 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:33:51,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,083 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:33:51,084 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:33:51,085 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:33:51,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,124 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:33:51,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,125 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:33:51,126 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:33:51,127 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:33:51,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:51,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:51,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:33:51,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,165 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:33:51,165 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:33:51,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:51,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:33:51,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,190 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:33:51,191 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:33:51,192 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:33:51,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,218 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:33:51,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,219 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:33:51,220 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:33:51,221 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:33:51,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:33:51,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,246 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:33:51,247 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:33:51,248 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:33:51,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:33:51,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,273 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:33:51,273 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:33:51,275 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:33:51,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:33:51,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,300 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:33:51,300 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:33:51,301 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:33:51,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:33:51,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,326 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:33:51,327 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:33:51,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:51,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 03:33:51,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,359 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:33:51,360 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:33:51,362 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:33:51,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:33:51,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,392 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:33:51,393 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:33:51,394 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:33:51,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 03:33:51,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,418 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:33:51,419 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:33:51,420 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:33:51,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,470 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:33:51,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,471 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:33:51,472 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:33:51,473 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:33:51,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,496 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:33:51,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,497 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:33:51,498 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:33:51,499 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:33:51,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:33:51,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,532 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:51,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:33:51,534 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:33:51,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:51,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,560 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:33:51,561 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:33:51,562 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:33:51,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,587 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:33:51,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,589 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:33:51,589 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:33:51,661 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:33:51,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 03:33:51,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,686 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:33:51,687 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:33:51,688 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:33:51,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:33:51,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,712 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:33:51,713 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:33:51,714 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:33:51,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:51,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:51,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:51,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:33:51,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,749 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:33:51,749 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:33:51,751 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:33:51,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,757 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:33:51,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,761 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:33:51,761 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:33:51,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:33:51,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,809 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:33:51,811 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:33:51,811 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:33:51,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:51,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:51,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:51,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:51,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 03:33:51,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,860 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:33:51,861 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:33:51,863 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:33:51,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:51,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:51,871 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:33:51,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:51,875 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:33:51,875 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:33:51,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:51,924 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 03:33:51,924 INFO L444 ModelExtractionUtils]: 3 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:33:51,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:51,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:51,927 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:33:51,928 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:33:51,929 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:51,951 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-02-21 03:33:51,951 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:51,952 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_ll_#in~n) = 1*new_ll_#in~n Supporting invariants [1*new_ll_#in~n >= 0] [2022-02-21 03:33:51,978 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:33:51,989 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:33:51,996 INFO L390 LassoCheck]: Loop: "~n := #in~n;" "assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4);" "call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);"< [2022-02-21 03:33:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:52,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:52,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:33:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:52,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:52,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {37#unseeded} is VALID [2022-02-21 03:33:52,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {37#unseeded} is VALID [2022-02-21 03:33:52,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#unseeded} assume !(main_~n~0#1 < 1); {71#(and (not (< |ULTIMATE.start_main_~n~0#1| 1)) unseeded)} is VALID [2022-02-21 03:33:52,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:52,130 INFO L272 TraceCheckUtils]: 3: Hoare triple {71#(and (not (< |ULTIMATE.start_main_~n~0#1| 1)) unseeded)} call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1); {56#(and (>= |new_ll_#in~n| 0) unseeded)} is VALID [2022-02-21 03:33:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:52,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:33:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:52,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:52,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#(and (>= |new_ll_#in~n| 0) (>= oldRank0 |new_ll_#in~n|))} ~n := #in~n; {75#(and (<= 0 new_ll_~n) (<= new_ll_~n oldRank0))} is VALID [2022-02-21 03:33:52,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {75#(and (<= 0 new_ll_~n) (<= new_ll_~n oldRank0))} assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); {79#(and (<= 0 new_ll_~n) (<= new_ll_~n oldRank0) (not (= new_ll_~n 0)))} is VALID [2022-02-21 03:33:52,198 INFO L272 TraceCheckUtils]: 2: Hoare triple {79#(and (<= 0 new_ll_~n) (<= new_ll_~n oldRank0) (not (= new_ll_~n 0)))} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {59#(and (>= |new_ll_#in~n| 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 |new_ll_#in~n|))))} is VALID [2022-02-21 03:33:52,199 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:33:52,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:52,223 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:33:52,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:52,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,229 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:33:52,230 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:52,347 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4). Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 54 transitions. Complement of second has 13 states. [2022-02-21 03:33:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:33:52,347 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:52,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:33:52,350 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:33:52,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:52,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:52,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:52,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:52,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:52,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:52,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2022-02-21 03:33:52,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:52,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:52,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:52,355 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:33:52,357 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:33:52,358 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:33:52,358 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:52,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:52,359 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:33:52,359 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 12 [2022-02-21 03:33:52,360 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:33:52,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:52,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:52,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:52,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:33:52,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:33:52,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:33:52,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:33:52,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:33:52,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:33:52,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:33:52,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:33:52,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:33:52,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:33:52,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:33:52,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:33:52,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:52,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 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:33:52,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:52,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:33:52,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:33:52,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:33:52,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:52,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:52,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:52,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:52,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:52,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:52,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:33:52,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:33:52,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:33:52,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:52,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:52,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:52,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:52,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:52,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:52,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:52,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:52,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:52,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:33:52,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:33:52,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:33:52,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:33:52,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:33:52,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:33:52,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:33:52,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:33:52,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:33:52,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:52,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:52,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:33:52,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:52,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:52,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:52,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:33:52,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:33:52,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:33:52,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:52,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:52,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:52,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,372 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-02-21 03:33:52,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:52,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:33:52,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:33:52,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:52,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. cyclomatic complexity: 12 [2022-02-21 03:33:52,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:52,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2022-02-21 03:33:52,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-02-21 03:33:52,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-02-21 03:33:52,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-02-21 03:33:52,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:52,386 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-21 03:33:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-02-21 03:33:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-21 03:33:52,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:52,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 37 transitions. Second operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:33:52,409 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 37 transitions. Second operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:33:52,411 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:33:52,414 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:52,429 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-02-21 03:33:52,429 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-02-21 03:33:52,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:52,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:52,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Second operand 29 states and 37 transitions. [2022-02-21 03:33:52,433 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Second operand 29 states and 37 transitions. [2022-02-21 03:33:52,433 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:52,437 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-02-21 03:33:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-02-21 03:33:52,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:52,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:52,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:52,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:33:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-02-21 03:33:52,442 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-02-21 03:33:52,442 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-02-21 03:33:52,442 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:33:52,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2022-02-21 03:33:52,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:52,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:52,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:52,445 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:52,445 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:33:52,445 INFO L791 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 155#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 162#L574 assume !(main_~n~0#1 < 1); 151#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 170#new_llENTRY ~n := #in~n; 171#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 173#new_llFINAL assume true; 167#new_llEXIT >#57#return; 165#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 166#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 169#L566-3 [2022-02-21 03:33:52,445 INFO L793 eck$LassoCheckResult]: Loop: 169#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8); 168#L566-1 assume !!(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset; 169#L566-3 [2022-02-21 03:33:52,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:52,446 INFO L85 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2022-02-21 03:33:52,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:52,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809988695] [2022-02-21 03:33:52,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:52,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:52,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:33:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:52,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {345#true} is VALID [2022-02-21 03:33:52,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {354#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:52,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} assume true; {354#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:52,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} {345#true} #57#return; {351#(and (= |ULTIMATE.start_main_#t~ret9#1.base| 0) (= |ULTIMATE.start_main_#t~ret9#1.offset| 0))} is VALID [2022-02-21 03:33:52,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {345#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {345#true} is VALID [2022-02-21 03:33:52,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {345#true} is VALID [2022-02-21 03:33:52,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#true} assume !(main_~n~0#1 < 1); {345#true} is VALID [2022-02-21 03:33:52,558 INFO L272 TraceCheckUtils]: 3: Hoare triple {345#true} call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1); {353#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:33:52,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {353#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {345#true} is VALID [2022-02-21 03:33:52,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {345#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {354#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:52,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {354#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} assume true; {354#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:52,560 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {354#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} {345#true} #57#return; {351#(and (= |ULTIMATE.start_main_#t~ret9#1.base| 0) (= |ULTIMATE.start_main_#t~ret9#1.offset| 0))} is VALID [2022-02-21 03:33:52,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {351#(and (= |ULTIMATE.start_main_#t~ret9#1.base| 0) (= |ULTIMATE.start_main_#t~ret9#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; {352#(and (= |ULTIMATE.start_append_~x#1.base| 0) (= |ULTIMATE.start_append_~x#1.offset| 0))} is VALID [2022-02-21 03:33:52,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {352#(and (= |ULTIMATE.start_append_~x#1.base| 0) (= |ULTIMATE.start_append_~x#1.offset| 0))} assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; {346#false} is VALID [2022-02-21 03:33:52,561 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:33:52,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:33:52,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809988695] [2022-02-21 03:33:52,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809988695] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:33:52,562 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:33:52,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:33:52,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107153215] [2022-02-21 03:33:52,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:33:52,564 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:33:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2022-02-21 03:33:52,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:52,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729061237] [2022-02-21 03:33:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:52,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:52,572 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:52,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:33:52,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:33:52,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:33:52,609 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:33:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:52,742 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-21 03:33:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:33:52,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:33:52,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:52,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2022-02-21 03:33:52,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:52,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2022-02-21 03:33:52,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-02-21 03:33:52,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-02-21 03:33:52,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2022-02-21 03:33:52,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:52,760 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-02-21 03:33:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2022-02-21 03:33:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-02-21 03:33:52,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:52,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 36 transitions. Second operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:33:52,764 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 36 transitions. Second operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:33:52,765 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:33:52,765 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:52,768 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-02-21 03:33:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-02-21 03:33:52,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:52,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:52,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 31 states and 36 transitions. [2022-02-21 03:33:52,769 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 31 states and 36 transitions. [2022-02-21 03:33:52,771 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:52,775 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-02-21 03:33:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-02-21 03:33:52,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:52,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:52,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:52,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:33:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-02-21 03:33:52,777 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-02-21 03:33:52,778 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-02-21 03:33:52,778 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:33:52,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2022-02-21 03:33:52,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:52,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:52,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:52,782 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:52,782 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:52,783 INFO L791 eck$LassoCheckResult]: Stem: 396#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 397#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 404#L574 assume !(main_~n~0#1 < 1); 393#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 413#new_llENTRY ~n := #in~n; 401#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 402#new_llFINAL assume true; 412#new_llEXIT >#57#return; 408#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 409#L563 assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; 390#L569 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 391#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 405#lengthENTRY [2022-02-21 03:33:52,783 INFO L793 eck$LassoCheckResult]: Loop: 405#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 399#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 400#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 405#lengthENTRY [2022-02-21 03:33:52,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:52,783 INFO L85 PathProgramCache]: Analyzing trace with hash -250149368, now seen corresponding path program 1 times [2022-02-21 03:33:52,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:52,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361696794] [2022-02-21 03:33:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:52,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:33:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:52,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {600#(= new_ll_~n |new_ll_#in~n|)} is VALID [2022-02-21 03:33:52,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#(= new_ll_~n |new_ll_#in~n|)} assume 0 == ~n;#res.base, #res.offset := 0, 0; {601#(= |new_ll_#in~n| 0)} is VALID [2022-02-21 03:33:52,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(= |new_ll_#in~n| 0)} assume true; {601#(= |new_ll_#in~n| 0)} is VALID [2022-02-21 03:33:52,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#(= |new_ll_#in~n| 0)} {594#(<= 1 |ULTIMATE.start_main_~n~0#1|)} #57#return; {593#false} is VALID [2022-02-21 03:33:52,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {592#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {592#true} is VALID [2022-02-21 03:33:52,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {592#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {592#true} is VALID [2022-02-21 03:33:52,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {592#true} assume !(main_~n~0#1 < 1); {594#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 03:33:52,857 INFO L272 TraceCheckUtils]: 3: Hoare triple {594#(<= 1 |ULTIMATE.start_main_~n~0#1|)} call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1); {599#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:33:52,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {599#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {600#(= new_ll_~n |new_ll_#in~n|)} is VALID [2022-02-21 03:33:52,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {600#(= new_ll_~n |new_ll_#in~n|)} assume 0 == ~n;#res.base, #res.offset := 0, 0; {601#(= |new_ll_#in~n| 0)} is VALID [2022-02-21 03:33:52,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {601#(= |new_ll_#in~n| 0)} assume true; {601#(= |new_ll_#in~n| 0)} is VALID [2022-02-21 03:33:52,858 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {601#(= |new_ll_#in~n| 0)} {594#(<= 1 |ULTIMATE.start_main_~n~0#1|)} #57#return; {593#false} is VALID [2022-02-21 03:33:52,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {593#false} main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; {593#false} is VALID [2022-02-21 03:33:52,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#false} assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; {593#false} is VALID [2022-02-21 03:33:52,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#false} main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; {593#false} is VALID [2022-02-21 03:33:52,859 INFO L272 TraceCheckUtils]: 11: Hoare triple {593#false} call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset); {593#false} is VALID [2022-02-21 03:33:52,859 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:33:52,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:33:52,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361696794] [2022-02-21 03:33:52,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361696794] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:33:52,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:33:52,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:33:52,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550379943] [2022-02-21 03:33:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:33:52,862 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:33:52,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:52,862 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2022-02-21 03:33:52,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:52,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600370428] [2022-02-21 03:33:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:52,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:52,887 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:53,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:33:53,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:33:53,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:33:53,613 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:33:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:53,762 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-21 03:33:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:33:53,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:33:53,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:53,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2022-02-21 03:33:53,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:53,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2022-02-21 03:33:53,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-02-21 03:33:53,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-02-21 03:33:53,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2022-02-21 03:33:53,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:53,776 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-02-21 03:33:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2022-02-21 03:33:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-21 03:33:53,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:53,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 28 transitions. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:33:53,777 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 28 transitions. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:33:53,777 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:33:53,778 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:53,779 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-21 03:33:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-21 03:33:53,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:53,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:53,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 24 states and 28 transitions. [2022-02-21 03:33:53,780 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 24 states and 28 transitions. [2022-02-21 03:33:53,780 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:53,782 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-21 03:33:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-21 03:33:53,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:53,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:53,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:53,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:33:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-02-21 03:33:53,783 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-02-21 03:33:53,783 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-02-21 03:33:53,783 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:33:53,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2022-02-21 03:33:53,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:53,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:53,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:53,784 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:53,785 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:33:53,785 INFO L791 eck$LassoCheckResult]: Stem: 641#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 642#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 649#L574 assume !(main_~n~0#1 < 1); 637#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 656#new_llENTRY ~n := #in~n; 648#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 636#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 657#new_llENTRY ~n := #in~n; 646#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 647#new_llFINAL assume true; 650#new_llEXIT >#53#return; 635#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 638#new_llFINAL assume true; 658#new_llEXIT >#57#return; 652#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 653#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 654#L566-3 [2022-02-21 03:33:53,785 INFO L793 eck$LassoCheckResult]: Loop: 654#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8); 655#L566-1 assume !!(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset; 654#L566-3 [2022-02-21 03:33:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2022-02-21 03:33:53,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:53,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833955544] [2022-02-21 03:33:53,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:53,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:53,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:53,820 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:53,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:53,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2022-02-21 03:33:53,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:53,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112986993] [2022-02-21 03:33:53,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:53,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:53,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:53,827 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:53,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2022-02-21 03:33:53,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:53,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701719769] [2022-02-21 03:33:53,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:53,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:33:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:53,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:33:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:53,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {827#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {812#true} is VALID [2022-02-21 03:33:53,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:53,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} assume true; {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:53,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} {812#true} #53#return; {832#(and (= 0 |new_ll_#t~ret3.offset|) (= |new_ll_#t~ret3.base| 0))} is VALID [2022-02-21 03:33:53,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {827#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {812#true} is VALID [2022-02-21 03:33:53,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#true} assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); {812#true} is VALID [2022-02-21 03:33:53,955 INFO L272 TraceCheckUtils]: 2: Hoare triple {812#true} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {827#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:33:53,956 INFO L290 TraceCheckUtils]: 3: Hoare triple {827#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {812#true} is VALID [2022-02-21 03:33:53,956 INFO L290 TraceCheckUtils]: 4: Hoare triple {812#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:53,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} assume true; {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:53,957 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} {812#true} #53#return; {832#(and (= 0 |new_ll_#t~ret3.offset|) (= |new_ll_#t~ret3.base| 0))} is VALID [2022-02-21 03:33:53,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {832#(and (= 0 |new_ll_#t~ret3.offset|) (= |new_ll_#t~ret3.base| 0))} call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; {833#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0))} is VALID [2022-02-21 03:33:53,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0))} assume true; {833#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0))} is VALID [2022-02-21 03:33:53,959 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {833#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0))} {812#true} #57#return; {824#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| 4)) 0))} is VALID [2022-02-21 03:33:53,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {812#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {812#true} is VALID [2022-02-21 03:33:53,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {812#true} is VALID [2022-02-21 03:33:53,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {812#true} assume !(main_~n~0#1 < 1); {812#true} is VALID [2022-02-21 03:33:53,960 INFO L272 TraceCheckUtils]: 3: Hoare triple {812#true} call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1); {827#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:33:53,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {827#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {812#true} is VALID [2022-02-21 03:33:53,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {812#true} assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); {812#true} is VALID [2022-02-21 03:33:53,961 INFO L272 TraceCheckUtils]: 6: Hoare triple {812#true} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {827#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:33:53,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {827#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {812#true} is VALID [2022-02-21 03:33:53,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {812#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:53,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} assume true; {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:53,963 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} {812#true} #53#return; {832#(and (= 0 |new_ll_#t~ret3.offset|) (= |new_ll_#t~ret3.base| 0))} is VALID [2022-02-21 03:33:53,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {832#(and (= 0 |new_ll_#t~ret3.offset|) (= |new_ll_#t~ret3.base| 0))} call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; {833#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0))} is VALID [2022-02-21 03:33:53,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {833#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0))} assume true; {833#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0))} is VALID [2022-02-21 03:33:53,965 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {833#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0))} {812#true} #57#return; {824#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| 4)) 0))} is VALID [2022-02-21 03:33:53,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {824#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| 4)) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; {825#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0))} is VALID [2022-02-21 03:33:53,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {825#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0))} assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; {825#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0))} is VALID [2022-02-21 03:33:53,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {825#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0))} call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8); {826#(and (= |ULTIMATE.start_append_#t~mem6#1.base| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| 0))} is VALID [2022-02-21 03:33:53,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#(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);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset; {813#false} is VALID [2022-02-21 03:33:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:33:53,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:33:53,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701719769] [2022-02-21 03:33:53,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701719769] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:33:53,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355422768] [2022-02-21 03:33:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:53,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:33:53,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:53,970 INFO L229 MonitoredProcess]: Starting monitored process 48 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:33:54,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-02-21 03:33:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:54,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-21 03:33:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:54,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:54,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 03:33:54,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:33:54,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:33:54,333 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 15 treesize of output 7 [2022-02-21 03:33:54,342 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 15 treesize of output 7 [2022-02-21 03:33:54,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {812#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {812#true} is VALID [2022-02-21 03:33:54,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {812#true} is VALID [2022-02-21 03:33:54,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {812#true} assume !(main_~n~0#1 < 1); {812#true} is VALID [2022-02-21 03:33:54,348 INFO L272 TraceCheckUtils]: 3: Hoare triple {812#true} call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1); {812#true} is VALID [2022-02-21 03:33:54,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {812#true} ~n := #in~n; {812#true} is VALID [2022-02-21 03:33:54,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {812#true} assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); {853#(and (= new_ll_~head~0.offset 0) (<= (select |#length| new_ll_~head~0.base) 12))} is VALID [2022-02-21 03:33:54,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {853#(and (= new_ll_~head~0.offset 0) (<= (select |#length| new_ll_~head~0.base) 12))} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {857#(= |old(#length)| |#length|)} is VALID [2022-02-21 03:33:54,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(= |old(#length)| |#length|)} ~n := #in~n; {857#(= |old(#length)| |#length|)} is VALID [2022-02-21 03:33:54,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {857#(= |old(#length)| |#length|)} assume 0 == ~n;#res.base, #res.offset := 0, 0; {864#(and (= |old(#length)| |#length|) (= |new_ll_#res.base| 0) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:54,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {864#(and (= |old(#length)| |#length|) (= |new_ll_#res.base| 0) (= |new_ll_#res.offset| 0))} assume true; {864#(and (= |old(#length)| |#length|) (= |new_ll_#res.base| 0) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:54,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {864#(and (= |old(#length)| |#length|) (= |new_ll_#res.base| 0) (= |new_ll_#res.offset| 0))} {853#(and (= new_ll_~head~0.offset 0) (<= (select |#length| new_ll_~head~0.base) 12))} #53#return; {871#(and (= new_ll_~head~0.offset 0) (<= (select |#length| new_ll_~head~0.base) 12) (= 0 |new_ll_#t~ret3.offset|) (= |new_ll_#t~ret3.base| 0))} is VALID [2022-02-21 03:33:54,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {871#(and (= new_ll_~head~0.offset 0) (<= (select |#length| new_ll_~head~0.base) 12) (= 0 |new_ll_#t~ret3.offset|) (= |new_ll_#t~ret3.base| 0))} call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; {875#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4) 0) (<= (select |#length| |new_ll_#res.base|) 12) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:54,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {875#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4) 0) (<= (select |#length| |new_ll_#res.base|) 12) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= |new_ll_#res.offset| 0))} assume true; {875#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4) 0) (<= (select |#length| |new_ll_#res.base|) 12) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:54,355 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {875#(and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) 4) 0) (<= (select |#length| |new_ll_#res.base|) 12) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) 4) 0) (= |new_ll_#res.offset| 0))} {812#true} #57#return; {882#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9#1.base|) 4) 0) (<= (select |#length| |ULTIMATE.start_main_#t~ret9#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9#1.base|) 4) 0) (= |ULTIMATE.start_main_#t~ret9#1.offset| 0))} is VALID [2022-02-21 03:33:54,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {882#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9#1.base|) 4) 0) (<= (select |#length| |ULTIMATE.start_main_#t~ret9#1.base|) 12) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9#1.base|) 4) 0) (= |ULTIMATE.start_main_#t~ret9#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; {886#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) 4) 0) (<= (select |#length| |ULTIMATE.start_append_~x#1.base|) 12) (= |ULTIMATE.start_append_~x#1.offset| 0))} is VALID [2022-02-21 03:33:54,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {886#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) 4) 0) (<= (select |#length| |ULTIMATE.start_append_~x#1.base|) 12) (= |ULTIMATE.start_append_~x#1.offset| 0))} assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; {886#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) 4) 0) (<= (select |#length| |ULTIMATE.start_append_~x#1.base|) 12) (= |ULTIMATE.start_append_~x#1.offset| 0))} is VALID [2022-02-21 03:33:54,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {886#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) 4) 0) (<= (select |#length| |ULTIMATE.start_append_~x#1.base|) 12) (= |ULTIMATE.start_append_~x#1.offset| 0))} call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8); {826#(and (= |ULTIMATE.start_append_#t~mem6#1.base| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| 0))} is VALID [2022-02-21 03:33:54,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#(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);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset; {813#false} is VALID [2022-02-21 03:33:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:33:54,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:33:54,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#(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);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset; {813#false} is VALID [2022-02-21 03:33:54,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {899#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0)) (not (<= (+ |ULTIMATE.start_append_~x#1.offset| 12) (select |#length| |ULTIMATE.start_append_~x#1.base|))))} call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8); {826#(and (= |ULTIMATE.start_append_#t~mem6#1.base| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| 0))} is VALID [2022-02-21 03:33:54,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {899#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0)) (not (<= (+ |ULTIMATE.start_append_~x#1.offset| 12) (select |#length| |ULTIMATE.start_append_~x#1.base|))))} assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; {899#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0)) (not (<= (+ |ULTIMATE.start_append_~x#1.offset| 12) (select |#length| |ULTIMATE.start_append_~x#1.base|))))} is VALID [2022-02-21 03:33:54,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#(or (not (<= (+ |ULTIMATE.start_main_#t~ret9#1.offset| 12) (select |#length| |ULTIMATE.start_main_#t~ret9#1.base|))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| 4)) 0)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; {899#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~x#1.base|) (+ |ULTIMATE.start_append_~x#1.offset| 4)) 0)) (not (<= (+ |ULTIMATE.start_append_~x#1.offset| 12) (select |#length| |ULTIMATE.start_append_~x#1.base|))))} is VALID [2022-02-21 03:33:54,766 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {913#(or (and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0)) (not (<= (+ |new_ll_#res.offset| 12) (select |#length| |new_ll_#res.base|))))} {812#true} #57#return; {906#(or (not (<= (+ |ULTIMATE.start_main_#t~ret9#1.offset| 12) (select |#length| |ULTIMATE.start_main_#t~ret9#1.base|))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| 4)) 0)))} is VALID [2022-02-21 03:33:54,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#(or (and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0)) (not (<= (+ |new_ll_#res.offset| 12) (select |#length| |new_ll_#res.base|))))} assume true; {913#(or (and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0)) (not (<= (+ |new_ll_#res.offset| 12) (select |#length| |new_ll_#res.base|))))} is VALID [2022-02-21 03:33:54,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#(or (not (<= (+ new_ll_~head~0.offset 12) (select |#length| new_ll_~head~0.base))) (and (= 0 |new_ll_#t~ret3.offset|) (= |new_ll_#t~ret3.base| 0)))} call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; {913#(or (and (= (select (select |#memory_$Pointer$.base| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0) (= (select (select |#memory_$Pointer$.offset| |new_ll_#res.base|) (+ |new_ll_#res.offset| 4)) 0)) (not (<= (+ |new_ll_#res.offset| 12) (select |#length| |new_ll_#res.base|))))} is VALID [2022-02-21 03:33:54,768 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} {812#true} #53#return; {920#(or (not (<= (+ new_ll_~head~0.offset 12) (select |#length| new_ll_~head~0.base))) (and (= 0 |new_ll_#t~ret3.offset|) (= |new_ll_#t~ret3.base| 0)))} is VALID [2022-02-21 03:33:54,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} assume true; {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:54,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {812#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {834#(and (<= |new_ll_#res.base| 0) (<= 0 |new_ll_#res.base|) (= |new_ll_#res.offset| 0))} is VALID [2022-02-21 03:33:54,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {812#true} ~n := #in~n; {812#true} is VALID [2022-02-21 03:33:54,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {812#true} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {812#true} is VALID [2022-02-21 03:33:54,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {812#true} assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); {812#true} is VALID [2022-02-21 03:33:54,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {812#true} ~n := #in~n; {812#true} is VALID [2022-02-21 03:33:54,770 INFO L272 TraceCheckUtils]: 3: Hoare triple {812#true} call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1); {812#true} is VALID [2022-02-21 03:33:54,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {812#true} assume !(main_~n~0#1 < 1); {812#true} is VALID [2022-02-21 03:33:54,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {812#true} is VALID [2022-02-21 03:33:54,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {812#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {812#true} is VALID [2022-02-21 03:33:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:33:54,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355422768] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:33:54,771 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:33:54,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 19 [2022-02-21 03:33:54,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798782896] [2022-02-21 03:33:54,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:33:54,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:33:54,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:33:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:33:54,812 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-21 03:33:55,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:55,282 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-02-21 03:33:55,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:33:55,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-21 03:33:55,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:55,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2022-02-21 03:33:55,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:55,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2022-02-21 03:33:55,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-02-21 03:33:55,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-02-21 03:33:55,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2022-02-21 03:33:55,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:55,321 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-02-21 03:33:55,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2022-02-21 03:33:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-02-21 03:33:55,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:55,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 40 transitions. Second operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:33:55,323 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 40 transitions. Second operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:33:55,323 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:33:55,323 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:55,325 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-02-21 03:33:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-02-21 03:33:55,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:55,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:55,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 34 states and 40 transitions. [2022-02-21 03:33:55,325 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 34 states and 40 transitions. [2022-02-21 03:33:55,326 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:55,327 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-21 03:33:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-21 03:33:55,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:55,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:55,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:55,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:33:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-21 03:33:55,328 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-21 03:33:55,328 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-21 03:33:55,328 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:33:55,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2022-02-21 03:33:55,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:55,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:55,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:55,329 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:55,329 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:55,329 INFO L791 eck$LassoCheckResult]: Stem: 994#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 995#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1002#L574 assume !(main_~n~0#1 < 1); 990#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 1011#new_llENTRY ~n := #in~n; 1001#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 989#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 1012#new_llENTRY ~n := #in~n; 999#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 1000#new_llFINAL assume true; 1007#new_llEXIT >#53#return; 1008#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 1018#new_llFINAL assume true; 1017#new_llEXIT >#57#return; 1005#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 1006#L563 assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; 992#L569 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 993#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 1004#lengthENTRY [2022-02-21 03:33:55,329 INFO L793 eck$LassoCheckResult]: Loop: 1004#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 997#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 998#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 1004#lengthENTRY [2022-02-21 03:33:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2022-02-21 03:33:55,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:55,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039868010] [2022-02-21 03:33:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:55,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:55,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:33:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:33:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:55,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {1237#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {1223#true} is VALID [2022-02-21 03:33:55,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {1223#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {1223#true} is VALID [2022-02-21 03:33:55,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {1223#true} assume true; {1223#true} is VALID [2022-02-21 03:33:55,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1223#true} {1238#(not (= new_ll_~head~0.base 0))} #53#return; {1238#(not (= new_ll_~head~0.base 0))} is VALID [2022-02-21 03:33:55,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {1237#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {1223#true} is VALID [2022-02-21 03:33:55,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {1223#true} assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); {1238#(not (= new_ll_~head~0.base 0))} is VALID [2022-02-21 03:33:55,386 INFO L272 TraceCheckUtils]: 2: Hoare triple {1238#(not (= new_ll_~head~0.base 0))} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {1237#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:33:55,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {1237#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {1223#true} is VALID [2022-02-21 03:33:55,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {1223#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {1223#true} is VALID [2022-02-21 03:33:55,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {1223#true} assume true; {1223#true} is VALID [2022-02-21 03:33:55,387 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1223#true} {1238#(not (= new_ll_~head~0.base 0))} #53#return; {1238#(not (= new_ll_~head~0.base 0))} is VALID [2022-02-21 03:33:55,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#(not (= new_ll_~head~0.base 0))} call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1243#(not (= |new_ll_#res.base| 0))} is VALID [2022-02-21 03:33:55,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {1243#(not (= |new_ll_#res.base| 0))} assume true; {1243#(not (= |new_ll_#res.base| 0))} is VALID [2022-02-21 03:33:55,388 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1243#(not (= |new_ll_#res.base| 0))} {1223#true} #57#return; {1235#(not (= |ULTIMATE.start_main_#t~ret9#1.base| 0))} is VALID [2022-02-21 03:33:55,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {1223#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1223#true} is VALID [2022-02-21 03:33:55,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {1223#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1223#true} is VALID [2022-02-21 03:33:55,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {1223#true} assume !(main_~n~0#1 < 1); {1223#true} is VALID [2022-02-21 03:33:55,389 INFO L272 TraceCheckUtils]: 3: Hoare triple {1223#true} call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1); {1237#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:33:55,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {1237#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {1223#true} is VALID [2022-02-21 03:33:55,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {1223#true} assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); {1238#(not (= new_ll_~head~0.base 0))} is VALID [2022-02-21 03:33:55,390 INFO L272 TraceCheckUtils]: 6: Hoare triple {1238#(not (= new_ll_~head~0.base 0))} call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); {1237#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:33:55,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {1237#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~n := #in~n; {1223#true} is VALID [2022-02-21 03:33:55,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {1223#true} assume 0 == ~n;#res.base, #res.offset := 0, 0; {1223#true} is VALID [2022-02-21 03:33:55,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {1223#true} assume true; {1223#true} is VALID [2022-02-21 03:33:55,391 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1223#true} {1238#(not (= new_ll_~head~0.base 0))} #53#return; {1238#(not (= new_ll_~head~0.base 0))} is VALID [2022-02-21 03:33:55,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {1238#(not (= new_ll_~head~0.base 0))} call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1243#(not (= |new_ll_#res.base| 0))} is VALID [2022-02-21 03:33:55,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(not (= |new_ll_#res.base| 0))} assume true; {1243#(not (= |new_ll_#res.base| 0))} is VALID [2022-02-21 03:33:55,392 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1243#(not (= |new_ll_#res.base| 0))} {1223#true} #57#return; {1235#(not (= |ULTIMATE.start_main_#t~ret9#1.base| 0))} is VALID [2022-02-21 03:33:55,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {1235#(not (= |ULTIMATE.start_main_#t~ret9#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; {1236#(not (= |ULTIMATE.start_append_~x#1.base| 0))} is VALID [2022-02-21 03:33:55,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {1236#(not (= |ULTIMATE.start_append_~x#1.base| 0))} assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; {1224#false} is VALID [2022-02-21 03:33:55,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {1224#false} main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; {1224#false} is VALID [2022-02-21 03:33:55,393 INFO L272 TraceCheckUtils]: 17: Hoare triple {1224#false} call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset); {1224#false} is VALID [2022-02-21 03:33:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:33:55,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:33:55,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039868010] [2022-02-21 03:33:55,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039868010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:33:55,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:33:55,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:33:55,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439811246] [2022-02-21 03:33:55,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:33:55,394 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:33:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:55,394 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2022-02-21 03:33:55,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:55,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743753554] [2022-02-21 03:33:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:55,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:55,398 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:55,401 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:56,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:33:56,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:33:56,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:33:56,080 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:33:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:56,224 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-21 03:33:56,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:33:56,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:33:56,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:56,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2022-02-21 03:33:56,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:56,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 41 transitions. [2022-02-21 03:33:56,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-02-21 03:33:56,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-02-21 03:33:56,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2022-02-21 03:33:56,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:56,241 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-02-21 03:33:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2022-02-21 03:33:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-02-21 03:33:56,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:56,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 41 transitions. Second operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:33:56,243 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 41 transitions. Second operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:33:56,243 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:33:56,243 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:56,245 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-02-21 03:33:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-02-21 03:33:56,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:56,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:56,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 36 states and 41 transitions. [2022-02-21 03:33:56,246 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 36 states and 41 transitions. [2022-02-21 03:33:56,246 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:56,247 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-02-21 03:33:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-02-21 03:33:56,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:56,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:56,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:56,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:33:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-02-21 03:33:56,249 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-02-21 03:33:56,249 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-02-21 03:33:56,249 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:33:56,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2022-02-21 03:33:56,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:33:56,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:56,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:56,249 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:56,249 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:56,250 INFO L791 eck$LassoCheckResult]: Stem: 1291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1299#L574 assume !(main_~n~0#1 < 1); 1289#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 1309#new_llENTRY ~n := #in~n; 1298#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 1288#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 1310#new_llENTRY ~n := #in~n; 1296#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 1297#new_llFINAL assume true; 1305#new_llEXIT >#53#return; 1306#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 1315#new_llFINAL assume true; 1312#new_llEXIT >#57#return; 1302#L577-1 main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset; 1303#L563 assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset; 1313#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~x#1.base, 4 + append_~x#1.offset, 8); 1304#L566-1 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset; 1293#L566-4 call write~$Pointer$(append_~y#1.base, append_~y#1.offset, append_~x#1.base, 4 + append_~x#1.offset, 8);append_#res#1.base, append_#res#1.offset := append_~s~0#1.base, append_~s~0#1.offset; 1285#L569 main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset; 1286#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 1300#lengthENTRY [2022-02-21 03:33:56,267 INFO L793 eck$LassoCheckResult]: Loop: 1300#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 1294#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 1295#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 1300#lengthENTRY [2022-02-21 03:33:56,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2022-02-21 03:33:56,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:56,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505154171] [2022-02-21 03:33:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:56,284 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:56,295 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 3 times [2022-02-21 03:33:56,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:56,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129426142] [2022-02-21 03:33:56,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:56,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:56,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:56,301 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:56,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:56,302 INFO L85 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2022-02-21 03:33:56,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:56,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973262829] [2022-02-21 03:33:56,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:56,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:56,316 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:56,328 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:59,002 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret9 := new_ll(~n~0); [2022-02-21 03:33:59,003 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.NonterminatingLassoResult.getLongDescription(NonterminatingLassoResult.java:69) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:374) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.interpretAndReportResult(BuchiAutomizerObserver.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:33:59,021 INFO L158 Benchmark]: Toolchain (without parser) took 11519.17ms. Allocated memory was 115.3MB in the beginning and 148.9MB in the end (delta: 33.6MB). Free memory was 84.5MB in the beginning and 79.7MB in the end (delta: 4.8MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2022-02-21 03:33:59,021 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:33:59,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.28ms. Allocated memory is still 115.3MB. Free memory was 84.1MB in the beginning and 81.9MB in the end (delta: 2.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:33:59,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.49ms. Allocated memory is still 115.3MB. Free memory was 81.9MB in the beginning and 80.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:33:59,022 INFO L158 Benchmark]: Boogie Preprocessor took 41.36ms. Allocated memory is still 115.3MB. Free memory was 80.0MB in the beginning and 78.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:33:59,022 INFO L158 Benchmark]: RCFGBuilder took 324.76ms. Allocated memory is still 115.3MB. Free memory was 78.2MB in the beginning and 64.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:33:59,024 INFO L158 Benchmark]: BuchiAutomizer took 10745.42ms. Allocated memory was 115.3MB in the beginning and 148.9MB in the end (delta: 33.6MB). Free memory was 64.9MB in the beginning and 79.7MB in the end (delta: -14.7MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2022-02-21 03:33:59,025 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.14ms. Allocated memory is still 81.8MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.28ms. Allocated memory is still 115.3MB. Free memory was 84.1MB in the beginning and 81.9MB in the end (delta: 2.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.49ms. Allocated memory is still 115.3MB. Free memory was 81.9MB in the beginning and 80.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.36ms. Allocated memory is still 115.3MB. Free memory was 80.0MB in the beginning and 78.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 324.76ms. Allocated memory is still 115.3MB. Free memory was 78.2MB in the beginning and 64.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 10745.42ms. Allocated memory was 115.3MB in the beginning and 148.9MB in the end (delta: 33.6MB). Free memory was 64.9MB in the beginning and 79.7MB in the end (delta: -14.7MB). Peak memory consumption was 67.0MB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 20 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 4. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 339 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 315 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 81 mSDtfsCounter, 315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital143 mio100 ax100 hnf100 lsp95 ukn30 mio100 lsp40 div100 bol100 ite100 ukn100 eq217 hnf86 smp100 dnf121 smp100 tf100 neg92 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=22069} State at position 1 is {x=0, NULL=0, y=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@564035b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@794b3c8e=0, NULL=22069, xs=0, y=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35e8d0fe=0, \result=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1886a071=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@18d1225a=0, n=0, x=0, s=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35e8d0fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@564035b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c0b2cc5=0, s=0, x=0, \result=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@45356881=0, y=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@18d1225a=0, xs=22068, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@45356881=0, NULL=0, y=0, xs=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ad0cd07=0, y_length=0, \result=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@794b3c8e=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:33:59,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-02-21 03:33:59,277 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator