./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 ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-dev-ae00767 [2021-12-28 09:55:37,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 09:55:37,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 09:55:37,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 09:55:37,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 09:55:37,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 09:55:37,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 09:55:37,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 09:55:37,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 09:55:37,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 09:55:37,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 09:55:37,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 09:55:37,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 09:55:37,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 09:55:37,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 09:55:37,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 09:55:37,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 09:55:37,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 09:55:37,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 09:55:37,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 09:55:37,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 09:55:37,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 09:55:37,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 09:55:37,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 09:55:37,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 09:55:37,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 09:55:37,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 09:55:37,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 09:55:37,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 09:55:37,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 09:55:37,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 09:55:37,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 09:55:37,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 09:55:37,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 09:55:37,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 09:55:37,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 09:55:37,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 09:55:37,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 09:55:37,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 09:55:37,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 09:55:37,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 09:55:37,958 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-28 09:55:37,987 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 09:55:37,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 09:55:37,988 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 09:55:37,988 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 09:55:37,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 09:55:37,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 09:55:37,989 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 09:55:37,989 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-28 09:55:37,990 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-28 09:55:37,990 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-28 09:55:37,990 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-28 09:55:37,991 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-28 09:55:37,991 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-28 09:55:37,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 09:55:37,991 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 09:55:37,991 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 09:55:37,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 09:55:37,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 09:55:37,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 09:55:37,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-28 09:55:37,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-28 09:55:37,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-28 09:55:37,993 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 09:55:37,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 09:55:37,993 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-28 09:55:37,993 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 09:55:37,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-28 09:55:37,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 09:55:37,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 09:55:37,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 09:55:37,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 09:55:37,995 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-28 09:55:37,995 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 [2021-12-28 09:55:38,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 09:55:38,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 09:55:38,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 09:55:38,289 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 09:55:38,289 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 09:55:38,290 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 [2021-12-28 09:55:38,354 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2fbe115/67dcc2c79cf7458ba16968f57e8ee143/FLAG58c0cff9f [2021-12-28 09:55:38,808 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 09:55:38,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2021-12-28 09:55:38,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2fbe115/67dcc2c79cf7458ba16968f57e8ee143/FLAG58c0cff9f [2021-12-28 09:55:38,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2fbe115/67dcc2c79cf7458ba16968f57e8ee143 [2021-12-28 09:55:38,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 09:55:38,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 09:55:38,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 09:55:38,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 09:55:38,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 09:55:38,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:55:38" (1/1) ... [2021-12-28 09:55:38,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d7b591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:38, skipping insertion in model container [2021-12-28 09:55:38,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:55:38" (1/1) ... [2021-12-28 09:55:38,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 09:55:38,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 09:55:39,137 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:55:39,145 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 09:55:39,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:55:39,205 INFO L208 MainTranslator]: Completed translation [2021-12-28 09:55:39,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39 WrapperNode [2021-12-28 09:55:39,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 09:55:39,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 09:55:39,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 09:55:39,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 09:55:39,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39" (1/1) ... [2021-12-28 09:55:39,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39" (1/1) ... [2021-12-28 09:55:39,244 INFO L137 Inliner]: procedures = 116, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2021-12-28 09:55:39,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 09:55:39,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 09:55:39,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 09:55:39,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 09:55:39,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39" (1/1) ... [2021-12-28 09:55:39,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39" (1/1) ... [2021-12-28 09:55:39,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39" (1/1) ... [2021-12-28 09:55:39,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39" (1/1) ... [2021-12-28 09:55:39,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39" (1/1) ... [2021-12-28 09:55:39,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39" (1/1) ... [2021-12-28 09:55:39,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39" (1/1) ... [2021-12-28 09:55:39,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 09:55:39,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 09:55:39,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 09:55:39,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 09:55:39,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39" (1/1) ... [2021-12-28 09:55:39,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:39,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:39,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:39,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-28 09:55:39,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 09:55:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 09:55:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 09:55:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 09:55:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 09:55:39,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 09:55:39,419 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 09:55:39,421 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 09:55:39,609 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 09:55:39,613 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 09:55:39,613 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-28 09:55:39,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:55:39 BoogieIcfgContainer [2021-12-28 09:55:39,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 09:55:39,616 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-28 09:55:39,616 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-28 09:55:39,618 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-28 09:55:39,618 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:55:39,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.12 09:55:38" (1/3) ... [2021-12-28 09:55:39,619 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11200d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:55:39, skipping insertion in model container [2021-12-28 09:55:39,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:55:39,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:55:39" (2/3) ... [2021-12-28 09:55:39,620 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11200d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:55:39, skipping insertion in model container [2021-12-28 09:55:39,620 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:55:39,620 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:55:39" (3/3) ... [2021-12-28 09:55:39,621 INFO L388 chiAutomizerObserver]: Analyzing ICFG diff-alloca-2.i [2021-12-28 09:55:39,660 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-28 09:55:39,661 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-28 09:55:39,661 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-28 09:55:39,661 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-28 09:55:39,661 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-28 09:55:39,661 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-28 09:55:39,661 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-28 09:55:39,661 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-28 09:55:39,690 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) [2021-12-28 09:55:39,704 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-28 09:55:39,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:55:39,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:55:39,708 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-28 09:55:39,708 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-28 09:55:39,708 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-28 09:55:39,709 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) [2021-12-28 09:55:39,711 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-28 09:55:39,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:55:39,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:55:39,712 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-28 09:55:39,712 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-28 09:55:39,717 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#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; 4#L539true assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 20#L539-2true assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 7#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; 8#L549-3true [2021-12-28 09:55:39,718 INFO L793 eck$LassoCheckResult]: Loop: 8#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; 18#L549-2true main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 8#L549-3true [2021-12-28 09:55:39,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2021-12-28 09:55:39,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:39,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633869246] [2021-12-28 09:55:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:39,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:39,836 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:39,882 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:39,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2021-12-28 09:55:39,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:39,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259847737] [2021-12-28 09:55:39,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:39,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:39,902 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:39,908 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:39,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:39,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2021-12-28 09:55:39,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:39,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011190237] [2021-12-28 09:55:39,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:39,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:39,927 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:39,941 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:40,338 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:55:40,339 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:55:40,339 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:55:40,339 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:55:40,339 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:55:40,339 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:40,339 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:55:40,339 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:55:40,339 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration1_Lasso [2021-12-28 09:55:40,340 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:55:40,340 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:55:40,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:40,910 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:55:40,912 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:55:40,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:40,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:40,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:40,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-28 09:55:40,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:40,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:40,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:55:40,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:40,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:40,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:40,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:55:40,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:55:40,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:40,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:40,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:40,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:40,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:40,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-28 09:55:40,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:40,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:40,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:40,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:40,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:40,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:40,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:40,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:41,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:41,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:41,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:41,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:41,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-28 09:55:41,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:41,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:41,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:55:41,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:41,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:41,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:41,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:55:41,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:55:41,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:41,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:41,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:41,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:41,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:41,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-28 09:55:41,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:41,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:41,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:41,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:41,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:41,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:41,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:41,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:41,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:41,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:41,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:41,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:41,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-28 09:55:41,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:41,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:41,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:41,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:41,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:41,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:41,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:41,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:41,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:41,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:41,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:41,151 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:41,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-28 09:55:41,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:41,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:41,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:55:41,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:41,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:41,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:41,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:55:41,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:55:41,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:41,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-28 09:55:41,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:41,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:41,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:41,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-28 09:55:41,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:41,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:41,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:41,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:41,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:41,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:41,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:41,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:41,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:41,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:41,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:41,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:41,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-28 09:55:41,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:41,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:41,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:41,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:41,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:41,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:41,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:41,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:41,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:41,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:41,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:41,309 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:41,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-28 09:55:41,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:41,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:41,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:41,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:41,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:41,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:41,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:41,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:41,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:41,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:41,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:41,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:41,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:41,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:41,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:55:41,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:41,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:41,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:41,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:55:41,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:55:41,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-28 09:55:41,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:41,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:41,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:41,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:41,396 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:41,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-28 09:55:41,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:41,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:41,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:41,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:41,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:41,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:41,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:41,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:41,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:41,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:41,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:41,427 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:41,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-28 09:55:41,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:41,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:41,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:41,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:41,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:41,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:41,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:41,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:55:41,528 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2021-12-28 09:55:41,528 INFO L444 ModelExtractionUtils]: 5 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-12-28 09:55:41,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:41,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:41,559 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:41,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-28 09:55:41,594 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:55:41,601 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-28 09:55:41,601 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:55:41,602 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] [2021-12-28 09:55:41,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:41,649 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2021-12-28 09:55:41,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:55:41,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:55:41,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:55:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:55:41,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 09:55:41,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:55:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:55:41,755 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-28 09:55:41,756 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) [2021-12-28 09:55:41,820 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. [2021-12-28 09:55:41,822 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 [2021-12-28 09:55:41,825 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) [2021-12-28 09:55:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2021-12-28 09:55:41,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-28 09:55:41,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:55:41,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2021-12-28 09:55:41,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:55:41,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2021-12-28 09:55:41,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:55:41,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 75 transitions. [2021-12-28 09:55:41,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:55:41,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 17 states and 25 transitions. [2021-12-28 09:55:41,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-28 09:55:41,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-28 09:55:41,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-12-28 09:55:41,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:55:41,843 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-28 09:55:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-12-28 09:55:41,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-28 09:55:41,859 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) [2021-12-28 09:55:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-12-28 09:55:41,861 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-28 09:55:41,861 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-28 09:55:41,861 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-28 09:55:41,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-12-28 09:55:41,863 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:55:41,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:55:41,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:55:41,864 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:55:41,864 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-28 09:55:41,864 INFO L791 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 [2021-12-28 09:55:41,864 INFO L793 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 [2021-12-28 09:55:41,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2021-12-28 09:55:41,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:41,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937208264] [2021-12-28 09:55:41,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:41,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:55:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:55:41,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:55:41,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937208264] [2021-12-28 09:55:41,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937208264] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:55:41,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:55:41,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 09:55:41,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657453152] [2021-12-28 09:55:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:55:41,912 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:55:41,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2021-12-28 09:55:41,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:41,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437584574] [2021-12-28 09:55:41,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:41,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:41,944 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:41,948 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:41,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:41,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:55:41,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 09:55:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 09:55:41,977 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) [2021-12-28 09:55:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:55:41,998 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2021-12-28 09:55:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 09:55:41,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2021-12-28 09:55:42,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:55:42,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2021-12-28 09:55:42,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-28 09:55:42,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-28 09:55:42,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2021-12-28 09:55:42,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:55:42,001 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2021-12-28 09:55:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2021-12-28 09:55:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-12-28 09:55:42,002 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) [2021-12-28 09:55:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2021-12-28 09:55:42,002 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2021-12-28 09:55:42,002 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2021-12-28 09:55:42,002 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-28 09:55:42,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2021-12-28 09:55:42,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:55:42,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:55:42,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:55:42,003 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:55:42,003 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-28 09:55:42,003 INFO L791 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 [2021-12-28 09:55:42,004 INFO L793 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 [2021-12-28 09:55:42,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2021-12-28 09:55:42,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:42,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221784771] [2021-12-28 09:55:42,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:42,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:42,017 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:42,027 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:42,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2021-12-28 09:55:42,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:42,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871995849] [2021-12-28 09:55:42,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:42,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:42,032 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:42,035 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:42,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2021-12-28 09:55:42,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:42,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854159504] [2021-12-28 09:55:42,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:42,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:42,064 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:42,079 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:42,511 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:55:42,511 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:55:42,511 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:55:42,511 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:55:42,511 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:55:42,511 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:42,511 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:55:42,511 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:55:42,511 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration3_Lasso [2021-12-28 09:55:42,512 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:55:42,512 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:55:42,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:42,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:43,038 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:55:43,038 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:55:43,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,039 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-28 09:55:43,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:55:43,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:55:43,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:55:43,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:43,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:43,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,086 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-28 09:55:43,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:55:43,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:55:43,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:55:43,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:43,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:43,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,151 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:43,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:43,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-28 09:55:43,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:43,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:43,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,191 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-28 09:55:43,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:55:43,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:55:43,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:55:43,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:43,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-28 09:55:43,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,218 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-28 09:55:43,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:43,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:43,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:43,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:43,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,261 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-28 09:55:43,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:55:43,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:55:43,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:55:43,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:43,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-12-28 09:55:43,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,302 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-28 09:55:43,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:43,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:43,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:43,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:43,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,329 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-28 09:55:43,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:55:43,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:55:43,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:55:43,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:43,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-28 09:55:43,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,354 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-28 09:55:43,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:43,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:43,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:43,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:43,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,391 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-28 09:55:43,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:43,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:43,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:43,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-28 09:55:43,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,429 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:43,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:43,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-28 09:55:43,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:55:43,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:43,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,480 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-28 09:55:43,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:55:43,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:55:43,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:55:43,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:55:43,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:55:43,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:55:43,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:55:43,512 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:55:43,537 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-28 09:55:43,537 INFO L444 ModelExtractionUtils]: 9 out of 43 variables were initially zero. Simplification set additionally 31 variables to zero. [2021-12-28 09:55:43,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:43,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:55:43,538 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:55:43,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-28 09:55:43,540 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:55:43,561 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-28 09:55:43,561 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:55:43,561 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 [] [2021-12-28 09:55:43,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-28 09:55:43,604 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2021-12-28 09:55:43,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:55:43,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:55:43,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:55:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:55:43,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:55:43,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:55:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:55:43,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-28 09:55:43,665 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) [2021-12-28 09:55:43,678 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. [2021-12-28 09:55:43,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-28 09:55:43,679 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) [2021-12-28 09:55:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2021-12-28 09:55:43,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2021-12-28 09:55:43,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:55:43,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2021-12-28 09:55:43,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:55:43,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2021-12-28 09:55:43,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:55:43,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2021-12-28 09:55:43,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-28 09:55:43,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2021-12-28 09:55:43,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-28 09:55:43,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-28 09:55:43,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2021-12-28 09:55:43,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:55:43,681 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2021-12-28 09:55:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2021-12-28 09:55:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-28 09:55:43,682 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) [2021-12-28 09:55:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2021-12-28 09:55:43,682 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2021-12-28 09:55:43,682 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2021-12-28 09:55:43,682 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-28 09:55:43,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2021-12-28 09:55:43,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-28 09:55:43,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:55:43,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:55:43,683 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:55:43,683 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-28 09:55:43,683 INFO L791 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 [2021-12-28 09:55:43,683 INFO L793 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 [2021-12-28 09:55:43,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:43,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2021-12-28 09:55:43,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:43,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214659410] [2021-12-28 09:55:43,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:43,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:55:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 09:55:43,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:55:43,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214659410] [2021-12-28 09:55:43,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214659410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:55:43,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:55:43,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 09:55:43,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020641867] [2021-12-28 09:55:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:55:43,717 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:55:43,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 1 times [2021-12-28 09:55:43,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:43,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202303472] [2021-12-28 09:55:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:43,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:43,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:43,740 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:43,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-28 09:55:43,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:55:43,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 09:55:43,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 09:55:43,865 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) [2021-12-28 09:55:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:55:43,880 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2021-12-28 09:55:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 09:55:43,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2021-12-28 09:55:43,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-28 09:55:43,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2021-12-28 09:55:43,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-28 09:55:43,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-28 09:55:43,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2021-12-28 09:55:43,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:55:43,882 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-28 09:55:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2021-12-28 09:55:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-12-28 09:55:43,883 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) [2021-12-28 09:55:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2021-12-28 09:55:43,883 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2021-12-28 09:55:43,883 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2021-12-28 09:55:43,883 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-28 09:55:43,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2021-12-28 09:55:43,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-28 09:55:43,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:55:43,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:55:43,884 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:55:43,884 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-28 09:55:43,884 INFO L791 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 [2021-12-28 09:55:43,884 INFO L793 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 [2021-12-28 09:55:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2021-12-28 09:55:43,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:43,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698904680] [2021-12-28 09:55:43,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:43,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:43,896 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:43,910 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:43,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:43,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 2 times [2021-12-28 09:55:43,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:43,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776623932] [2021-12-28 09:55:43,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:43,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:43,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:43,919 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:43,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash -796463931, now seen corresponding path program 1 times [2021-12-28 09:55:43,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:43,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032401684] [2021-12-28 09:55:43,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:43,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:55:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 09:55:43,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:55:43,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032401684] [2021-12-28 09:55:43,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032401684] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:55:43,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:55:43,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 09:55:43,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986579893] [2021-12-28 09:55:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:55:44,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:55:44,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 09:55:44,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 09:55:44,038 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) [2021-12-28 09:55:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:55:44,066 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2021-12-28 09:55:44,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 09:55:44,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2021-12-28 09:55:44,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-28 09:55:44,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2021-12-28 09:55:44,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-28 09:55:44,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-28 09:55:44,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2021-12-28 09:55:44,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:55:44,069 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2021-12-28 09:55:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2021-12-28 09:55:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-12-28 09:55:44,070 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) [2021-12-28 09:55:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2021-12-28 09:55:44,071 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-28 09:55:44,071 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-28 09:55:44,071 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-28 09:55:44,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2021-12-28 09:55:44,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-28 09:55:44,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:55:44,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:55:44,071 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:55:44,071 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-28 09:55:44,071 INFO L791 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 [2021-12-28 09:55:44,072 INFO L793 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 [2021-12-28 09:55:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:44,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 2 times [2021-12-28 09:55:44,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:44,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647303672] [2021-12-28 09:55:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:44,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:44,088 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:44,100 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1860447319, now seen corresponding path program 1 times [2021-12-28 09:55:44,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:44,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237823852] [2021-12-28 09:55:44,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:44,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:55:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:55:44,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:55:44,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237823852] [2021-12-28 09:55:44,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237823852] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:55:44,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:55:44,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 09:55:44,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205293346] [2021-12-28 09:55:44,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:55:44,113 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:55:44,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:55:44,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 09:55:44,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 09:55:44,114 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) [2021-12-28 09:55:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:55:44,127 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2021-12-28 09:55:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 09:55:44,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2021-12-28 09:55:44,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-28 09:55:44,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2021-12-28 09:55:44,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-28 09:55:44,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-28 09:55:44,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2021-12-28 09:55:44,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:55:44,129 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-12-28 09:55:44,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2021-12-28 09:55:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2021-12-28 09:55:44,130 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) [2021-12-28 09:55:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2021-12-28 09:55:44,130 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2021-12-28 09:55:44,130 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2021-12-28 09:55:44,130 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-28 09:55:44,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2021-12-28 09:55:44,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-28 09:55:44,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:55:44,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:55:44,131 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:55:44,131 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-28 09:55:44,131 INFO L791 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 [2021-12-28 09:55:44,131 INFO L793 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 [2021-12-28 09:55:44,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 3 times [2021-12-28 09:55:44,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:44,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946088902] [2021-12-28 09:55:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:44,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:44,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:44,167 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1860447257, now seen corresponding path program 1 times [2021-12-28 09:55:44,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:44,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732878828] [2021-12-28 09:55:44,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:44,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:44,171 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:44,174 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:44,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:55:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash -896094976, now seen corresponding path program 1 times [2021-12-28 09:55:44,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:55:44,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585039266] [2021-12-28 09:55:44,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:55:44,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:55:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:44,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:55:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:55:44,196 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:55:45,007 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:55:45,007 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:55:45,007 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:55:45,007 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:55:45,007 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:55:45,007 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:55:45,007 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:55:45,007 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:55:45,007 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration7_Lasso [2021-12-28 09:55:45,007 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:55:45,007 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:55:45,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:55:45,161 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-28 09:55:45,164 INFO L158 Benchmark]: Toolchain (without parser) took 6321.16ms. Allocated memory was 50.3MB in the beginning and 117.4MB in the end (delta: 67.1MB). Free memory was 26.7MB in the beginning and 91.8MB in the end (delta: -65.0MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2021-12-28 09:55:45,164 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 50.3MB. Free memory was 32.2MB in the beginning and 32.2MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:55:45,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.77ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 26.6MB in the beginning and 42.6MB in the end (delta: -16.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2021-12-28 09:55:45,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.73ms. Allocated memory is still 65.0MB. Free memory was 42.6MB in the beginning and 40.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 09:55:45,164 INFO L158 Benchmark]: Boogie Preprocessor took 27.31ms. Allocated memory is still 65.0MB. Free memory was 40.6MB in the beginning and 39.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 09:55:45,165 INFO L158 Benchmark]: RCFGBuilder took 341.32ms. Allocated memory is still 65.0MB. Free memory was 39.3MB in the beginning and 41.8MB in the end (delta: -2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-28 09:55:45,165 INFO L158 Benchmark]: BuchiAutomizer took 5547.18ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 41.8MB in the beginning and 91.8MB in the end (delta: -50.0MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2021-12-28 09:55:45,166 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.21ms. Allocated memory is still 50.3MB. Free memory was 32.2MB in the beginning and 32.2MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.77ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 26.6MB in the beginning and 42.6MB in the end (delta: -16.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.73ms. Allocated memory is still 65.0MB. Free memory was 42.6MB in the beginning and 40.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.31ms. Allocated memory is still 65.0MB. Free memory was 40.6MB in the beginning and 39.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.32ms. Allocated memory is still 65.0MB. Free memory was 39.3MB in the beginning and 41.8MB in the end (delta: -2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5547.18ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 41.8MB in the beginning and 91.8MB in the end (delta: -50.0MB). Peak memory consumption was 60.9MB. 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. [2021-12-28 09:55:45,188 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