./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b 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/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b9049196bba7cbcb7cf3ded9c8379f49dc6ac79e222934a18b33266f1e0c667f --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:04:49,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:04:49,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:04:49,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:04:49,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:04:49,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:04:49,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:04:49,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:04:49,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:04:49,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:04:49,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:04:49,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:04:49,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:04:49,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:04:49,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:04:49,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:04:49,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:04:49,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:04:49,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:04:49,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:04:49,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:04:49,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:04:49,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:04:49,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:04:49,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:04:49,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:04:49,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:04:49,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:04:49,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:04:49,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:04:49,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:04:49,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:04:49,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:04:49,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:04:49,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:04:49,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:04:49,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:04:49,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:04:49,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:04:49,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:04:49,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:04:49,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-14 23:04:49,174 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:04:49,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:04:49,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:04:49,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:04:49,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:04:49,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:04:49,176 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:04:49,176 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:04:49,176 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:04:49,176 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:04:49,177 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:04:49,177 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:04:49,178 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:04:49,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:04:49,178 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:04:49,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:04:49,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:04:49,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:04:49,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:04:49,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:04:49,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:04:49,179 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:04:49,179 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:04:49,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:04:49,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:04:49,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:04:49,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:04:49,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:04:49,180 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:04:49,181 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:04:49,181 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9049196bba7cbcb7cf3ded9c8379f49dc6ac79e222934a18b33266f1e0c667f [2021-12-14 23:04:49,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:04:49,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:04:49,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:04:49,372 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:04:49,373 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:04:49,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2021-12-14 23:04:49,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97d4d3a2/8f26925b02ba406e9da2ae38dfcb40bf/FLAG2ee82eed1 [2021-12-14 23:04:49,763 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:04:49,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2021-12-14 23:04:49,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97d4d3a2/8f26925b02ba406e9da2ae38dfcb40bf/FLAG2ee82eed1 [2021-12-14 23:04:50,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97d4d3a2/8f26925b02ba406e9da2ae38dfcb40bf [2021-12-14 23:04:50,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:04:50,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:04:50,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:04:50,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:04:50,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:04:50,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17eab4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50, skipping insertion in model container [2021-12-14 23:04:50,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:04:50,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:04:50,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:04:50,491 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:04:50,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:04:50,546 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:04:50,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50 WrapperNode [2021-12-14 23:04:50,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:04:50,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:04:50,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:04:50,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:04:50,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,578 INFO L137 Inliner]: procedures = 110, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2021-12-14 23:04:50,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:04:50,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:04:50,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:04:50,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:04:50,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:04:50,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:04:50,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:04:50,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:04:50,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50" (1/1) ... [2021-12-14 23:04:50,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:50,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:50,654 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-14 23:04:50,672 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-14 23:04:50,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:04:50,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:04:50,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 23:04:50,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:04:50,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:04:50,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:04:50,760 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:04:50,762 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:04:50,848 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:04:50,852 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:04:50,852 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 23:04:50,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:04:50 BoogieIcfgContainer [2021-12-14 23:04:50,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:04:50,854 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:04:50,854 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:04:50,858 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:04:50,858 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:04:50,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:04:50" (1/3) ... [2021-12-14 23:04:50,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dc02ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:04:50, skipping insertion in model container [2021-12-14 23:04:50,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:04:50,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:04:50" (2/3) ... [2021-12-14 23:04:50,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dc02ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:04:50, skipping insertion in model container [2021-12-14 23:04:50,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:04:50,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:04:50" (3/3) ... [2021-12-14 23:04:50,861 INFO L388 chiAutomizerObserver]: Analyzing ICFG KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2021-12-14 23:04:50,899 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:04:50,899 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:04:50,899 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:04:50,899 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:04:50,899 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:04:50,899 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:04:50,900 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:04:50,900 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:04:50,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-14 23:04:50,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-14 23:04:50,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:50,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:50,930 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:04:50,930 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:04:50,930 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:04:50,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-14 23:04:50,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-14 23:04:50,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:50,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:50,933 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:04:50,933 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:04:50,938 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); 9#L558-2true [2021-12-14 23:04:50,939 INFO L793 eck$LassoCheckResult]: Loop: 9#L558-2true call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 12#L552-1true assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 4#L553true assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1; 8#L553-2true call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); 7#L558true assume 0 != main_#t~mem10#1;havoc main_#t~mem10#1;call write~int(0, main_~x~0#1.base, main_~x~0#1.offset, 4); 9#L558-2true [2021-12-14 23:04:50,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:50,946 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-14 23:04:50,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:50,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094729683] [2021-12-14 23:04:50,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:50,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:51,066 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:51,104 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:51,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:51,106 INFO L85 PathProgramCache]: Analyzing trace with hash 35468238, now seen corresponding path program 1 times [2021-12-14 23:04:51,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:51,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896102015] [2021-12-14 23:04:51,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:51,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:51,134 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:51,150 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907724, now seen corresponding path program 1 times [2021-12-14 23:04:51,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:51,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512609824] [2021-12-14 23:04:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:51,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:51,283 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-14 23:04:51,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:51,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512609824] [2021-12-14 23:04:51,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512609824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:04:51,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:04:51,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:04:51,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214066516] [2021-12-14 23:04:51,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:04:51,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:51,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:04:51,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:04:51,415 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-14 23:04:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:51,445 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2021-12-14 23:04:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 23:04:51,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2021-12-14 23:04:51,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-14 23:04:51,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2021-12-14 23:04:51,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-14 23:04:51,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-14 23:04:51,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2021-12-14 23:04:51,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:04:51,457 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-12-14 23:04:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2021-12-14 23:04:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-12-14 23:04:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2021-12-14 23:04:51,473 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-12-14 23:04:51,474 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-12-14 23:04:51,474 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:04:51,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2021-12-14 23:04:51,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-14 23:04:51,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:51,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:51,477 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:04:51,478 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:04:51,478 INFO L791 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 39#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); 41#L558-2 [2021-12-14 23:04:51,478 INFO L793 eck$LassoCheckResult]: Loop: 41#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 42#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 36#L553 assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1; 37#L553-2 call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); 40#L558 assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; 41#L558-2 [2021-12-14 23:04:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-14 23:04:51,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:51,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015845339] [2021-12-14 23:04:51,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:51,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:51,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:51,498 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:51,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:51,499 INFO L85 PathProgramCache]: Analyzing trace with hash 35468240, now seen corresponding path program 1 times [2021-12-14 23:04:51,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:51,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520138197] [2021-12-14 23:04:51,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:51,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:51,511 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:51,526 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:51,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:51,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907726, now seen corresponding path program 1 times [2021-12-14 23:04:51,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:51,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433599841] [2021-12-14 23:04:51,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:51,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:51,548 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:51,559 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:51,906 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:04:51,907 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:04:51,907 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:04:51,907 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:04:51,907 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:04:51,907 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:51,907 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:04:51,907 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:04:51,908 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i_Iteration2_Lasso [2021-12-14 23:04:51,908 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:04:51,908 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:04:51,919 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-14 23:04:51,923 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-14 23:04:51,925 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-14 23:04:52,097 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-14 23:04:52,101 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-14 23:04:52,104 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-14 23:04:52,107 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-14 23:04:52,109 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-14 23:04:52,111 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-14 23:04:52,113 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-14 23:04:52,115 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-14 23:04:52,118 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-14 23:04:52,121 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-14 23:04:52,123 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-14 23:04:52,124 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-14 23:04:52,384 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:04:52,387 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:04:52,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:52,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:52,390 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-14 23:04:52,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:04:52,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:52,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:52,400 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-14 23:04:52,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:52,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:52,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:52,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:52,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:52,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:52,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-14 23:04:52,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:52,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:52,461 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-14 23:04:52,463 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-14 23:04:52,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-14 23:04:52,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:52,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:52,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:52,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:52,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:52,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:52,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:52,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:52,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:52,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:52,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:52,501 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-14 23:04:52,520 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-14 23:04:52,521 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-14 23:04:52,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:52,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:52,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:52,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:52,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:52,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:52,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:52,569 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-14 23:04:52,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:52,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:52,578 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-14 23:04:52,607 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-14 23:04:52,609 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-14 23:04:52,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:52,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:52,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:52,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:52,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:52,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:52,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:04:52,673 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-14 23:04:52,673 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2021-12-14 23:04:52,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:52,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:52,711 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-14 23:04:52,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:04:52,770 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-14 23:04:52,779 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:04:52,780 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:04:52,780 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 + 255 Supporting invariants [] [2021-12-14 23:04:52,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-12-14 23:04:52,815 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-12-14 23:04:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:52,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:04:52,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:52,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 23:04:52,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:52,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2021-12-14 23:04:52,926 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-14 23:04:52,929 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2021-12-14 23:04:52,929 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-14 23:04:52,954 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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 18 states and 21 transitions. Complement of second has 9 states. [2021-12-14 23:04:52,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-14 23:04:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-14 23:04:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2021-12-14 23:04:52,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2021-12-14 23:04:52,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:52,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2021-12-14 23:04:52,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:52,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2021-12-14 23:04:52,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:52,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2021-12-14 23:04:52,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-14 23:04:52,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2021-12-14 23:04:52,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-14 23:04:52,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-14 23:04:52,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2021-12-14 23:04:52,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:52,959 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-12-14 23:04:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2021-12-14 23:04:52,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-12-14 23:04:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:04:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-12-14 23:04:52,961 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-12-14 23:04:52,961 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-12-14 23:04:52,961 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:04:52,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2021-12-14 23:04:52,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-14 23:04:52,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:52,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:52,962 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-14 23:04:52,962 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:04:52,962 INFO L791 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 160#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); 169#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 167#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 155#L553 assume 0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 156#L553-2 [2021-12-14 23:04:52,962 INFO L793 eck$LassoCheckResult]: Loop: 156#L553-2 call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); 161#L558 assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; 162#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 170#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 171#L553 assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1; 156#L553-2 [2021-12-14 23:04:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2021-12-14 23:04:52,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:52,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457675558] [2021-12-14 23:04:52,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:52,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:52,977 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:52,986 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:52,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 2 times [2021-12-14 23:04:52,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:52,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128585567] [2021-12-14 23:04:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:52,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:52,992 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:52,997 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash 705693312, now seen corresponding path program 1 times [2021-12-14 23:04:52,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:52,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951691324] [2021-12-14 23:04:52,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:52,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:53,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:53,027 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:53,322 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:04:53,323 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:04:53,323 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:04:53,323 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:04:53,323 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:04:53,323 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:53,323 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:04:53,323 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:04:53,323 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i_Iteration3_Lasso [2021-12-14 23:04:53,323 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:04:53,323 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:04:53,325 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-14 23:04:53,327 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-14 23:04:53,328 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-14 23:04:53,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-14 23:04:53,482 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-14 23:04:53,484 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-14 23:04:53,486 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-14 23:04:53,488 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-14 23:04:53,489 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-14 23:04:53,491 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-14 23:04:53,492 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-14 23:04:53,494 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-14 23:04:53,495 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-14 23:04:53,497 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-14 23:04:53,499 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-14 23:04:53,625 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-14 23:04:53,795 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:04:53,795 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:04:53,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:53,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:53,812 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-14 23:04:53,836 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-14 23:04:53,836 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-14 23:04:53,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:53,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:53,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:53,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:53,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:53,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:53,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:53,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:53,870 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-14 23:04:53,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:53,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:53,872 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-14 23:04:53,873 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-14 23:04:53,874 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-14 23:04:53,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:53,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:04:53,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:53,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:53,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:53,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:04:53,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:04:53,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:53,895 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-14 23:04:53,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:53,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:53,897 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-14 23:04:53,897 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-14 23:04:53,899 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-14 23:04:53,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:53,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:53,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:53,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:53,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:53,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:53,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:53,951 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-14 23:04:53,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:53,953 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-14 23:04:53,954 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-14 23:04:53,955 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-14 23:04:53,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:53,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:53,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:53,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:53,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:53,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:53,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:54,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-14 23:04:54,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:54,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:54,002 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-14 23:04:54,008 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-14 23:04:54,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:54,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:54,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:54,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:54,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:54,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:54,019 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-14 23:04:54,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:04:54,052 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-14 23:04:54,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:54,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:54,054 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-14 23:04:54,055 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-14 23:04:54,057 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-14 23:04:54,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:04:54,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:04:54,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:04:54,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:04:54,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:04:54,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:04:54,081 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:04:54,086 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-14 23:04:54,086 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2021-12-14 23:04:54,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:04:54,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:04:54,087 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-14 23:04:54,088 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-14 23:04:54,090 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:04:54,117 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:04:54,117 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:04:54,117 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 + 255 Supporting invariants [] [2021-12-14 23:04:54,153 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-14 23:04:54,171 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-12-14 23:04:54,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:54,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:04:54,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:54,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 23:04:54,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:04:54,246 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-14 23:04:54,246 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-14 23:04:54,247 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-14 23:04:54,265 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 27 states and 32 transitions. Complement of second has 9 states. [2021-12-14 23:04:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-14 23:04:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-14 23:04:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2021-12-14 23:04:54,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 5 letters. [2021-12-14 23:04:54,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:54,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 5 letters. [2021-12-14 23:04:54,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:54,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 10 letters. [2021-12-14 23:04:54,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:04:54,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2021-12-14 23:04:54,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-14 23:04:54,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2021-12-14 23:04:54,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-14 23:04:54,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-14 23:04:54,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2021-12-14 23:04:54,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:04:54,274 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-14 23:04:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2021-12-14 23:04:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-14 23:04:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-14 23:04:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2021-12-14 23:04:54,277 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-14 23:04:54,277 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-14 23:04:54,277 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:04:54,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2021-12-14 23:04:54,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-14 23:04:54,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:04:54,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:04:54,279 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2021-12-14 23:04:54,279 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-14 23:04:54,279 INFO L791 eck$LassoCheckResult]: Stem: 305#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 306#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); 315#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 317#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 321#L553 assume 0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 318#L553-2 call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); 320#L558 assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; 323#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 316#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 301#L553 assume 0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 302#L553-2 [2021-12-14 23:04:54,279 INFO L793 eck$LassoCheckResult]: Loop: 302#L553-2 call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); 311#L558 assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; 312#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 313#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 322#L553 assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1; 302#L553-2 [2021-12-14 23:04:54,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:54,280 INFO L85 PathProgramCache]: Analyzing trace with hash 705693310, now seen corresponding path program 1 times [2021-12-14 23:04:54,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:54,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375673673] [2021-12-14 23:04:54,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:54,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:04:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:04:54,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:04:54,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375673673] [2021-12-14 23:04:54,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375673673] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:04:54,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:04:54,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 23:04:54,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034479019] [2021-12-14 23:04:54,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:04:54,497 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:04:54,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:04:54,497 INFO L85 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 3 times [2021-12-14 23:04:54,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:04:54,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345083460] [2021-12-14 23:04:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:04:54,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:04:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:54,507 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:04:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:04:54,519 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:04:54,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:04:54,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:04:54,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:04:54,581 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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-14 23:04:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:04:54,617 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-12-14 23:04:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 23:04:54,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2021-12-14 23:04:54,620 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:04:54,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2021-12-14 23:04:54,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-14 23:04:54,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-14 23:04:54,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-14 23:04:54,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:04:54,621 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:04:54,621 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:04:54,621 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:04:54,621 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:04:54,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-14 23:04:54,621 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:04:54,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-14 23:04:54,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.12 11:04:54 BoogieIcfgContainer [2021-12-14 23:04:54,626 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-14 23:04:54,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 23:04:54,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 23:04:54,627 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 23:04:54,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:04:50" (3/4) ... [2021-12-14 23:04:54,629 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 23:04:54,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 23:04:54,632 INFO L158 Benchmark]: Toolchain (without parser) took 4426.80ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 91.8MB in the beginning and 74.5MB in the end (delta: 17.3MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2021-12-14 23:04:54,632 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory was 35.6MB in the beginning and 35.6MB in the end (delta: 36.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:04:54,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.61ms. Allocated memory is still 125.8MB. Free memory was 91.6MB in the beginning and 96.3MB in the end (delta: -4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 23:04:54,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.43ms. Allocated memory is still 125.8MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:04:54,633 INFO L158 Benchmark]: Boogie Preprocessor took 36.28ms. Allocated memory is still 125.8MB. Free memory was 94.2MB in the beginning and 93.5MB in the end (delta: 724.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:04:54,636 INFO L158 Benchmark]: RCFGBuilder took 237.30ms. Allocated memory is still 125.8MB. Free memory was 93.5MB in the beginning and 83.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 23:04:54,638 INFO L158 Benchmark]: BuchiAutomizer took 3772.38ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 83.0MB in the beginning and 74.5MB in the end (delta: 8.5MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2021-12-14 23:04:54,638 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 176.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:04:54,639 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory was 35.6MB in the beginning and 35.6MB in the end (delta: 36.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.61ms. Allocated memory is still 125.8MB. Free memory was 91.6MB in the beginning and 96.3MB in the end (delta: -4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.43ms. Allocated memory is still 125.8MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.28ms. Allocated memory is still 125.8MB. Free memory was 94.2MB in the beginning and 93.5MB in the end (delta: 724.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 237.30ms. Allocated memory is still 125.8MB. Free memory was 93.5MB in the beginning and 83.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 3772.38ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 83.0MB in the beginning and 74.5MB in the end (delta: 8.5MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 176.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 255 + -1 * unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has affine ranking function 255 + -1 * unknown-#memory_int-unknown[x][x] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 24 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax107 hnf100 lsp89 ukn60 mio100 lsp37 div161 bol100 ite100 ukn100 eq155 hnf70 smp88 dnf100 smp100 tf100 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-14 23:04:54,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-14 23:04:54,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE