./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 e19ca921 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-e19ca92 [2021-12-22 20:40:45,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 20:40:45,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 20:40:46,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 20:40:46,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 20:40:46,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 20:40:46,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 20:40:46,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 20:40:46,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 20:40:46,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 20:40:46,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 20:40:46,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 20:40:46,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 20:40:46,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 20:40:46,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 20:40:46,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 20:40:46,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 20:40:46,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 20:40:46,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 20:40:46,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 20:40:46,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 20:40:46,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 20:40:46,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 20:40:46,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 20:40:46,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 20:40:46,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 20:40:46,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 20:40:46,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 20:40:46,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 20:40:46,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 20:40:46,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 20:40:46,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 20:40:46,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 20:40:46,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 20:40:46,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 20:40:46,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 20:40:46,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 20:40:46,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 20:40:46,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 20:40:46,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 20:40:46,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 20:40:46,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-22 20:40:46,098 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 20:40:46,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 20:40:46,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 20:40:46,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 20:40:46,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 20:40:46,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 20:40:46,100 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 20:40:46,101 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-22 20:40:46,101 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-22 20:40:46,101 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-22 20:40:46,101 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-22 20:40:46,102 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-22 20:40:46,102 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-22 20:40:46,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 20:40:46,102 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 20:40:46,102 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 20:40:46,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 20:40:46,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 20:40:46,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 20:40:46,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-22 20:40:46,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-22 20:40:46,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-22 20:40:46,103 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 20:40:46,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 20:40:46,104 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-22 20:40:46,104 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 20:40:46,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-22 20:40:46,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 20:40:46,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 20:40:46,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 20:40:46,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 20:40:46,105 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 20:40:46,106 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-22 20:40:46,106 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-22 20:40:46,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 20:40:46,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 20:40:46,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 20:40:46,455 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 20:40:46,456 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 20:40:46,457 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-22 20:40:46,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9eb4c87/6aeb6deee2d548d48cf2d3b0ddea26cd/FLAG113b9d179 [2021-12-22 20:40:46,929 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 20:40:46,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2021-12-22 20:40:46,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9eb4c87/6aeb6deee2d548d48cf2d3b0ddea26cd/FLAG113b9d179 [2021-12-22 20:40:46,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9eb4c87/6aeb6deee2d548d48cf2d3b0ddea26cd [2021-12-22 20:40:46,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 20:40:46,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 20:40:46,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 20:40:46,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 20:40:46,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 20:40:46,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:40:46" (1/1) ... [2021-12-22 20:40:46,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d398812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:46, skipping insertion in model container [2021-12-22 20:40:46,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:40:46" (1/1) ... [2021-12-22 20:40:46,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 20:40:47,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 20:40:47,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:40:47,257 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 20:40:47,300 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:40:47,315 INFO L208 MainTranslator]: Completed translation [2021-12-22 20:40:47,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47 WrapperNode [2021-12-22 20:40:47,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 20:40:47,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 20:40:47,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 20:40:47,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 20:40:47,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47" (1/1) ... [2021-12-22 20:40:47,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47" (1/1) ... [2021-12-22 20:40:47,342 INFO L137 Inliner]: procedures = 116, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2021-12-22 20:40:47,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 20:40:47,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 20:40:47,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 20:40:47,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 20:40:47,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47" (1/1) ... [2021-12-22 20:40:47,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47" (1/1) ... [2021-12-22 20:40:47,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47" (1/1) ... [2021-12-22 20:40:47,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47" (1/1) ... [2021-12-22 20:40:47,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47" (1/1) ... [2021-12-22 20:40:47,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47" (1/1) ... [2021-12-22 20:40:47,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47" (1/1) ... [2021-12-22 20:40:47,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 20:40:47,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 20:40:47,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 20:40:47,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 20:40:47,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47" (1/1) ... [2021-12-22 20:40:47,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:47,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:47,400 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-22 20:40:47,404 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-22 20:40:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 20:40:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 20:40:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 20:40:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 20:40:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 20:40:47,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 20:40:47,505 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 20:40:47,506 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 20:40:47,608 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 20:40:47,611 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 20:40:47,611 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-22 20:40:47,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:40:47 BoogieIcfgContainer [2021-12-22 20:40:47,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 20:40:47,613 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-22 20:40:47,613 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-22 20:40:47,615 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-22 20:40:47,616 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:40:47,616 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 08:40:46" (1/3) ... [2021-12-22 20:40:47,617 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ca404b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:40:47, skipping insertion in model container [2021-12-22 20:40:47,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:40:47,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:40:47" (2/3) ... [2021-12-22 20:40:47,617 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ca404b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:40:47, skipping insertion in model container [2021-12-22 20:40:47,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:40:47,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:40:47" (3/3) ... [2021-12-22 20:40:47,618 INFO L388 chiAutomizerObserver]: Analyzing ICFG diff-alloca-2.i [2021-12-22 20:40:47,652 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-22 20:40:47,652 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-22 20:40:47,652 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-22 20:40:47,652 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-22 20:40:47,652 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-22 20:40:47,653 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-22 20:40:47,653 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-22 20:40:47,653 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-22 20:40:47,662 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-22 20:40:47,673 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-22 20:40:47,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:40:47,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:40:47,677 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-22 20:40:47,677 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 20:40:47,677 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-22 20:40:47,677 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-22 20:40:47,679 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-22 20:40:47,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:40:47,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:40:47,679 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-22 20:40:47,679 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 20:40:47,687 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-22 20:40:47,687 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-22 20:40:47,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:47,691 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2021-12-22 20:40:47,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611418398] [2021-12-22 20:40:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:47,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:47,811 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:47,836 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:47,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:47,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2021-12-22 20:40:47,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:47,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054692006] [2021-12-22 20:40:47,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:47,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:47,860 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:47,874 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2021-12-22 20:40:47,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:47,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701938957] [2021-12-22 20:40:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:47,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:47,921 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:47,952 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:48,442 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:40:48,442 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:40:48,442 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:40:48,442 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:40:48,442 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 20:40:48,442 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:48,442 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:40:48,443 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:40:48,443 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration1_Lasso [2021-12-22 20:40:48,443 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:40:48,443 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:40:48,455 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-22 20:40:48,475 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-22 20:40:48,480 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-22 20:40:48,481 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-22 20:40:48,783 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-22 20:40:48,785 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-22 20:40:48,788 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-22 20:40:48,790 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-22 20:40:48,791 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-22 20:40:48,793 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-22 20:40:48,795 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-22 20:40:48,796 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-22 20:40:48,798 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-22 20:40:48,799 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-22 20:40:48,801 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-22 20:40:49,093 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 20:40:49,095 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 20:40:49,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,098 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-22 20:40:49,099 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-22 20:40:49,100 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-22 20:40:49,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:40:49,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:40:49,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:40:49,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:49,140 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-22 20:40:49,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,143 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-22 20:40:49,144 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-22 20:40:49,146 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-22 20:40:49,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:49,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:49,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:49,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-22 20:40:49,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,182 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-22 20:40:49,182 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-22 20:40:49,187 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-22 20:40:49,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:40:49,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:40:49,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:40:49,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:49,221 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-22 20:40:49,221 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,222 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-22 20:40:49,223 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-22 20:40:49,225 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-22 20:40:49,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:49,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:49,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:49,267 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-22 20:40:49,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,269 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-22 20:40:49,270 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-22 20:40:49,271 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-22 20:40:49,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:49,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:49,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:49,313 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-22 20:40:49,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,314 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-22 20:40:49,315 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-22 20:40:49,317 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-22 20:40:49,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:40:49,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:40:49,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:40:49,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:49,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-22 20:40:49,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,373 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-22 20:40:49,374 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-22 20:40:49,375 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-22 20:40:49,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:49,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:49,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:49,420 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-22 20:40:49,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,422 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-22 20:40:49,423 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-22 20:40:49,425 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-22 20:40:49,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:49,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:49,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:49,455 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-22 20:40:49,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,461 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-22 20:40:49,462 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-22 20:40:49,464 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-22 20:40:49,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:49,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:49,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:49,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-12-22 20:40:49,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,523 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-22 20:40:49,526 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-22 20:40:49,526 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-22 20:40:49,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:40:49,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:40:49,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:40:49,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:49,558 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-22 20:40:49,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,559 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-22 20:40:49,560 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-22 20:40:49,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 20:40:49,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:49,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:49,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:49,611 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-22 20:40:49,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,612 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-22 20:40:49,613 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-22 20:40:49,615 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-22 20:40:49,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:49,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:49,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:49,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:49,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:49,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:49,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 20:40:49,698 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2021-12-22 20:40:49,698 INFO L444 ModelExtractionUtils]: 5 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-12-22 20:40:49,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:49,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:49,700 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-22 20:40:49,701 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-22 20:40:49,703 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 20:40:49,725 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-22 20:40:49,725 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 20:40:49,726 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-22 20:40:49,764 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-22 20:40:49,808 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2021-12-22 20:40:49,829 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-22 20:40:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:40:49,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 20:40:49,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:40:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:40:49,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 20:40:49,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:40:49,896 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-22 20:40:49,916 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-22 20:40:49,917 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-22 20:40:49,966 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-22 20:40:49,967 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-22 20:40:49,973 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-22 20:40:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2021-12-22 20:40:49,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-22 20:40:49,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:40:49,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2021-12-22 20:40:49,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:40:49,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2021-12-22 20:40:49,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:40:49,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 75 transitions. [2021-12-22 20:40:49,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 20:40:49,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 17 states and 25 transitions. [2021-12-22 20:40:49,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-22 20:40:49,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-22 20:40:49,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-12-22 20:40:49,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:40:49,988 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-22 20:40:49,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-12-22 20:40:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-22 20:40:50,005 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-22 20:40:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-12-22 20:40:50,007 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-22 20:40:50,007 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-12-22 20:40:50,007 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-22 20:40:50,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-12-22 20:40:50,009 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 20:40:50,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:40:50,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:40:50,009 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:40:50,009 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 20:40:50,009 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-22 20:40:50,010 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-22 20:40:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:50,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2021-12-22 20:40:50,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:50,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432115598] [2021-12-22 20:40:50,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:50,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:40:50,091 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-22 20:40:50,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:40:50,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432115598] [2021-12-22 20:40:50,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432115598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:40:50,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:40:50,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 20:40:50,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423922253] [2021-12-22 20:40:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:40:50,097 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:40:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2021-12-22 20:40:50,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:50,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200130797] [2021-12-22 20:40:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:50,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:50,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:50,120 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:50,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:40:50,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 20:40:50,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 20:40:50,151 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-22 20:40:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:40:50,170 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2021-12-22 20:40:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 20:40:50,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2021-12-22 20:40:50,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 20:40:50,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2021-12-22 20:40:50,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-22 20:40:50,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-22 20:40:50,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2021-12-22 20:40:50,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:40:50,172 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2021-12-22 20:40:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2021-12-22 20:40:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-12-22 20:40:50,173 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-22 20:40:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2021-12-22 20:40:50,173 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2021-12-22 20:40:50,173 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2021-12-22 20:40:50,173 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-22 20:40:50,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2021-12-22 20:40:50,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-22 20:40:50,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:40:50,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:40:50,174 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:40:50,174 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 20:40:50,174 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-22 20:40:50,174 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-22 20:40:50,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2021-12-22 20:40:50,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:50,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074677636] [2021-12-22 20:40:50,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:50,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:50,210 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:50,232 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:50,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2021-12-22 20:40:50,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:50,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790654580] [2021-12-22 20:40:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:50,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:50,237 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:50,239 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:50,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2021-12-22 20:40:50,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:50,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012754239] [2021-12-22 20:40:50,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:50,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:50,274 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:50,288 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:50,776 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:40:50,776 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:40:50,776 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:40:50,776 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:40:50,776 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 20:40:50,776 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:50,776 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:40:50,777 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:40:50,777 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration3_Lasso [2021-12-22 20:40:50,777 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:40:50,777 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:40:50,784 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-22 20:40:50,786 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-22 20:40:50,787 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-22 20:40:50,789 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-22 20:40:50,791 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-22 20:40:51,032 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-22 20:40:51,034 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-22 20:40:51,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-22 20:40:51,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-22 20:40:51,039 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-22 20:40:51,041 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-22 20:40:51,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-22 20:40:51,046 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-22 20:40:51,370 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 20:40:51,371 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 20:40:51,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:51,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:51,392 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-22 20:40:51,393 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-22 20:40:51,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 20:40:51,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:51,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:40:51,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:51,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:51,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:51,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:40:51,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:40:51,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:51,460 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-22 20:40:51,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:51,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:51,479 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-22 20:40:51,480 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-22 20:40:51,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 20:40:51,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:51,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:40:51,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:51,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:51,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:51,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:40:51,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:40:51,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:51,532 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-22 20:40:51,532 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:51,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:51,533 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-22 20:40:51,534 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-22 20:40:51,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 20:40:51,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:51,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:51,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:51,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:51,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:51,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:51,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:51,614 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-22 20:40:51,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:51,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:51,628 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-22 20:40:51,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 20:40:51,645 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-22 20:40:51,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:51,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:40:51,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:51,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:51,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:51,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:40:51,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:40:51,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:51,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-22 20:40:51,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:51,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:51,669 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-22 20:40:51,670 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-22 20:40:51,671 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-22 20:40:51,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:51,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:51,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:51,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:51,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:51,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:51,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:51,711 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-22 20:40:51,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:51,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:51,713 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-22 20:40:51,718 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-22 20:40:51,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:51,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:40:51,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:51,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:51,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:51,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:40:51,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:40:51,728 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-22 20:40:51,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:51,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-22 20:40:51,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:51,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:51,763 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-22 20:40:51,767 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-22 20:40:51,781 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-22 20:40:51,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:51,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:51,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:51,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:51,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:51,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:51,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:51,817 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-22 20:40:51,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:51,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:51,818 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-22 20:40:51,819 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-22 20:40:51,821 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-22 20:40:51,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:51,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:40:51,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:51,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:51,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:51,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:40:51,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:40:51,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:51,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-22 20:40:51,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:51,853 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-22 20:40:51,854 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-22 20:40:51,855 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-22 20:40:51,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:51,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:51,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:51,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:51,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:51,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:51,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:51,938 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-22 20:40:51,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:51,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:51,940 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-22 20:40:51,949 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-22 20:40:51,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 20:40:51,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:51,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:51,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:51,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:51,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:51,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:51,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:51,978 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-22 20:40:51,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:51,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:51,980 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-22 20:40:51,981 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-22 20:40:51,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 20:40:51,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:51,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:51,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:51,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:51,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:51,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:52,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:40:52,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-22 20:40:52,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:52,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:52,025 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-22 20:40:52,026 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-22 20:40:52,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 20:40:52,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:40:52,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:40:52,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:40:52,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:40:52,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:40:52,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:40:52,067 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 20:40:52,082 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-22 20:40:52,083 INFO L444 ModelExtractionUtils]: 9 out of 43 variables were initially zero. Simplification set additionally 31 variables to zero. [2021-12-22 20:40:52,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:52,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:40:52,084 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-22 20:40:52,085 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-22 20:40:52,087 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 20:40:52,095 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-22 20:40:52,095 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 20:40:52,095 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-22 20:40:52,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-22 20:40:52,155 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2021-12-22 20:40:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:40:52,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 20:40:52,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:40:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:40:52,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 20:40:52,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:40:52,215 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-22 20:40:52,215 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-22 20:40:52,215 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-22 20:40:52,228 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-22 20:40:52,230 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-22 20:40:52,230 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-22 20:40:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2021-12-22 20:40:52,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2021-12-22 20:40:52,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:40:52,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2021-12-22 20:40:52,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:40:52,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2021-12-22 20:40:52,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:40:52,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2021-12-22 20:40:52,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-22 20:40:52,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2021-12-22 20:40:52,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-22 20:40:52,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-22 20:40:52,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2021-12-22 20:40:52,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:40:52,232 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2021-12-22 20:40:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2021-12-22 20:40:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-22 20:40:52,233 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-22 20:40:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2021-12-22 20:40:52,233 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2021-12-22 20:40:52,233 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2021-12-22 20:40:52,233 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-22 20:40:52,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2021-12-22 20:40:52,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-22 20:40:52,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:40:52,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:40:52,234 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:40:52,234 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-22 20:40:52,234 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-22 20:40:52,234 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-22 20:40:52,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2021-12-22 20:40:52,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:52,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139747140] [2021-12-22 20:40:52,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:52,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:40:52,261 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-22 20:40:52,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:40:52,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139747140] [2021-12-22 20:40:52,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139747140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:40:52,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:40:52,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 20:40:52,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422367743] [2021-12-22 20:40:52,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:40:52,262 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:40:52,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 1 times [2021-12-22 20:40:52,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:52,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152660584] [2021-12-22 20:40:52,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:52,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,266 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,269 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:52,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:40:52,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 20:40:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 20:40:52,362 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-22 20:40:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:40:52,378 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2021-12-22 20:40:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 20:40:52,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2021-12-22 20:40:52,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-22 20:40:52,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2021-12-22 20:40:52,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-22 20:40:52,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-22 20:40:52,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2021-12-22 20:40:52,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:40:52,380 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-22 20:40:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2021-12-22 20:40:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-12-22 20:40:52,381 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-22 20:40:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2021-12-22 20:40:52,381 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2021-12-22 20:40:52,381 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2021-12-22 20:40:52,381 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-22 20:40:52,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2021-12-22 20:40:52,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-22 20:40:52,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:40:52,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:40:52,381 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:40:52,382 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-22 20:40:52,382 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-22 20:40:52,382 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-22 20:40:52,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:52,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2021-12-22 20:40:52,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:52,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630643520] [2021-12-22 20:40:52,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:52,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,393 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:52,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:52,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 2 times [2021-12-22 20:40:52,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:52,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740602403] [2021-12-22 20:40:52,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:52,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,413 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash -796463931, now seen corresponding path program 1 times [2021-12-22 20:40:52,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:52,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16065380] [2021-12-22 20:40:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:52,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:40:52,470 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-22 20:40:52,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:40:52,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16065380] [2021-12-22 20:40:52,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16065380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:40:52,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:40:52,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 20:40:52,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577662310] [2021-12-22 20:40:52,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:40:52,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-22 20:40:52,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:40:52,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 20:40:52,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 20:40:52,560 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-22 20:40:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:40:52,592 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2021-12-22 20:40:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 20:40:52,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2021-12-22 20:40:52,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-22 20:40:52,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2021-12-22 20:40:52,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-22 20:40:52,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-22 20:40:52,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2021-12-22 20:40:52,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:40:52,595 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2021-12-22 20:40:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2021-12-22 20:40:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-12-22 20:40:52,596 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-22 20:40:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2021-12-22 20:40:52,597 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-22 20:40:52,597 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-22 20:40:52,597 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-22 20:40:52,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2021-12-22 20:40:52,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-22 20:40:52,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:40:52,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:40:52,597 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:40:52,597 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-22 20:40:52,597 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-22 20:40:52,597 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-22 20:40:52,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 2 times [2021-12-22 20:40:52,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:52,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242295294] [2021-12-22 20:40:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:52,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,622 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:52,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:52,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1860447319, now seen corresponding path program 1 times [2021-12-22 20:40:52,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:52,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892499165] [2021-12-22 20:40:52,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:52,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:40:52,636 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-22 20:40:52,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:40:52,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892499165] [2021-12-22 20:40:52,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892499165] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:40:52,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:40:52,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 20:40:52,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992425980] [2021-12-22 20:40:52,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:40:52,637 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:40:52,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:40:52,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 20:40:52,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 20:40:52,637 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-22 20:40:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:40:52,654 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2021-12-22 20:40:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 20:40:52,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2021-12-22 20:40:52,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-22 20:40:52,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2021-12-22 20:40:52,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-22 20:40:52,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-22 20:40:52,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2021-12-22 20:40:52,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:40:52,655 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-12-22 20:40:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2021-12-22 20:40:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2021-12-22 20:40:52,656 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-22 20:40:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2021-12-22 20:40:52,657 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2021-12-22 20:40:52,657 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2021-12-22 20:40:52,657 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-22 20:40:52,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2021-12-22 20:40:52,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-22 20:40:52,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:40:52,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:40:52,657 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:40:52,658 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-22 20:40:52,658 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-22 20:40:52,658 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-22 20:40:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 3 times [2021-12-22 20:40:52,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:52,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593337898] [2021-12-22 20:40:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:52,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,681 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:52,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1860447257, now seen corresponding path program 1 times [2021-12-22 20:40:52,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:52,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955215775] [2021-12-22 20:40:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:52,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,688 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:40:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash -896094976, now seen corresponding path program 1 times [2021-12-22 20:40:52,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:40:52,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279046119] [2021-12-22 20:40:52,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:40:52,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:40:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,710 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:40:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:40:52,721 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:40:53,588 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:40:53,588 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:40:53,588 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:40:53,588 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:40:53,588 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 20:40:53,588 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:40:53,588 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:40:53,588 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:40:53,588 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration7_Lasso [2021-12-22 20:40:53,588 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:40:53,588 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:40:53,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-22 20:40:53,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-22 20:40:53,600 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-22 20:40:53,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-22 20:40:53,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-22 20:40:53,604 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-22 20:40:53,616 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-22 20:40:53,617 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-22 20:40:53,618 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-22 20:40:53,620 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-22 20:40:53,621 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-22 20:40:53,622 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-22 20:40:53,623 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-22 20:40:53,712 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-22 20:40:53,714 INFO L158 Benchmark]: Toolchain (without parser) took 6752.55ms. Allocated memory was 94.4MB in the beginning and 174.1MB in the end (delta: 79.7MB). Free memory was 61.0MB in the beginning and 94.5MB in the end (delta: -33.4MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2021-12-22 20:40:53,715 INFO L158 Benchmark]: CDTParser took 9.82ms. Allocated memory is still 94.4MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 20:40:53,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.21ms. Allocated memory is still 94.4MB. Free memory was 60.9MB in the beginning and 62.9MB in the end (delta: -2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 20:40:53,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.48ms. Allocated memory is still 94.4MB. Free memory was 62.9MB in the beginning and 60.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 20:40:53,715 INFO L158 Benchmark]: Boogie Preprocessor took 16.46ms. Allocated memory is still 94.4MB. Free memory was 60.8MB in the beginning and 59.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 20:40:53,715 INFO L158 Benchmark]: RCFGBuilder took 253.18ms. Allocated memory is still 94.4MB. Free memory was 59.6MB in the beginning and 47.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 20:40:53,716 INFO L158 Benchmark]: BuchiAutomizer took 6100.35ms. Allocated memory was 94.4MB in the beginning and 174.1MB in the end (delta: 79.7MB). Free memory was 47.1MB in the beginning and 94.5MB in the end (delta: -47.4MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2021-12-22 20:40:53,721 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 9.82ms. Allocated memory is still 94.4MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.21ms. Allocated memory is still 94.4MB. Free memory was 60.9MB in the beginning and 62.9MB in the end (delta: -2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.48ms. Allocated memory is still 94.4MB. Free memory was 62.9MB in the beginning and 60.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.46ms. Allocated memory is still 94.4MB. Free memory was 60.8MB in the beginning and 59.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 253.18ms. Allocated memory is still 94.4MB. Free memory was 59.6MB in the beginning and 47.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6100.35ms. Allocated memory was 94.4MB in the beginning and 174.1MB in the end (delta: 79.7MB). Free memory was 47.1MB in the beginning and 94.5MB in the end (delta: -47.4MB). Peak memory consumption was 73.7MB. 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-22 20:40:53,747 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