./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/diff-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/diff-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5cc33a4b6801f9f06dbbb17ff694aba4439c76c6a2b62ec290c2132cc01ea0fe --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:53:25,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:53:25,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:53:25,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:53:25,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:53:25,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:53:25,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:53:25,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:53:25,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:53:25,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:53:25,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:53:25,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:53:25,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:53:25,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:53:25,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:53:25,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:53:25,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:53:25,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:53:25,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:53:25,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:53:25,885 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:53:25,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:53:25,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:53:25,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:53:25,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:53:25,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:53:25,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:53:25,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:53:25,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:53:25,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:53:25,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:53:25,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:53:25,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:53:25,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:53:25,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:53:25,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:53:25,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:53:25,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:53:25,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:53:25,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:53:25,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:53:25,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:53:25,898 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:53:25,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:53:25,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:53:25,912 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:53:25,912 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:53:25,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:53:25,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:53:25,913 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:53:25,914 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:53:25,914 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:53:25,914 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:53:25,914 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:53:25,914 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:53:25,914 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:53:25,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:53:25,915 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:53:25,915 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:53:25,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:53:25,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:53:25,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:53:25,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:53:25,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:53:25,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:53:25,916 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:53:25,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:53:25,916 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:53:25,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:53:25,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:53:25,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:53:25,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:53:25,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:53:25,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:53:25,918 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:53:25,918 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5cc33a4b6801f9f06dbbb17ff694aba4439c76c6a2b62ec290c2132cc01ea0fe [2022-07-13 04:53:26,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:53:26,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:53:26,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:53:26,133 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:53:26,133 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:53:26,134 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2022-07-13 04:53:26,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c48358e0/171567704f9f44e382e55046e46ab84c/FLAG35ab8ec83 [2022-07-13 04:53:26,510 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:53:26,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2022-07-13 04:53:26,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c48358e0/171567704f9f44e382e55046e46ab84c/FLAG35ab8ec83 [2022-07-13 04:53:26,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c48358e0/171567704f9f44e382e55046e46ab84c [2022-07-13 04:53:26,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:53:26,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:53:26,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:53:26,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:53:26,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:53:26,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:53:26" (1/1) ... [2022-07-13 04:53:26,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@83e6ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:26, skipping insertion in model container [2022-07-13 04:53:26,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:53:26" (1/1) ... [2022-07-13 04:53:26,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:53:26,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:53:27,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:53:27,151 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:53:27,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:53:27,203 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:53:27,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27 WrapperNode [2022-07-13 04:53:27,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:53:27,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:53:27,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:53:27,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:53:27,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27" (1/1) ... [2022-07-13 04:53:27,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27" (1/1) ... [2022-07-13 04:53:27,240 INFO L137 Inliner]: procedures = 116, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2022-07-13 04:53:27,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:53:27,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:53:27,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:53:27,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:53:27,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27" (1/1) ... [2022-07-13 04:53:27,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27" (1/1) ... [2022-07-13 04:53:27,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27" (1/1) ... [2022-07-13 04:53:27,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27" (1/1) ... [2022-07-13 04:53:27,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27" (1/1) ... [2022-07-13 04:53:27,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27" (1/1) ... [2022-07-13 04:53:27,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27" (1/1) ... [2022-07-13 04:53:27,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:53:27,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:53:27,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:53:27,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:53:27,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27" (1/1) ... [2022-07-13 04:53:27,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:27,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:27,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:27,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 04:53:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 04:53:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 04:53:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 04:53:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:53:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:53:27,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:53:27,370 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:53:27,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:53:27,539 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:53:27,543 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:53:27,543 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 04:53:27,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:53:27 BoogieIcfgContainer [2022-07-13 04:53:27,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:53:27,545 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:53:27,545 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:53:27,547 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:53:27,548 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:27,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:53:26" (1/3) ... [2022-07-13 04:53:27,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50fc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:53:27, skipping insertion in model container [2022-07-13 04:53:27,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:27,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:53:27" (2/3) ... [2022-07-13 04:53:27,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50fc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:53:27, skipping insertion in model container [2022-07-13 04:53:27,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:53:27,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:53:27" (3/3) ... [2022-07-13 04:53:27,551 INFO L354 chiAutomizerObserver]: Analyzing ICFG diff-alloca-2.i [2022-07-13 04:53:27,583 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:53:27,584 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:53:27,584 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:53:27,584 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:53:27,584 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:53:27,584 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:53:27,584 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:53:27,585 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:53:27,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:27,598 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-13 04:53:27,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:27,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:27,602 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:53:27,602 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:27,602 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:53:27,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:27,604 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-13 04:53:27,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:27,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:27,605 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:53:27,605 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:27,609 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 3#L539true assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 19#L539-2true assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 6#L542-1true call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 7#L549-3true [2022-07-13 04:53:27,609 INFO L754 eck$LassoCheckResult]: Loop: 7#L549-3true assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 17#L549-2true main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 7#L549-3true [2022-07-13 04:53:27,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:27,635 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-07-13 04:53:27,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:27,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974686030] [2022-07-13 04:53:27,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:27,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:27,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:27,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:27,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-07-13 04:53:27,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:27,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901012278] [2022-07-13 04:53:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:27,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:27,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:27,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:27,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:27,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-07-13 04:53:27,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:27,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933677675] [2022-07-13 04:53:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:27,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:27,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:27,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:28,406 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:28,407 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:28,407 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:28,407 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:28,407 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:28,407 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:28,408 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:28,408 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:28,408 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration1_Lasso [2022-07-13 04:53:28,408 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:28,408 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:28,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:28,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:29,036 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:29,039 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:29,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 04:53:29,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-07-13 04:53:29,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:29,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:29,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:29,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 04:53:29,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:29,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-13 04:53:29,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 04:53:29,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:29,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:29,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:29,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:29,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-13 04:53:29,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,236 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 04:53:29,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:29,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,274 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 04:53:29,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-07-13 04:53:29,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,335 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 04:53:29,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:29,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,378 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 04:53:29,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:29,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,443 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 04:53:29,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:29,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:29,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:29,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:29,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,470 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 04:53:29,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:29,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-13 04:53:29,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,514 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 04:53:29,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:29,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,567 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 04:53:29,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:29,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:29,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:29,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:29,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-13 04:53:29,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,598 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 04:53:29,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:29,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:29,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,656 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 04:53:29,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:29,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:29,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:29,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:29,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:29,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:29,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:29,697 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:29,714 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-13 04:53:29,715 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-13 04:53:29,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:29,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:29,718 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:29,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 04:53:29,720 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:29,741 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 04:53:29,741 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:29,741 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~A~0#1.base)_1) = -4*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~A~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~A~0#1.offset >= 0] [2022-07-13 04:53:29,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-13 04:53:29,811 INFO L293 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2022-07-13 04:53:29,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:29,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:29,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:53:29,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:29,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 04:53:29,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:29,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 04:53:29,955 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:30,025 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 75 transitions. Complement of second has 7 states. [2022-07-13 04:53:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:53:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-07-13 04:53:30,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-13 04:53:30,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:30,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 04:53:30,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:30,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-13 04:53:30,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:30,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 75 transitions. [2022-07-13 04:53:30,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 04:53:30,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 17 states and 25 transitions. [2022-07-13 04:53:30,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-13 04:53:30,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-13 04:53:30,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2022-07-13 04:53:30,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:30,046 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-13 04:53:30,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2022-07-13 04:53:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-13 04:53:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2022-07-13 04:53:30,063 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-13 04:53:30,063 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-13 04:53:30,063 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:53:30,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2022-07-13 04:53:30,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 04:53:30,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:30,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:30,064 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:30,064 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:30,065 INFO L752 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 165#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 166#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 173#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 169#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 170#L549-4 main_~i~2#1 := 0; 174#L554-3 [2022-07-13 04:53:30,065 INFO L754 eck$LassoCheckResult]: Loop: 174#L554-3 assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; 181#L554-2 main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 174#L554-3 [2022-07-13 04:53:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-07-13 04:53:30,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440985997] [2022-07-13 04:53:30,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:30,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:30,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440985997] [2022-07-13 04:53:30,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440985997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:53:30,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:53:30,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:53:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919524989] [2022-07-13 04:53:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:53:30,145 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:53:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-07-13 04:53:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657313516] [2022-07-13 04:53:30,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,155 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:30,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:53:30,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:53:30,200 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:30,223 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-07-13 04:53:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 04:53:30,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2022-07-13 04:53:30,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 04:53:30,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2022-07-13 04:53:30,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-13 04:53:30,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-13 04:53:30,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-07-13 04:53:30,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:30,228 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-13 04:53:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-07-13 04:53:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-07-13 04:53:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2022-07-13 04:53:30,232 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-07-13 04:53:30,233 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-07-13 04:53:30,233 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:53:30,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2022-07-13 04:53:30,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 04:53:30,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:30,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:30,238 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:30,238 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:53:30,238 INFO L752 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 207#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 208#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 211#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 212#L549-3 assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 213#L549-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 214#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 215#L549-4 main_~i~2#1 := 0; 216#L554-3 [2022-07-13 04:53:30,238 INFO L754 eck$LassoCheckResult]: Loop: 216#L554-3 assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; 223#L554-2 main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 216#L554-3 [2022-07-13 04:53:30,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2022-07-13 04:53:30,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56785842] [2022-07-13 04:53:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,270 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2022-07-13 04:53:30,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552888555] [2022-07-13 04:53:30,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:30,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2022-07-13 04:53:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:30,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949798966] [2022-07-13 04:53:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:30,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:30,746 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:30,747 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:30,747 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:30,747 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:30,747 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:30,747 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:30,747 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:30,747 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:30,747 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration3_Lasso [2022-07-13 04:53:30,747 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:30,747 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:30,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:30,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:30,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-07-13 04:53:30,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:30,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:30,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:31,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:31,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:31,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:31,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:31,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:31,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:31,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:31,300 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:53:31,300 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:53:31,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:31,301 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:31,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:31,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:31,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:31,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:31,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:31,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:31,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:31,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:31,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-13 04:53:31,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:31,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:31,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:31,354 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:31,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-13 04:53:31,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:31,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:31,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:31,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:31,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:31,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:31,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:31,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:31,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:31,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:31,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:31,399 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:31,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-13 04:53:31,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:31,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:31,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:31,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:31,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:31,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:31,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:31,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:31,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:31,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:31,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:31,431 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:31,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-13 04:53:31,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:31,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:31,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:31,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:31,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:31,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:31,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:31,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:31,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:31,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:31,473 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:31,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:31,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:31,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:31,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:31,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:31,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:31,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:31,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-13 04:53:31,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:31,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:31,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:31,523 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:31,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-13 04:53:31,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:31,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:31,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:31,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:31,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:31,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:31,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:31,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:31,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:31,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:31,573 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:31,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-13 04:53:31,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:31,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:31,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:53:31,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:31,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:31,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:31,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:53:31,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:53:31,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:31,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:31,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:31,603 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:31,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-13 04:53:31,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:31,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:31,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:31,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:31,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:31,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:31,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:31,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:31,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-13 04:53:31,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:31,646 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:31,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-13 04:53:31,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:31,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:31,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:31,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:31,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:31,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:31,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:31,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:53:31,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:31,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:31,736 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:31,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-13 04:53:31,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:53:31,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:53:31,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:53:31,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:53:31,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:53:31,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:53:31,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:53:31,785 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:53:31,821 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-13 04:53:31,821 INFO L444 ModelExtractionUtils]: 13 out of 43 variables were initially zero. Simplification set additionally 27 variables to zero. [2022-07-13 04:53:31,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:31,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:53:31,827 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:53:31,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 04:53:31,829 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:53:31,836 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:53:31,836 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:53:31,836 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_~Blen~0#1) = -1*ULTIMATE.start_main_~i~2#1 + 1*ULTIMATE.start_main_~Blen~0#1 Supporting invariants [] [2022-07-13 04:53:31,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:31,904 INFO L293 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-13 04:53:31,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:31,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:53:31,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:31,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-13 04:53:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:31,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:53:31,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:53:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:31,977 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 04:53:31,977 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:31,997 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 39 transitions. Complement of second has 6 states. [2022-07-13 04:53:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:53:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-07-13 04:53:32,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-13 04:53:32,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:32,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-13 04:53:32,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:32,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-13 04:53:32,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:53:32,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2022-07-13 04:53:32,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 04:53:32,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2022-07-13 04:53:32,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 04:53:32,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-13 04:53:32,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2022-07-13 04:53:32,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:32,004 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-07-13 04:53:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2022-07-13 04:53:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-13 04:53:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2022-07-13 04:53:32,005 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-07-13 04:53:32,005 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-07-13 04:53:32,006 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:53:32,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2022-07-13 04:53:32,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 04:53:32,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:32,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:32,006 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:32,007 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:53:32,007 INFO L752 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 361#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 362#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 365#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 366#L549-3 assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 367#L549-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 368#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 369#L549-4 main_~i~2#1 := 0; 370#L554-3 assume !(main_~i~2#1 < main_~Blen~0#1); 373#L554-4 assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 371#L519-2 [2022-07-13 04:53:32,007 INFO L754 eck$LassoCheckResult]: Loop: 371#L519-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 372#L523-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 374#L522-2 assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1; 375#L529-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 371#L519-2 [2022-07-13 04:53:32,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2022-07-13 04:53:32,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:32,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643815740] [2022-07-13 04:53:32,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:32,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 04:53:32,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:32,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643815740] [2022-07-13 04:53:32,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643815740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:53:32,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:53:32,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:53:32,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128357270] [2022-07-13 04:53:32,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:53:32,056 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:53:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:32,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 1 times [2022-07-13 04:53:32,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:32,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077828553] [2022-07-13 04:53:32,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,064 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:32,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:32,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:53:32,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:53:32,161 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:32,180 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-07-13 04:53:32,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 04:53:32,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2022-07-13 04:53:32,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 04:53:32,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2022-07-13 04:53:32,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-13 04:53:32,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-13 04:53:32,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-07-13 04:53:32,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:32,183 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-13 04:53:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-07-13 04:53:32,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-07-13 04:53:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-07-13 04:53:32,186 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-13 04:53:32,186 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-13 04:53:32,186 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:53:32,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-07-13 04:53:32,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 04:53:32,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:32,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:32,188 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:32,188 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:53:32,188 INFO L752 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 405#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 406#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 409#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 410#L549-3 assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 411#L549-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 412#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 413#L549-4 main_~i~2#1 := 0; 414#L554-3 assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; 421#L554-2 main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 422#L554-3 assume !(main_~i~2#1 < main_~Blen~0#1); 417#L554-4 assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 415#L519-2 [2022-07-13 04:53:32,189 INFO L754 eck$LassoCheckResult]: Loop: 415#L519-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 416#L523-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 418#L522-2 assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1; 419#L529-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 415#L519-2 [2022-07-13 04:53:32,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:32,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2022-07-13 04:53:32,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:32,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597260654] [2022-07-13 04:53:32,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:32,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,222 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 2 times [2022-07-13 04:53:32,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:32,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384660137] [2022-07-13 04:53:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:32,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:32,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:32,252 INFO L85 PathProgramCache]: Analyzing trace with hash -796463931, now seen corresponding path program 1 times [2022-07-13 04:53:32,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:32,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125235506] [2022-07-13 04:53:32,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:32,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 04:53:32,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:32,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125235506] [2022-07-13 04:53:32,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125235506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:53:32,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:53:32,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:53:32,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766993096] [2022-07-13 04:53:32,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:53:32,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:32,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:53:32,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:53:32,368 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:32,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:32,398 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2022-07-13 04:53:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:53:32,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2022-07-13 04:53:32,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 04:53:32,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2022-07-13 04:53:32,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-13 04:53:32,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-13 04:53:32,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2022-07-13 04:53:32,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:32,402 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-13 04:53:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2022-07-13 04:53:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-13 04:53:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-07-13 04:53:32,404 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-13 04:53:32,404 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-13 04:53:32,404 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 04:53:32,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-07-13 04:53:32,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 04:53:32,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:32,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:32,405 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:32,405 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:53:32,405 INFO L752 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 460#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 457#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 458#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 461#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 462#L549-3 assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 463#L549-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 464#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 465#L549-4 main_~i~2#1 := 0; 466#L554-3 assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; 474#L554-2 main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 475#L554-3 assume !(main_~i~2#1 < main_~Blen~0#1); 469#L554-4 assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 467#L519-2 [2022-07-13 04:53:32,405 INFO L754 eck$LassoCheckResult]: Loop: 467#L519-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 468#L523-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 472#L523 assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; 473#L523-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 470#L522-2 assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1; 471#L529-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 467#L519-2 [2022-07-13 04:53:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:32,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 2 times [2022-07-13 04:53:32,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:32,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477992] [2022-07-13 04:53:32,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,418 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1860447319, now seen corresponding path program 1 times [2022-07-13 04:53:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:32,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856327004] [2022-07-13 04:53:32,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:32,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:53:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:53:32,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:53:32,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856327004] [2022-07-13 04:53:32,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856327004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:53:32,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:53:32,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:53:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976450707] [2022-07-13 04:53:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:53:32,442 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:53:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:53:32,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:53:32,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:53:32,443 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:53:32,460 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-07-13 04:53:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:53:32,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2022-07-13 04:53:32,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-13 04:53:32,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2022-07-13 04:53:32,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-13 04:53:32,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-13 04:53:32,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2022-07-13 04:53:32,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:53:32,462 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-13 04:53:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2022-07-13 04:53:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-13 04:53:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:53:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-07-13 04:53:32,463 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-13 04:53:32,463 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-13 04:53:32,463 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 04:53:32,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-07-13 04:53:32,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-13 04:53:32,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:53:32,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:53:32,464 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:53:32,464 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:53:32,465 INFO L752 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 513#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 510#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 511#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 514#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 515#L549-3 assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 516#L549-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 517#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 518#L549-4 main_~i~2#1 := 0; 519#L554-3 assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; 528#L554-2 main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 529#L554-3 assume !(main_~i~2#1 < main_~Blen~0#1); 522#L554-4 assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 520#L519-2 [2022-07-13 04:53:32,465 INFO L754 eck$LassoCheckResult]: Loop: 520#L519-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 521#L523-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 525#L523 assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; 526#L523-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 523#L522-2 assume !(0 == diff_~found~0#1); 524#L529-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 520#L519-2 [2022-07-13 04:53:32,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:32,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 3 times [2022-07-13 04:53:32,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:32,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203704157] [2022-07-13 04:53:32,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:32,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,476 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:32,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:32,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1860447257, now seen corresponding path program 1 times [2022-07-13 04:53:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:32,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251561903] [2022-07-13 04:53:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:32,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,489 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:32,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:53:32,492 INFO L85 PathProgramCache]: Analyzing trace with hash -896094976, now seen corresponding path program 1 times [2022-07-13 04:53:32,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:53:32,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943957906] [2022-07-13 04:53:32,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:53:32,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:53:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:53:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:53:32,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:53:33,324 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:53:33,324 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:53:33,324 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:53:33,324 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:53:33,324 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:53:33,325 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:53:33,325 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:53:33,325 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:53:33,325 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration7_Lasso [2022-07-13 04:53:33,325 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:53:33,325 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:53:33,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:53:33,471 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) 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-07-13 04:53:33,474 INFO L158 Benchmark]: Toolchain (without parser) took 6558.24ms. Allocated memory was 100.7MB in the beginning and 167.8MB in the end (delta: 67.1MB). Free memory was 60.0MB in the beginning and 57.3MB in the end (delta: 2.7MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2022-07-13 04:53:33,475 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:53:33,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.14ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 59.8MB in the beginning and 98.2MB in the end (delta: -38.4MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-07-13 04:53:33,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 125.8MB. Free memory was 98.2MB in the beginning and 96.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:53:33,478 INFO L158 Benchmark]: Boogie Preprocessor took 17.49ms. Allocated memory is still 125.8MB. Free memory was 96.8MB in the beginning and 94.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:53:33,478 INFO L158 Benchmark]: RCFGBuilder took 285.84ms. Allocated memory is still 125.8MB. Free memory was 94.7MB in the beginning and 97.3MB in the end (delta: -2.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 04:53:33,478 INFO L158 Benchmark]: BuchiAutomizer took 5928.64ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 97.3MB in the beginning and 57.3MB in the end (delta: 40.0MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. [2022-07-13 04:53:33,479 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.14ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 59.8MB in the beginning and 98.2MB in the end (delta: -38.4MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 125.8MB. Free memory was 98.2MB in the beginning and 96.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.49ms. Allocated memory is still 125.8MB. Free memory was 96.8MB in the beginning and 94.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 285.84ms. Allocated memory is still 125.8MB. Free memory was 94.7MB in the beginning and 97.3MB in the end (delta: -2.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5928.64ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 97.3MB in the beginning and 57.3MB in the end (delta: 40.0MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 04:53:33,505 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*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null