./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf 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/systemc/toy1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 04:20:29,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 04:20:29,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 04:20:29,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 04:20:29,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 04:20:29,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 04:20:29,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 04:20:29,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 04:20:29,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 04:20:29,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 04:20:29,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 04:20:29,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 04:20:29,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 04:20:29,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 04:20:29,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 04:20:29,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 04:20:29,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 04:20:29,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 04:20:29,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 04:20:29,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 04:20:29,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 04:20:29,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 04:20:29,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 04:20:29,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 04:20:29,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 04:20:29,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 04:20:29,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 04:20:29,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 04:20:29,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 04:20:29,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 04:20:29,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 04:20:29,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 04:20:29,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 04:20:29,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 04:20:29,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 04:20:29,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 04:20:29,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 04:20:29,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 04:20:29,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 04:20:29,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 04:20:29,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 04:20:29,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 04:20:29,715 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 04:20:29,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 04:20:29,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 04:20:29,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 04:20:29,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 04:20:29,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 04:20:29,716 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 04:20:29,717 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 04:20:29,717 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 04:20:29,717 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 04:20:29,717 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 04:20:29,717 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 04:20:29,717 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 04:20:29,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 04:20:29,725 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 04:20:29,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 04:20:29,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 04:20:29,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 04:20:29,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 04:20:29,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 04:20:29,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 04:20:29,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 04:20:29,726 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 04:20:29,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 04:20:29,726 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 04:20:29,726 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 04:20:29,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 04:20:29,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 04:20:29,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 04:20:29,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 04:20:29,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 04:20:29,727 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 04:20:29,728 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 04:20:29,729 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 [2021-08-31 04:20:30,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 04:20:30,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 04:20:30,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 04:20:30,086 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 04:20:30,087 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 04:20:30,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy1.cil.c [2021-08-31 04:20:30,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a93d064c/0b5677ab52874abe8045a35bb077461d/FLAG08b86327d [2021-08-31 04:20:30,643 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 04:20:30,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2021-08-31 04:20:30,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a93d064c/0b5677ab52874abe8045a35bb077461d/FLAG08b86327d [2021-08-31 04:20:31,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a93d064c/0b5677ab52874abe8045a35bb077461d [2021-08-31 04:20:31,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 04:20:31,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 04:20:31,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 04:20:31,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 04:20:31,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 04:20:31,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e2ef6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31, skipping insertion in model container [2021-08-31 04:20:31,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 04:20:31,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 04:20:31,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c[393,406] [2021-08-31 04:20:31,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:20:31,387 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 04:20:31,395 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c[393,406] [2021-08-31 04:20:31,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:20:31,434 INFO L208 MainTranslator]: Completed translation [2021-08-31 04:20:31,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31 WrapperNode [2021-08-31 04:20:31,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 04:20:31,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 04:20:31,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 04:20:31,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 04:20:31,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 04:20:31,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 04:20:31,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 04:20:31,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 04:20:31,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 04:20:31,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 04:20:31,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 04:20:31,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 04:20:31,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31" (1/1) ... [2021-08-31 04:20:31,514 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:31,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:31,546 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-08-31 04:20:31,572 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-08-31 04:20:31,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 04:20:31,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 04:20:31,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 04:20:31,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 04:20:31,861 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 04:20:31,861 INFO L299 CfgBuilder]: Removed 28 assume(true) statements. [2021-08-31 04:20:31,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:20:31 BoogieIcfgContainer [2021-08-31 04:20:31,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 04:20:31,864 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 04:20:31,865 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 04:20:31,868 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 04:20:31,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:20:31,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 04:20:31" (1/3) ... [2021-08-31 04:20:31,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b78179b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:20:31, skipping insertion in model container [2021-08-31 04:20:31,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:20:31,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:20:31" (2/3) ... [2021-08-31 04:20:31,871 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b78179b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:20:31, skipping insertion in model container [2021-08-31 04:20:31,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:20:31,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:20:31" (3/3) ... [2021-08-31 04:20:31,873 INFO L389 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2021-08-31 04:20:31,956 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 04:20:31,956 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 04:20:31,957 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 04:20:31,957 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 04:20:31,957 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 04:20:31,957 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 04:20:31,957 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 04:20:31,957 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 04:20:31,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.8650793650793651) internal successors, (235), 126 states have internal predecessors, (235), 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-08-31 04:20:32,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-08-31 04:20:32,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:32,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:32,034 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:32,037 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:32,037 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 04:20:32,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.8650793650793651) internal successors, (235), 126 states have internal predecessors, (235), 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-08-31 04:20:32,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-08-31 04:20:32,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:32,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:32,053 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:32,053 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:32,062 INFO L791 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 40#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 103#L408true assume !(1 == ~c_req_up~0); 89#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 122#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 120#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 63#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 115#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 45#L439-1true assume !(0 == ~e_f~0); 8#L444-1true assume !(0 == ~e_g~0); 98#L449-1true assume !(0 == ~e_e~0); 54#L454-1true assume !(0 == ~e_c~0); 107#L459-1true assume !(0 == ~e_wl~0); 27#L464-1true assume !(1 == ~wl_pc~0); 44#L476true assume !(2 == ~wl_pc~0); 26#L477true assume !(1 == ~c1_pc~0); 19#L487true assume !(1 == ~c2_pc~0); 92#L496true assume !(1 == ~wb_pc~0); 31#L505true assume !(1 == ~e_c~0); 36#L514-1true assume !(1 == ~e_e~0); 129#L519-1true assume !(1 == ~e_f~0); 41#L524-1true assume !(1 == ~e_g~0); 127#L529-1true assume !(1 == ~e_c~0); 3#L534-1true assume !(1 == ~e_wl~0); 7#L676-1true [2021-08-31 04:20:32,063 INFO L793 eck$LassoCheckResult]: Loop: 7#L676-1true assume !false; 34#L546true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 72#L381true assume !true; 121#L397true start_simulation_~kernel_st~0 := 2; 43#L552true assume !(1 == ~c_req_up~0); 62#L552-2true start_simulation_~kernel_st~0 := 3; 16#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 18#L564-2true assume 0 == ~e_g~0;~e_g~0 := 1; 9#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 126#L574-1true assume !(0 == ~e_c~0); 14#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 97#L584-1true assume 1 == ~wl_pc~0; 49#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 109#L597true assume !(1 == ~c1_pc~0); 29#L607true assume !(1 == ~c2_pc~0); 101#L616true assume !(1 == ~wb_pc~0); 117#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 61#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 53#L639-1true assume 1 == ~e_f~0;~e_f~0 := 2; 112#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 79#L649-1true assume !(1 == ~e_c~0); 42#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 24#L659-1true assume 0 == ~wl_st~0; 7#L676-1true [2021-08-31 04:20:32,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:32,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2021-08-31 04:20:32,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:32,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743584651] [2021-08-31 04:20:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:32,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:32,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:32,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743584651] [2021-08-31 04:20:32,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743584651] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:32,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:32,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:32,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450840245] [2021-08-31 04:20:32,279 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:20:32,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash 476885301, now seen corresponding path program 1 times [2021-08-31 04:20:32,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:32,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536985462] [2021-08-31 04:20:32,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:32,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:32,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:32,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536985462] [2021-08-31 04:20:32,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536985462] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:32,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:32,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 04:20:32,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047351351] [2021-08-31 04:20:32,320 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:20:32,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:32,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-31 04:20:32,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-31 04:20:32,354 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.8650793650793651) internal successors, (235), 126 states have internal predecessors, (235), 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 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-08-31 04:20:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:32,622 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2021-08-31 04:20:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-31 04:20:32,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 221 transitions. [2021-08-31 04:20:32,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-31 04:20:32,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 121 states and 215 transitions. [2021-08-31 04:20:32,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-08-31 04:20:32,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-08-31 04:20:32,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 215 transitions. [2021-08-31 04:20:32,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:20:32,666 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2021-08-31 04:20:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 215 transitions. [2021-08-31 04:20:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-08-31 04:20:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.7768595041322315) internal successors, (215), 120 states have internal predecessors, (215), 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-08-31 04:20:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 215 transitions. [2021-08-31 04:20:32,698 INFO L704 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2021-08-31 04:20:32,698 INFO L587 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2021-08-31 04:20:32,698 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 04:20:32,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 215 transitions. [2021-08-31 04:20:32,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-31 04:20:32,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:32,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:32,702 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:32,702 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:32,703 INFO L791 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 334#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 335#L408 assume !(1 == ~c_req_up~0); 297#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 375#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 382#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 360#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 361#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 343#L439-1 assume !(0 == ~e_f~0); 270#L444-1 assume !(0 == ~e_g~0); 271#L449-1 assume !(0 == ~e_e~0); 354#L454-1 assume !(0 == ~e_c~0); 355#L459-1 assume !(0 == ~e_wl~0); 309#L464-1 assume !(1 == ~wl_pc~0); 310#L476 assume !(2 == ~wl_pc~0); 307#L477 assume !(1 == ~c1_pc~0); 293#L487 assume !(1 == ~c2_pc~0); 295#L496 assume !(1 == ~wb_pc~0); 321#L505 assume !(1 == ~e_c~0); 322#L514-1 assume !(1 == ~e_e~0); 328#L519-1 assume !(1 == ~e_f~0); 336#L524-1 assume !(1 == ~e_g~0); 337#L529-1 assume !(1 == ~e_c~0); 263#L534-1 assume !(1 == ~e_wl~0); 264#L676-1 [2021-08-31 04:20:32,703 INFO L793 eck$LassoCheckResult]: Loop: 264#L676-1 assume !false; 269#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 291#L381 assume !false; 329#L299 assume !(0 == ~wl_st~0); 330#L303 assume !(0 == ~c1_st~0); 381#L306 assume !(0 == ~c2_st~0); 377#L309 assume !(0 == ~wb_st~0); 378#L312 assume !(0 == ~r_st~0); 383#L397 start_simulation_~kernel_st~0 := 2; 339#L552 assume !(1 == ~c_req_up~0); 340#L552-2 start_simulation_~kernel_st~0 := 3; 288#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 289#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 272#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 273#L574-1 assume !(0 == ~e_c~0); 283#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 284#L584-1 assume !(1 == ~wl_pc~0); 345#L596 assume !(2 == ~wl_pc~0); 347#L597 assume !(1 == ~c1_pc~0); 315#L607 assume !(1 == ~c2_pc~0); 316#L616 assume !(1 == ~wb_pc~0); 367#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 359#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 352#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 353#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 369#L649-1 assume !(1 == ~e_c~0); 338#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 303#L659-1 assume 0 == ~wl_st~0; 264#L676-1 [2021-08-31 04:20:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2021-08-31 04:20:32,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:32,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686244818] [2021-08-31 04:20:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:32,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:32,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:32,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686244818] [2021-08-31 04:20:32,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686244818] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:32,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:32,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:32,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692611719] [2021-08-31 04:20:32,743 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:20:32,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:32,744 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 1 times [2021-08-31 04:20:32,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:32,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113924873] [2021-08-31 04:20:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:32,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:32,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:32,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113924873] [2021-08-31 04:20:32,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113924873] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:32,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:32,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:32,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932550618] [2021-08-31 04:20:32,770 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:20:32,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:20:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:20:32,771 INFO L87 Difference]: Start difference. First operand 121 states and 215 transitions. cyclomatic complexity: 95 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:20:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:33,039 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2021-08-31 04:20:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:20:33,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 214 transitions. [2021-08-31 04:20:33,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-31 04:20:33,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 214 transitions. [2021-08-31 04:20:33,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-08-31 04:20:33,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-08-31 04:20:33,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 214 transitions. [2021-08-31 04:20:33,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:20:33,058 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2021-08-31 04:20:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 214 transitions. [2021-08-31 04:20:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-08-31 04:20:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.7685950413223142) internal successors, (214), 120 states have internal predecessors, (214), 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-08-31 04:20:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 214 transitions. [2021-08-31 04:20:33,067 INFO L704 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2021-08-31 04:20:33,067 INFO L587 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2021-08-31 04:20:33,067 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 04:20:33,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 214 transitions. [2021-08-31 04:20:33,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-31 04:20:33,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:33,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:33,069 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:33,069 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:33,070 INFO L791 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 583#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 584#L408 assume !(1 == ~c_req_up~0); 546#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 624#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 631#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 609#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 610#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 592#L439-1 assume !(0 == ~e_f~0); 519#L444-1 assume !(0 == ~e_g~0); 520#L449-1 assume !(0 == ~e_e~0); 603#L454-1 assume !(0 == ~e_c~0); 604#L459-1 assume !(0 == ~e_wl~0); 558#L464-1 assume !(1 == ~wl_pc~0); 559#L476 assume !(2 == ~wl_pc~0); 556#L477 assume !(1 == ~c1_pc~0); 542#L487 assume !(1 == ~c2_pc~0); 544#L496 assume !(1 == ~wb_pc~0); 570#L505 assume !(1 == ~e_c~0); 571#L514-1 assume !(1 == ~e_e~0); 577#L519-1 assume !(1 == ~e_f~0); 585#L524-1 assume !(1 == ~e_g~0); 586#L529-1 assume !(1 == ~e_c~0); 512#L534-1 assume !(1 == ~e_wl~0); 513#L676-1 [2021-08-31 04:20:33,070 INFO L793 eck$LassoCheckResult]: Loop: 513#L676-1 assume !false; 518#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 540#L381 assume !false; 578#L299 assume !(0 == ~wl_st~0); 579#L303 assume !(0 == ~c1_st~0); 630#L306 assume !(0 == ~c2_st~0); 626#L309 assume !(0 == ~wb_st~0); 627#L312 assume !(0 == ~r_st~0); 632#L397 start_simulation_~kernel_st~0 := 2; 588#L552 assume !(1 == ~c_req_up~0); 589#L552-2 start_simulation_~kernel_st~0 := 3; 537#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 538#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 521#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 522#L574-1 assume !(0 == ~e_c~0); 532#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 533#L584-1 assume !(1 == ~wl_pc~0); 594#L596 assume !(2 == ~wl_pc~0); 596#L597 assume !(1 == ~c1_pc~0); 564#L607 assume !(1 == ~c2_pc~0); 565#L616 assume !(1 == ~wb_pc~0); 616#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 608#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 601#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 602#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 618#L649-1 assume !(1 == ~e_c~0); 587#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 552#L659-1 assume 0 == ~wl_st~0; 513#L676-1 [2021-08-31 04:20:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:33,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2021-08-31 04:20:33,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:33,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754445828] [2021-08-31 04:20:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:33,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:33,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:33,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754445828] [2021-08-31 04:20:33,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754445828] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:33,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:33,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:33,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828265677] [2021-08-31 04:20:33,143 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:20:33,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:33,143 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 2 times [2021-08-31 04:20:33,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:33,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047204256] [2021-08-31 04:20:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:33,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:33,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:33,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047204256] [2021-08-31 04:20:33,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047204256] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:33,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:33,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:33,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466112346] [2021-08-31 04:20:33,183 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:20:33,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:33,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:20:33,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:20:33,183 INFO L87 Difference]: Start difference. First operand 121 states and 214 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:20:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:33,361 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2021-08-31 04:20:33,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:20:33,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 213 transitions. [2021-08-31 04:20:33,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-31 04:20:33,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 213 transitions. [2021-08-31 04:20:33,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-08-31 04:20:33,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-08-31 04:20:33,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 213 transitions. [2021-08-31 04:20:33,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:20:33,372 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2021-08-31 04:20:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 213 transitions. [2021-08-31 04:20:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-08-31 04:20:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.7603305785123966) internal successors, (213), 120 states have internal predecessors, (213), 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-08-31 04:20:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2021-08-31 04:20:33,385 INFO L704 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2021-08-31 04:20:33,385 INFO L587 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2021-08-31 04:20:33,386 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 04:20:33,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 213 transitions. [2021-08-31 04:20:33,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-31 04:20:33,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:33,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:33,387 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:33,387 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:33,388 INFO L791 eck$LassoCheckResult]: Stem: 878#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 832#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 833#L408 assume !(1 == ~c_req_up~0); 795#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 873#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 880#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 858#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 859#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 841#L439-1 assume !(0 == ~e_f~0); 768#L444-1 assume !(0 == ~e_g~0); 769#L449-1 assume !(0 == ~e_e~0); 852#L454-1 assume !(0 == ~e_c~0); 853#L459-1 assume !(0 == ~e_wl~0); 807#L464-1 assume !(1 == ~wl_pc~0); 808#L476 assume !(2 == ~wl_pc~0); 805#L477 assume !(1 == ~c1_pc~0); 791#L487 assume !(1 == ~c2_pc~0); 793#L496 assume !(1 == ~wb_pc~0); 819#L505 assume !(1 == ~e_c~0); 820#L514-1 assume !(1 == ~e_e~0); 826#L519-1 assume !(1 == ~e_f~0); 834#L524-1 assume !(1 == ~e_g~0); 835#L529-1 assume !(1 == ~e_c~0); 761#L534-1 assume !(1 == ~e_wl~0); 762#L676-1 [2021-08-31 04:20:33,388 INFO L793 eck$LassoCheckResult]: Loop: 762#L676-1 assume !false; 767#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 789#L381 assume !false; 827#L299 assume !(0 == ~wl_st~0); 828#L303 assume !(0 == ~c1_st~0); 879#L306 assume !(0 == ~c2_st~0); 875#L309 assume !(0 == ~wb_st~0); 876#L312 assume !(0 == ~r_st~0); 881#L397 start_simulation_~kernel_st~0 := 2; 837#L552 assume !(1 == ~c_req_up~0); 838#L552-2 start_simulation_~kernel_st~0 := 3; 786#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 787#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 770#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 771#L574-1 assume !(0 == ~e_c~0); 781#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 782#L584-1 assume !(1 == ~wl_pc~0); 843#L596 assume !(2 == ~wl_pc~0); 845#L597 assume !(1 == ~c1_pc~0); 813#L607 assume !(1 == ~c2_pc~0); 814#L616 assume !(1 == ~wb_pc~0); 865#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 857#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 850#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 851#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 867#L649-1 assume !(1 == ~e_c~0); 836#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 801#L659-1 assume 0 == ~wl_st~0; 762#L676-1 [2021-08-31 04:20:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:33,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2021-08-31 04:20:33,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:33,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094593745] [2021-08-31 04:20:33,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:33,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:33,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:33,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094593745] [2021-08-31 04:20:33,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094593745] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:33,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:33,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:33,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004550364] [2021-08-31 04:20:33,446 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:20:33,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:33,447 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 3 times [2021-08-31 04:20:33,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:33,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265093626] [2021-08-31 04:20:33,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:33,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:33,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:33,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265093626] [2021-08-31 04:20:33,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265093626] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:33,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:33,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:33,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354035152] [2021-08-31 04:20:33,486 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:20:33,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:33,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:20:33,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:20:33,486 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:20:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:33,693 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2021-08-31 04:20:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:20:33,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 212 transitions. [2021-08-31 04:20:33,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-31 04:20:33,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 212 transitions. [2021-08-31 04:20:33,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-08-31 04:20:33,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-08-31 04:20:33,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 212 transitions. [2021-08-31 04:20:33,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:20:33,703 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2021-08-31 04:20:33,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 212 transitions. [2021-08-31 04:20:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-08-31 04:20:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 120 states have internal predecessors, (212), 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-08-31 04:20:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2021-08-31 04:20:33,713 INFO L704 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2021-08-31 04:20:33,713 INFO L587 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2021-08-31 04:20:33,713 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 04:20:33,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 212 transitions. [2021-08-31 04:20:33,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-08-31 04:20:33,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:33,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:33,715 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:33,715 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:33,716 INFO L791 eck$LassoCheckResult]: Stem: 1127#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1081#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1082#L408 assume !(1 == ~c_req_up~0); 1044#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1122#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1129#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1107#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1108#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1090#L439-1 assume !(0 == ~e_f~0); 1017#L444-1 assume !(0 == ~e_g~0); 1018#L449-1 assume !(0 == ~e_e~0); 1101#L454-1 assume !(0 == ~e_c~0); 1102#L459-1 assume !(0 == ~e_wl~0); 1056#L464-1 assume !(1 == ~wl_pc~0); 1057#L476 assume !(2 == ~wl_pc~0); 1054#L477 assume !(1 == ~c1_pc~0); 1040#L487 assume !(1 == ~c2_pc~0); 1042#L496 assume !(1 == ~wb_pc~0); 1068#L505 assume !(1 == ~e_c~0); 1069#L514-1 assume !(1 == ~e_e~0); 1075#L519-1 assume !(1 == ~e_f~0); 1083#L524-1 assume !(1 == ~e_g~0); 1084#L529-1 assume !(1 == ~e_c~0); 1010#L534-1 assume !(1 == ~e_wl~0); 1011#L676-1 [2021-08-31 04:20:33,716 INFO L793 eck$LassoCheckResult]: Loop: 1011#L676-1 assume !false; 1016#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1038#L381 assume !false; 1076#L299 assume !(0 == ~wl_st~0); 1077#L303 assume !(0 == ~c1_st~0); 1128#L306 assume !(0 == ~c2_st~0); 1124#L309 assume !(0 == ~wb_st~0); 1125#L312 assume !(0 == ~r_st~0); 1130#L397 start_simulation_~kernel_st~0 := 2; 1086#L552 assume !(1 == ~c_req_up~0); 1087#L552-2 start_simulation_~kernel_st~0 := 3; 1035#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1036#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1019#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1020#L574-1 assume !(0 == ~e_c~0); 1030#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1031#L584-1 assume !(1 == ~wl_pc~0); 1092#L596 assume !(2 == ~wl_pc~0); 1094#L597 assume !(1 == ~c1_pc~0); 1062#L607 assume !(1 == ~c2_pc~0); 1063#L616 assume !(1 == ~wb_pc~0); 1114#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1106#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1099#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1100#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1116#L649-1 assume !(1 == ~e_c~0); 1085#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1050#L659-1 assume 0 == ~wl_st~0; 1011#L676-1 [2021-08-31 04:20:33,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:33,716 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2021-08-31 04:20:33,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:33,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406775208] [2021-08-31 04:20:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:33,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:33,743 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:33,798 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:33,799 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 4 times [2021-08-31 04:20:33,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:33,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462023395] [2021-08-31 04:20:33,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:33,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:33,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:33,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462023395] [2021-08-31 04:20:33,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462023395] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:33,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:33,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:33,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631841254] [2021-08-31 04:20:33,835 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:20:33,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:33,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:20:33,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:20:33,836 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:20:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:34,143 INFO L93 Difference]: Finished difference Result 153 states and 272 transitions. [2021-08-31 04:20:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:20:34,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 272 transitions. [2021-08-31 04:20:34,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2021-08-31 04:20:34,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 272 transitions. [2021-08-31 04:20:34,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2021-08-31 04:20:34,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2021-08-31 04:20:34,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 272 transitions. [2021-08-31 04:20:34,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:20:34,148 INFO L681 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2021-08-31 04:20:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 272 transitions. [2021-08-31 04:20:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-08-31 04:20:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 153 states have (on average 1.7777777777777777) internal successors, (272), 152 states have internal predecessors, (272), 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-08-31 04:20:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 272 transitions. [2021-08-31 04:20:34,151 INFO L704 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2021-08-31 04:20:34,151 INFO L587 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2021-08-31 04:20:34,151 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 04:20:34,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 272 transitions. [2021-08-31 04:20:34,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2021-08-31 04:20:34,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:34,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:34,153 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:34,153 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:34,154 INFO L791 eck$LassoCheckResult]: Stem: 1409#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1361#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1362#L408 assume !(1 == ~c_req_up~0); 1324#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1403#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1413#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1388#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1389#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1370#L439-1 assume !(0 == ~e_f~0); 1297#L444-1 assume !(0 == ~e_g~0); 1298#L449-1 assume !(0 == ~e_e~0); 1381#L454-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1382#L459-1 assume !(0 == ~e_wl~0); 1336#L464-1 assume !(1 == ~wl_pc~0); 1337#L476 assume !(2 == ~wl_pc~0); 1334#L477 assume !(1 == ~c1_pc~0); 1320#L487 assume !(1 == ~c2_pc~0); 1322#L496 assume !(1 == ~wb_pc~0); 1348#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 1349#L514-1 assume !(1 == ~e_e~0); 1355#L519-1 assume !(1 == ~e_f~0); 1364#L524-1 assume !(1 == ~e_g~0); 1365#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1290#L534-1 assume !(1 == ~e_wl~0); 1291#L676-1 [2021-08-31 04:20:34,154 INFO L793 eck$LassoCheckResult]: Loop: 1291#L676-1 assume !false; 1296#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1318#L381 assume !false; 1356#L299 assume !(0 == ~wl_st~0); 1357#L303 assume !(0 == ~c1_st~0); 1412#L306 assume !(0 == ~c2_st~0); 1405#L309 assume !(0 == ~wb_st~0); 1406#L312 assume !(0 == ~r_st~0); 1414#L397 start_simulation_~kernel_st~0 := 2; 1366#L552 assume !(1 == ~c_req_up~0); 1367#L552-2 start_simulation_~kernel_st~0 := 3; 1315#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1316#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1299#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1300#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1415#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1442#L584-1 assume 1 == ~wl_pc~0; 1440#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1438#L597 assume !(1 == ~c1_pc~0); 1436#L607 assume !(1 == ~c2_pc~0); 1433#L616 assume !(1 == ~wb_pc~0); 1410#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1411#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1432#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1431#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1396#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1363#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1330#L659-1 assume 0 == ~wl_st~0; 1291#L676-1 [2021-08-31 04:20:34,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:34,154 INFO L82 PathProgramCache]: Analyzing trace with hash 785152729, now seen corresponding path program 1 times [2021-08-31 04:20:34,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:34,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634714855] [2021-08-31 04:20:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:34,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:34,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:34,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634714855] [2021-08-31 04:20:34,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634714855] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:34,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:34,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 04:20:34,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847805414] [2021-08-31 04:20:34,179 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:20:34,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:34,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1254823475, now seen corresponding path program 1 times [2021-08-31 04:20:34,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:34,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636073742] [2021-08-31 04:20:34,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:34,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:34,184 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:34,190 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:34,423 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:20:34,424 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:20:34,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:20:34,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:20:34,424 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 04:20:34,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:34,425 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:20:34,426 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:20:34,426 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration6_Loop [2021-08-31 04:20:34,426 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:20:34,430 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:20:34,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,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-08-31 04:20:34,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-08-31 04:20:34,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-08-31 04:20:34,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-08-31 04:20:34,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,755 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:20:34,756 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 04:20:34,758 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:34,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:34,769 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-08-31 04:20:34,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:34,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:34,781 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-08-31 04:20:34,792 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:34,792 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:34,814 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-08-31 04:20:34,815 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:34,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:34,821 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-08-31 04:20:34,822 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-08-31 04:20:34,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:34,823 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:34,831 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:34,832 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:34,860 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-08-31 04:20:34,860 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:34,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:34,867 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-08-31 04:20:34,870 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-08-31 04:20:34,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:34,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:34,898 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-08-31 04:20:34,898 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:34,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:34,899 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-08-31 04:20:34,899 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-08-31 04:20:34,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 04:20:34,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:34,952 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 04:20:34,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:34,977 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:20:34,978 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:20:34,978 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:20:34,978 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:20:34,978 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 04:20:34,978 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:34,978 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:20:34,978 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:20:34,978 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration6_Loop [2021-08-31 04:20:34,978 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:20:34,978 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:20:34,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:34,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:35,272 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:20:35,275 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 04:20:35,276 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:35,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:35,277 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-08-31 04:20:35,284 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-08-31 04:20:35,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:35,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:35,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:35,294 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-31 04:20:35,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:35,296 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 04:20:35,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:35,297 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-08-31 04:20:35,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:35,331 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-08-31 04:20:35,331 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:35,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:35,333 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-08-31 04:20:35,339 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-08-31 04:20:35,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:35,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:35,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:35,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:35,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:35,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:35,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:35,350 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-08-31 04:20:35,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:35,391 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-08-31 04:20:35,391 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:35,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:35,393 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-08-31 04:20:35,411 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-08-31 04:20:35,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:35,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:35,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:35,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:35,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:35,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:35,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:35,423 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-08-31 04:20:35,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 04:20:35,440 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 04:20:35,441 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 04:20:35,442 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:35,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:35,443 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:35,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-31 04:20:35,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 04:20:35,446 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 04:20:35,446 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 04:20:35,446 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2021-08-31 04:20:35,471 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-08-31 04:20:35,473 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 04:20:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:35,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 04:20:35,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:20:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:35,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 04:20:35,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:20:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:35,758 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-08-31 04:20:35,759 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08-31 04:20:36,088 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-08-31 04:20:36,295 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 474 states and 835 transitions. Complement of second has 5 states. [2021-08-31 04:20:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-31 04:20:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08-31 04:20:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2021-08-31 04:20:36,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 28 letters. [2021-08-31 04:20:36,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:36,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 52 letters. Loop has 28 letters. [2021-08-31 04:20:36,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:36,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 56 letters. [2021-08-31 04:20:36,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:36,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 474 states and 835 transitions. [2021-08-31 04:20:36,305 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 302 [2021-08-31 04:20:36,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 474 states to 459 states and 805 transitions. [2021-08-31 04:20:36,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2021-08-31 04:20:36,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2021-08-31 04:20:36,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 805 transitions. [2021-08-31 04:20:36,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:36,309 INFO L681 BuchiCegarLoop]: Abstraction has 459 states and 805 transitions. [2021-08-31 04:20:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 805 transitions. [2021-08-31 04:20:36,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 351. [2021-08-31 04:20:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 351 states have (on average 1.754985754985755) internal successors, (616), 350 states have internal predecessors, (616), 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-08-31 04:20:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 616 transitions. [2021-08-31 04:20:36,315 INFO L704 BuchiCegarLoop]: Abstraction has 351 states and 616 transitions. [2021-08-31 04:20:36,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:36,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 04:20:36,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 04:20:36,316 INFO L87 Difference]: Start difference. First operand 351 states and 616 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:20:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:36,729 INFO L93 Difference]: Finished difference Result 640 states and 1104 transitions. [2021-08-31 04:20:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 04:20:36,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 640 states and 1104 transitions. [2021-08-31 04:20:36,734 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2021-08-31 04:20:36,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 640 states to 640 states and 1104 transitions. [2021-08-31 04:20:36,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 456 [2021-08-31 04:20:36,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 456 [2021-08-31 04:20:36,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 640 states and 1104 transitions. [2021-08-31 04:20:36,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:36,739 INFO L681 BuchiCegarLoop]: Abstraction has 640 states and 1104 transitions. [2021-08-31 04:20:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states and 1104 transitions. [2021-08-31 04:20:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 610. [2021-08-31 04:20:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 610 states have (on average 1.740983606557377) internal successors, (1062), 609 states have internal predecessors, (1062), 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-08-31 04:20:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1062 transitions. [2021-08-31 04:20:36,752 INFO L704 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2021-08-31 04:20:36,752 INFO L587 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2021-08-31 04:20:36,752 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 04:20:36,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 610 states and 1062 transitions. [2021-08-31 04:20:36,755 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2021-08-31 04:20:36,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:36,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:36,756 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:36,756 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:36,757 INFO L791 eck$LassoCheckResult]: Stem: 3326#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3217#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3218#L408 assume !(1 == ~c_req_up~0); 3320#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3343#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3342#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3341#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3340#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3231#L439-1 assume !(0 == ~e_f~0); 3102#L444-1 assume !(0 == ~e_g~0); 3103#L449-1 assume !(0 == ~e_e~0); 3252#L454-1 assume !(0 == ~e_c~0); 3253#L459-1 assume !(0 == ~e_wl~0); 3172#L464-1 assume !(1 == ~wl_pc~0); 3173#L476 assume !(2 == ~wl_pc~0); 3421#L477 assume !(1 == ~c1_pc~0); 3431#L487 assume !(1 == ~c2_pc~0); 3389#L496 assume !(1 == ~wb_pc~0); 3350#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 3194#L514-1 assume !(1 == ~e_e~0); 3205#L519-1 assume !(1 == ~e_f~0); 3219#L524-1 assume !(1 == ~e_g~0); 3220#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3088#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3089#L676-1 [2021-08-31 04:20:36,757 INFO L793 eck$LassoCheckResult]: Loop: 3089#L676-1 assume !false; 3099#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 3141#L381 assume !false; 3206#L299 assume !(0 == ~wl_st~0); 3207#L303 assume !(0 == ~c1_st~0); 3331#L306 assume !(0 == ~c2_st~0); 3312#L309 assume !(0 == ~wb_st~0); 3313#L312 assume !(0 == ~r_st~0); 3335#L397 start_simulation_~kernel_st~0 := 2; 3223#L552 assume !(1 == ~c_req_up~0); 3224#L552-2 start_simulation_~kernel_st~0 := 3; 3264#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 3477#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3475#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3476#L574-1 assume !(0 == ~e_c~0); 3471#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3472#L584-1 assume 1 == ~wl_pc~0; 3466#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3465#L597 assume !(1 == ~c1_pc~0); 3460#L607 assume !(1 == ~c2_pc~0); 3459#L616 assume !(1 == ~wb_pc~0); 3453#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 3328#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3546#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3543#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3288#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3221#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3162#L659-1 assume 0 == ~wl_st~0; 3089#L676-1 [2021-08-31 04:20:36,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:36,757 INFO L82 PathProgramCache]: Analyzing trace with hash 198346713, now seen corresponding path program 1 times [2021-08-31 04:20:36,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:36,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821806910] [2021-08-31 04:20:36,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:36,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:36,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:36,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821806910] [2021-08-31 04:20:36,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821806910] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:36,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:36,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:36,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094510963] [2021-08-31 04:20:36,794 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:20:36,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:36,794 INFO L82 PathProgramCache]: Analyzing trace with hash 243706225, now seen corresponding path program 1 times [2021-08-31 04:20:36,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:36,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416513299] [2021-08-31 04:20:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:36,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:36,799 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:36,804 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:37,022 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:20:37,022 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:20:37,022 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:20:37,023 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:20:37,023 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 04:20:37,023 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,023 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:20:37,023 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:20:37,023 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2021-08-31 04:20:37,023 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:20:37,023 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:20:37,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,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-08-31 04:20:37,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-08-31 04:20:37,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-08-31 04:20:37,277 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:20:37,277 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 04:20:37,278 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,279 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-08-31 04:20:37,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:37,282 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:37,284 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-08-31 04:20:37,289 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:37,290 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet10=0} Honda state: {ULTIMATE.start_eval_#t~nondet10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:37,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-08-31 04:20:37,306 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,307 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-08-31 04:20:37,307 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-08-31 04:20:37,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:37,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:37,321 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:37,322 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:37,338 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-08-31 04:20:37,338 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,339 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-08-31 04:20:37,340 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-08-31 04:20:37,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:37,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:37,350 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:37,350 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:37,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-08-31 04:20:37,368 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,369 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-08-31 04:20:37,369 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-08-31 04:20:37,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:37,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:37,378 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:37,378 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:37,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:37,395 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,396 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:37,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-31 04:20:37,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:37,399 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:37,425 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:37,425 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet9=0} Honda state: {ULTIMATE.start_eval_#t~nondet9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:37,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:37,457 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,458 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:37,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-31 04:20:37,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:37,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:37,482 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:37,482 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7=0} Honda state: {ULTIMATE.start_eval_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:37,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:37,502 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,505 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:37,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-31 04:20:37,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:37,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:37,525 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:37,525 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:37,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:37,543 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,544 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:37,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-31 04:20:37,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:37,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:37,556 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:37,557 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:37,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:37,572 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,573 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:37,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-31 04:20:37,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:37,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:37,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:37,598 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,599 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:37,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-31 04:20:37,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 04:20:37,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:37,612 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 04:20:37,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-08-31 04:20:37,628 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:20:37,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:20:37,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:20:37,629 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:20:37,629 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 04:20:37,629 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,629 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:20:37,629 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:20:37,629 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2021-08-31 04:20:37,629 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:20:37,629 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:20:37,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:37,878 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:20:37,878 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 04:20:37,878 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,883 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:37,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-31 04:20:37,900 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-08-31 04:20:37,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:37,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:37,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:37,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:37,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:37,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:37,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:37,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:37,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:37,925 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,927 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:37,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-31 04:20:37,930 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-08-31 04:20:37,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:37,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:37,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:37,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:37,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:37,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:37,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:37,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:37,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:37,956 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,957 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:37,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-31 04:20:37,959 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-08-31 04:20:37,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:37,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:37,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:37,966 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-31 04:20:37,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:37,966 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 04:20:37,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:37,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:37,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:37,988 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:37,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:37,989 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:37,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-31 04:20:37,991 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-08-31 04:20:37,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:37,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:37,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:38,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:38,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:38,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:38,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:38,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:38,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:38,024 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:38,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:38,025 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:38,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-31 04:20:38,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:20:38,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:38,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:38,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:38,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:38,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:38,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:38,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:38,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:38,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-08-31 04:20:38,064 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:38,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:38,065 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:38,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-31 04:20:38,067 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-08-31 04:20:38,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:38,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:38,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:38,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:38,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:38,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:38,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:38,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:38,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-08-31 04:20:38,090 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:38,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:38,091 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:38,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-31 04:20:38,092 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-08-31 04:20:38,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:38,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:38,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:38,098 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-31 04:20:38,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:38,099 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 04:20:38,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:38,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:38,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:38,118 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:38,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:38,118 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:38,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-31 04:20:38,121 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-08-31 04:20:38,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:38,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:38,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:38,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:38,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:38,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:38,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:38,137 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 04:20:38,139 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 04:20:38,139 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 04:20:38,140 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:38,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:38,159 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:38,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-31 04:20:38,162 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 04:20:38,162 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 04:20:38,162 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 04:20:38,162 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -2*~e_c~0 + 3 Supporting invariants [] [2021-08-31 04:20:38,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-08-31 04:20:38,198 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 04:20:38,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:38,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 04:20:38,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:20:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:38,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 04:20:38,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:20:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:38,501 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-08-31 04:20:38,502 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08-31 04:20:38,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:39,006 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 995 states and 1726 transitions. Complement of second has 7 states. [2021-08-31 04:20:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-31 04:20:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08-31 04:20:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2021-08-31 04:20:39,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2021-08-31 04:20:39,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:39,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2021-08-31 04:20:39,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:39,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2021-08-31 04:20:39,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:39,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 995 states and 1726 transitions. [2021-08-31 04:20:39,015 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 562 [2021-08-31 04:20:39,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 995 states to 991 states and 1718 transitions. [2021-08-31 04:20:39,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 640 [2021-08-31 04:20:39,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 643 [2021-08-31 04:20:39,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 991 states and 1718 transitions. [2021-08-31 04:20:39,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:39,022 INFO L681 BuchiCegarLoop]: Abstraction has 991 states and 1718 transitions. [2021-08-31 04:20:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states and 1718 transitions. [2021-08-31 04:20:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 531. [2021-08-31 04:20:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 531 states have (on average 1.7401129943502824) internal successors, (924), 530 states have internal predecessors, (924), 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-08-31 04:20:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 924 transitions. [2021-08-31 04:20:39,034 INFO L704 BuchiCegarLoop]: Abstraction has 531 states and 924 transitions. [2021-08-31 04:20:39,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:39,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:20:39,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:20:39,034 INFO L87 Difference]: Start difference. First operand 531 states and 924 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:20:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:39,332 INFO L93 Difference]: Finished difference Result 805 states and 1385 transitions. [2021-08-31 04:20:39,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:20:39,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 805 states and 1385 transitions. [2021-08-31 04:20:39,339 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 461 [2021-08-31 04:20:39,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 805 states to 636 states and 1094 transitions. [2021-08-31 04:20:39,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 541 [2021-08-31 04:20:39,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 546 [2021-08-31 04:20:39,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 636 states and 1094 transitions. [2021-08-31 04:20:39,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:39,343 INFO L681 BuchiCegarLoop]: Abstraction has 636 states and 1094 transitions. [2021-08-31 04:20:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states and 1094 transitions. [2021-08-31 04:20:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 449. [2021-08-31 04:20:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 449 states have (on average 1.730512249443207) internal successors, (777), 448 states have internal predecessors, (777), 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-08-31 04:20:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 777 transitions. [2021-08-31 04:20:39,353 INFO L704 BuchiCegarLoop]: Abstraction has 449 states and 777 transitions. [2021-08-31 04:20:39,353 INFO L587 BuchiCegarLoop]: Abstraction has 449 states and 777 transitions. [2021-08-31 04:20:39,353 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 04:20:39,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 449 states and 777 transitions. [2021-08-31 04:20:39,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 281 [2021-08-31 04:20:39,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:39,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:39,356 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:39,356 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:39,356 INFO L791 eck$LassoCheckResult]: Stem: 6430#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6338#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 6339#L408 assume !(1 == ~c_req_up~0); 6425#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6439#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6440#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6467#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6466#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6465#L439-1 assume !(0 == ~e_f~0); 6223#L444-1 assume !(0 == ~e_g~0); 6224#L449-1 assume !(0 == ~e_e~0); 6379#L454-1 assume !(0 == ~e_c~0); 6380#L459-1 assume !(0 == ~e_wl~0); 6293#L464-1 assume !(1 == ~wl_pc~0); 6294#L476 assume !(2 == ~wl_pc~0); 6291#L477 assume !(1 == ~c1_pc~0); 6268#L487 assume !(1 == ~c2_pc~0); 6270#L496 assume !(1 == ~wb_pc~0); 6314#L505 assume !(1 == ~e_c~0); 6315#L514-1 assume !(1 == ~e_e~0); 6443#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6340#L524-1 assume !(1 == ~e_g~0); 6341#L529-1 assume !(1 == ~e_c~0); 6210#L534-1 assume !(1 == ~e_wl~0); 6211#L676-1 [2021-08-31 04:20:39,356 INFO L793 eck$LassoCheckResult]: Loop: 6211#L676-1 assume !false; 6220#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 6262#L381 assume !false; 6328#L299 assume !(0 == ~wl_st~0); 6329#L303 assume !(0 == ~c1_st~0); 6432#L306 assume !(0 == ~c2_st~0); 6420#L309 assume !(0 == ~wb_st~0); 6421#L312 assume !(0 == ~r_st~0); 6436#L397 start_simulation_~kernel_st~0 := 2; 6437#L552 assume !(1 == ~c_req_up~0); 6476#L552-2 start_simulation_~kernel_st~0 := 3; 6475#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 6267#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6225#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6226#L574-1 assume !(0 == ~e_c~0); 6247#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6248#L584-1 assume !(1 == ~wl_pc~0); 6357#L596 assume !(2 == ~wl_pc~0); 6359#L597 assume !(1 == ~c1_pc~0); 6302#L607 assume !(1 == ~c2_pc~0); 6303#L616 assume !(1 == ~wb_pc~0); 6396#L625 assume !(1 == ~e_c~0); 6383#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 6371#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6372#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 6429#L649-1 assume !(1 == ~e_c~0); 6342#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6283#L659-1 assume 0 == ~wl_st~0; 6211#L676-1 [2021-08-31 04:20:39,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2021-08-31 04:20:39,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:39,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485009801] [2021-08-31 04:20:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:39,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:39,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:39,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485009801] [2021-08-31 04:20:39,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485009801] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:39,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:39,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 04:20:39,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665879078] [2021-08-31 04:20:39,385 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:20:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:39,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1726992066, now seen corresponding path program 1 times [2021-08-31 04:20:39,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:39,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163774812] [2021-08-31 04:20:39,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:39,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:39,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:39,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163774812] [2021-08-31 04:20:39,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163774812] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:39,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:39,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 04:20:39,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176932861] [2021-08-31 04:20:39,399 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:20:39,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:39,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 04:20:39,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 04:20:39,399 INFO L87 Difference]: Start difference. First operand 449 states and 777 transitions. cyclomatic complexity: 331 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:20:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:39,808 INFO L93 Difference]: Finished difference Result 561 states and 961 transitions. [2021-08-31 04:20:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 04:20:39,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 961 transitions. [2021-08-31 04:20:39,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 338 [2021-08-31 04:20:39,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 561 states and 961 transitions. [2021-08-31 04:20:39,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 451 [2021-08-31 04:20:39,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 451 [2021-08-31 04:20:39,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 961 transitions. [2021-08-31 04:20:39,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:39,822 INFO L681 BuchiCegarLoop]: Abstraction has 561 states and 961 transitions. [2021-08-31 04:20:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 961 transitions. [2021-08-31 04:20:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 552. [2021-08-31 04:20:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 552 states have (on average 1.7228260869565217) internal successors, (951), 551 states have internal predecessors, (951), 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-08-31 04:20:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 951 transitions. [2021-08-31 04:20:39,831 INFO L704 BuchiCegarLoop]: Abstraction has 552 states and 951 transitions. [2021-08-31 04:20:39,831 INFO L587 BuchiCegarLoop]: Abstraction has 552 states and 951 transitions. [2021-08-31 04:20:39,831 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 04:20:39,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 552 states and 951 transitions. [2021-08-31 04:20:39,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 336 [2021-08-31 04:20:39,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:39,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:39,835 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:39,835 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:39,837 INFO L791 eck$LassoCheckResult]: Stem: 7460#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 7363#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 7364#L408 assume !(1 == ~c_req_up~0); 7453#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7525#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7524#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7523#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7522#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 7379#L439-1 assume !(0 == ~e_f~0); 7246#L444-1 assume !(0 == ~e_g~0); 7247#L449-1 assume !(0 == ~e_e~0); 7402#L454-1 assume !(0 == ~e_c~0); 7403#L459-1 assume !(0 == ~e_wl~0); 7319#L464-1 assume !(1 == ~wl_pc~0); 7320#L476 assume !(2 == ~wl_pc~0); 7317#L477 assume !(1 == ~c1_pc~0); 7294#L487 assume !(1 == ~c2_pc~0); 7296#L496 assume !(1 == ~wb_pc~0); 7549#L505 assume !(1 == ~e_c~0); 7548#L514-1 assume !(1 == ~e_e~0); 7547#L519-1 assume !(1 == ~e_f~0); 7365#L524-1 assume !(1 == ~e_g~0); 7366#L529-1 assume !(1 == ~e_c~0); 7231#L534-1 assume !(1 == ~e_wl~0); 7232#L676-1 [2021-08-31 04:20:39,837 INFO L793 eck$LassoCheckResult]: Loop: 7232#L676-1 assume !false; 7243#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 7287#L381 assume !false; 7353#L299 assume !(0 == ~wl_st~0); 7354#L303 assume !(0 == ~c1_st~0); 7465#L306 assume !(0 == ~c2_st~0); 7447#L309 assume !(0 == ~wb_st~0); 7448#L312 assume !(0 == ~r_st~0); 7469#L397 start_simulation_~kernel_st~0 := 2; 7370#L552 assume !(1 == ~c_req_up~0); 7371#L552-2 start_simulation_~kernel_st~0 := 3; 7281#L564 assume !(0 == ~e_f~0); 7282#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7625#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7624#L574-1 assume !(0 == ~e_c~0); 7604#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 7584#L584-1 assume !(1 == ~wl_pc~0); 7585#L596 assume !(2 == ~wl_pc~0); 7749#L597 assume !(1 == ~c1_pc~0); 7747#L607 assume !(1 == ~c2_pc~0); 7744#L616 assume !(1 == ~wb_pc~0); 7743#L625 assume !(1 == ~e_c~0); 7742#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7741#L639-1 assume !(1 == ~e_f~0); 7740#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7739#L649-1 assume !(1 == ~e_c~0); 7738#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7309#L659-1 assume 0 == ~wl_st~0; 7232#L676-1 [2021-08-31 04:20:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2021-08-31 04:20:39,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:39,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842553614] [2021-08-31 04:20:39,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:39,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:39,854 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:39,877 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash 981474370, now seen corresponding path program 1 times [2021-08-31 04:20:39,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:39,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798222314] [2021-08-31 04:20:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:39,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:39,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:39,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798222314] [2021-08-31 04:20:39,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798222314] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:39,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:39,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 04:20:39,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359856476] [2021-08-31 04:20:39,896 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:20:39,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:39,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:20:39,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:20:39,897 INFO L87 Difference]: Start difference. First operand 552 states and 951 transitions. cyclomatic complexity: 402 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:20:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:40,136 INFO L93 Difference]: Finished difference Result 807 states and 1374 transitions. [2021-08-31 04:20:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:20:40,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 807 states and 1374 transitions. [2021-08-31 04:20:40,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 530 [2021-08-31 04:20:40,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 807 states to 807 states and 1374 transitions. [2021-08-31 04:20:40,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 637 [2021-08-31 04:20:40,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 637 [2021-08-31 04:20:40,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 807 states and 1374 transitions. [2021-08-31 04:20:40,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:40,155 INFO L681 BuchiCegarLoop]: Abstraction has 807 states and 1374 transitions. [2021-08-31 04:20:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states and 1374 transitions. [2021-08-31 04:20:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2021-08-31 04:20:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 807 states have (on average 1.7026022304832713) internal successors, (1374), 806 states have internal predecessors, (1374), 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-08-31 04:20:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1374 transitions. [2021-08-31 04:20:40,168 INFO L704 BuchiCegarLoop]: Abstraction has 807 states and 1374 transitions. [2021-08-31 04:20:40,168 INFO L587 BuchiCegarLoop]: Abstraction has 807 states and 1374 transitions. [2021-08-31 04:20:40,168 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 04:20:40,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 807 states and 1374 transitions. [2021-08-31 04:20:40,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 530 [2021-08-31 04:20:40,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:40,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:40,172 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:40,172 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:40,173 INFO L791 eck$LassoCheckResult]: Stem: 8839#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 8726#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 8727#L408 assume !(1 == ~c_req_up~0); 8662#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 8958#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 8957#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 8956#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 8955#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8746#L439-1 assume !(0 == ~e_f~0); 8612#L444-1 assume !(0 == ~e_g~0); 8613#L449-1 assume !(0 == ~e_e~0); 8774#L454-1 assume !(0 == ~e_c~0); 8775#L459-1 assume !(0 == ~e_wl~0); 8982#L464-1 assume !(1 == ~wl_pc~0); 8979#L476 assume !(2 == ~wl_pc~0); 8974#L477 assume !(1 == ~c1_pc~0); 8970#L487 assume !(1 == ~c2_pc~0); 8966#L496 assume !(1 == ~wb_pc~0); 8962#L505 assume !(1 == ~e_c~0); 8961#L514-1 assume !(1 == ~e_e~0); 8960#L519-1 assume !(1 == ~e_f~0); 8732#L524-1 assume !(1 == ~e_g~0); 8733#L529-1 assume !(1 == ~e_c~0); 8596#L534-1 assume !(1 == ~e_wl~0); 8597#L676-1 [2021-08-31 04:20:40,173 INFO L793 eck$LassoCheckResult]: Loop: 8597#L676-1 assume !false; 9029#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 9315#L381 assume !false; 9313#L299 assume !(0 == ~wl_st~0); 8843#L303 assume !(0 == ~c1_st~0); 8844#L306 assume !(0 == ~c2_st~0); 8827#L309 assume !(0 == ~wb_st~0); 8829#L312 assume !(0 == ~r_st~0); 8848#L397 start_simulation_~kernel_st~0 := 2; 8734#L552 assume !(1 == ~c_req_up~0); 8735#L552-2 start_simulation_~kernel_st~0 := 3; 8646#L564 assume !(0 == ~e_f~0); 8647#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 9336#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 8850#L574-1 assume !(0 == ~e_c~0); 8851#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 8832#L584-1 assume 1 == ~wl_pc~0; 8755#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 8756#L597 assume !(1 == ~c1_pc~0); 9301#L607 assume !(1 == ~c2_pc~0); 9298#L616 assume !(1 == ~wb_pc~0); 8841#L625 assume !(1 == ~e_c~0); 8778#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 8779#L639-1 assume !(1 == ~e_f~0); 9242#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 9034#L649-1 assume !(1 == ~e_c~0); 9035#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 9030#L659-1 assume 0 == ~wl_st~0; 8597#L676-1 [2021-08-31 04:20:40,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:40,173 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 3 times [2021-08-31 04:20:40,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:40,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657167375] [2021-08-31 04:20:40,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:40,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:40,180 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:40,188 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:40,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:40,189 INFO L82 PathProgramCache]: Analyzing trace with hash 432214649, now seen corresponding path program 1 times [2021-08-31 04:20:40,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:40,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452496559] [2021-08-31 04:20:40,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:40,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:40,193 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:40,196 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:40,197 INFO L82 PathProgramCache]: Analyzing trace with hash -508129585, now seen corresponding path program 1 times [2021-08-31 04:20:40,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:40,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393113711] [2021-08-31 04:20:40,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:40,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:40,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:40,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393113711] [2021-08-31 04:20:40,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393113711] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:40,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:40,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:40,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274688969] [2021-08-31 04:20:40,361 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:20:40,362 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:20:40,362 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:20:40,362 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:20:40,362 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 04:20:40,362 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:40,362 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:20:40,362 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:20:40,363 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2021-08-31 04:20:40,363 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:20:40,363 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:20:40,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,604 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:20:40,605 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 04:20:40,605 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:40,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:40,606 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:40,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-31 04:20:40,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:40,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:40,616 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:40,616 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:40,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:40,632 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:40,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:40,632 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:40,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-31 04:20:40,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:40,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:40,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:40,665 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-7} Honda state: {~e_c~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:40,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:40,689 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:40,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:40,690 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:40,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:40,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:40,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-31 04:20:40,729 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:40,729 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:40,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:40,754 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:40,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:40,755 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:40,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-31 04:20:40,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:40,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:40,775 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:40,775 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet10=0} Honda state: {ULTIMATE.start_eval_#t~nondet10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:40,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:40,791 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:40,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:40,791 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:40,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-31 04:20:40,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:40,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:40,800 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:40,800 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:40,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:40,815 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:40,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:40,816 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:40,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-31 04:20:40,817 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:40,817 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:40,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:40,841 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:40,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:40,841 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:40,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-31 04:20:40,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 04:20:40,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:40,856 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 04:20:40,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:40,874 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:20:40,874 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:20:40,874 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:20:40,874 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:20:40,874 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 04:20:40,874 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:40,874 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:20:40,874 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:20:40,874 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2021-08-31 04:20:40,874 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:20:40,874 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:20:40,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,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-08-31 04:20:40,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,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-08-31 04:20:40,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-08-31 04:20:40,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:40,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:41,100 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:20:41,100 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 04:20:41,101 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:41,104 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:41,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-31 04:20:41,106 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-08-31 04:20:41,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:41,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:41,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:41,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:41,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:41,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:41,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:41,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:41,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-08-31 04:20:41,168 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:41,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:41,168 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:41,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-31 04:20:41,170 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-08-31 04:20:41,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:41,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:41,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:41,176 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-31 04:20:41,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:41,176 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 04:20:41,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:41,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:41,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-08-31 04:20:41,195 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:41,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:41,196 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:41,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-31 04:20:41,197 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-08-31 04:20:41,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:41,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:41,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:41,203 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-31 04:20:41,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:41,204 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 04:20:41,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:41,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:41,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:41,226 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:41,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:41,227 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:41,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-31 04:20:41,228 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-08-31 04:20:41,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:41,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:41,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:41,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:41,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:41,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:41,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:41,236 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 04:20:41,238 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 04:20:41,238 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 04:20:41,238 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:41,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:41,245 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:41,249 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 04:20:41,249 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 04:20:41,249 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 04:20:41,249 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2021-08-31 04:20:41,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-31 04:20:41,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:41,268 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 04:20:41,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:41,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 04:20:41,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:20:41,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:41,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 04:20:41,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:20:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:41,571 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-08-31 04:20:41,571 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 807 states and 1374 transitions. cyclomatic complexity: 570 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08-31 04:20:41,986 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 807 states and 1374 transitions. cyclomatic complexity: 570. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 2879 states and 4876 transitions. Complement of second has 5 states. [2021-08-31 04:20:41,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-31 04:20:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-08-31 04:20:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2021-08-31 04:20:41,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 28 letters. [2021-08-31 04:20:41,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:41,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 52 letters. Loop has 28 letters. [2021-08-31 04:20:41,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:41,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 56 letters. [2021-08-31 04:20:41,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:41,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2879 states and 4876 transitions. [2021-08-31 04:20:42,012 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1560 [2021-08-31 04:20:42,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2879 states to 2879 states and 4876 transitions. [2021-08-31 04:20:42,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1670 [2021-08-31 04:20:42,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1687 [2021-08-31 04:20:42,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2879 states and 4876 transitions. [2021-08-31 04:20:42,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:42,026 INFO L681 BuchiCegarLoop]: Abstraction has 2879 states and 4876 transitions. [2021-08-31 04:20:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states and 4876 transitions. [2021-08-31 04:20:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2157. [2021-08-31 04:20:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2157 states have (on average 1.6917014371812702) internal successors, (3649), 2156 states have internal predecessors, (3649), 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-08-31 04:20:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3649 transitions. [2021-08-31 04:20:42,062 INFO L704 BuchiCegarLoop]: Abstraction has 2157 states and 3649 transitions. [2021-08-31 04:20:42,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:42,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:20:42,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:20:42,063 INFO L87 Difference]: Start difference. First operand 2157 states and 3649 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-08-31 04:20:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:42,318 INFO L93 Difference]: Finished difference Result 2157 states and 3613 transitions. [2021-08-31 04:20:42,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:20:42,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2157 states and 3613 transitions. [2021-08-31 04:20:42,332 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1030 [2021-08-31 04:20:42,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2157 states to 2157 states and 3613 transitions. [2021-08-31 04:20:42,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1140 [2021-08-31 04:20:42,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1140 [2021-08-31 04:20:42,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2157 states and 3613 transitions. [2021-08-31 04:20:42,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:42,359 INFO L681 BuchiCegarLoop]: Abstraction has 2157 states and 3613 transitions. [2021-08-31 04:20:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states and 3613 transitions. [2021-08-31 04:20:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2157. [2021-08-31 04:20:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2157 states have (on average 1.6750115901715346) internal successors, (3613), 2156 states have internal predecessors, (3613), 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-08-31 04:20:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3613 transitions. [2021-08-31 04:20:42,399 INFO L704 BuchiCegarLoop]: Abstraction has 2157 states and 3613 transitions. [2021-08-31 04:20:42,400 INFO L587 BuchiCegarLoop]: Abstraction has 2157 states and 3613 transitions. [2021-08-31 04:20:42,400 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 04:20:42,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2157 states and 3613 transitions. [2021-08-31 04:20:42,409 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1030 [2021-08-31 04:20:42,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:42,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:42,410 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:42,410 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:42,410 INFO L791 eck$LassoCheckResult]: Stem: 17051#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 16909#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 16910#L408 assume !(1 == ~c_req_up~0); 16843#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 17066#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 17067#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16971#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16972#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16930#L439-1 assume !(0 == ~e_f~0); 16931#L444-1 assume !(0 == ~e_g~0); 17032#L449-1 assume !(0 == ~e_e~0); 17033#L454-1 assume !(0 == ~e_c~0); 17129#L459-1 assume !(0 == ~e_wl~0); 17128#L464-1 assume !(1 == ~wl_pc~0); 17126#L476 assume !(2 == ~wl_pc~0); 17124#L477 assume !(1 == ~c1_pc~0); 17122#L487 assume !(1 == ~c2_pc~0); 17120#L496 assume !(1 == ~wb_pc~0); 17117#L505 assume !(1 == ~e_c~0); 17115#L514-1 assume !(1 == ~e_e~0); 17113#L519-1 assume !(1 == ~e_f~0); 17112#L524-1 assume !(1 == ~e_g~0); 17072#L529-1 assume !(1 == ~e_c~0); 16775#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 16776#L676-1 [2021-08-31 04:20:42,410 INFO L793 eck$LassoCheckResult]: Loop: 16776#L676-1 assume !false; 18689#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 18687#L381 assume !false; 18686#L299 assume 0 == ~wl_st~0; 18685#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 18683#L325 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 18680#L58 assume 0 == ~wl_pc~0; 18607#L71 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 18602#L321 assume !(0 == ~c1_st~0); 18577#L336 assume !(0 == ~c2_st~0); 18574#L351 assume !(0 == ~wb_st~0); 18508#L366 assume !(0 == ~r_st~0); 18049#L381 assume !false; 18503#L299 assume !(0 == ~wl_st~0); 18504#L303 assume !(0 == ~c1_st~0); 18499#L306 assume !(0 == ~c2_st~0); 18500#L309 assume !(0 == ~wb_st~0); 18493#L312 assume !(0 == ~r_st~0); 18495#L397 start_simulation_~kernel_st~0 := 2; 16917#L552 assume !(1 == ~c_req_up~0); 16918#L552-2 start_simulation_~kernel_st~0 := 3; 18744#L564 assume !(0 == ~e_f~0); 18739#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 18737#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 18736#L574-1 assume !(0 == ~e_c~0); 18735#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 18734#L584-1 assume 1 == ~wl_pc~0; 18732#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 18729#L597 assume !(1 == ~c1_pc~0); 18724#L607 assume !(1 == ~c2_pc~0); 18721#L616 assume !(1 == ~wb_pc~0); 18720#L625 assume !(1 == ~e_c~0); 18719#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 18718#L639-1 assume !(1 == ~e_f~0); 18716#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 18715#L649-1 assume !(1 == ~e_c~0); 18710#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 18708#L659-1 assume 0 == ~wl_st~0; 16776#L676-1 [2021-08-31 04:20:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2021-08-31 04:20:42,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:42,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389694742] [2021-08-31 04:20:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:42,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:42,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:42,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389694742] [2021-08-31 04:20:42,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389694742] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:42,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:42,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:42,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485839136] [2021-08-31 04:20:42,436 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:20:42,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:42,437 INFO L82 PathProgramCache]: Analyzing trace with hash 254830061, now seen corresponding path program 1 times [2021-08-31 04:20:42,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:42,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718857475] [2021-08-31 04:20:42,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:42,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:42,441 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:42,447 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:42,688 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:20:42,688 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:20:42,688 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:20:42,688 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:20:42,688 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 04:20:42,688 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:42,688 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:20:42,688 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:20:42,688 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration11_Loop [2021-08-31 04:20:42,688 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:20:42,688 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:20:42,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:42,913 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:20:42,914 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 04:20:42,914 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:42,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:42,916 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:42,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-31 04:20:42,918 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:42,918 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:42,929 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:42,929 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:42,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:42,945 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:42,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:42,946 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:42,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-31 04:20:42,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:42,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:42,955 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:42,955 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:42,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-08-31 04:20:42,970 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:42,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:42,971 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:42,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-31 04:20:42,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:42,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:42,985 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:42,985 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:43,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:43,001 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,002 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:43,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-31 04:20:43,004 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:43,004 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:43,025 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:43,025 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:43,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:43,042 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,043 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:43,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-31 04:20:43,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:43,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:43,055 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:43,056 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:43,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-08-31 04:20:43,072 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,073 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:43,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-31 04:20:43,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:43,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:43,082 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 04:20:43,082 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 04:20:43,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:43,098 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,099 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:20:43,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-08-31 04:20:43,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:43,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:43,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-08-31 04:20:43,124 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,125 INFO L229 MonitoredProcess]: Starting monitored process 48 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-08-31 04:20:43,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-08-31 04:20:43,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 04:20:43,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:43,135 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 04:20:43,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-08-31 04:20:43,151 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:20:43,151 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:20:43,151 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:20:43,151 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:20:43,151 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 04:20:43,151 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,151 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:20:43,151 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:20:43,151 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration11_Loop [2021-08-31 04:20:43,151 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:20:43,152 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:20:43,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:43,411 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:20:43,411 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 04:20:43,412 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,413 INFO L229 MonitoredProcess]: Starting monitored process 49 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-08-31 04:20:43,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-08-31 04:20:43,415 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-08-31 04:20:43,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:43,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:43,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:43,421 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-31 04:20:43,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:43,422 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 04:20:43,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:43,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:43,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:43,439 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,440 INFO L229 MonitoredProcess]: Starting monitored process 50 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-08-31 04:20:43,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-08-31 04:20:43,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:20:43,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:43,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:43,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:43,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:43,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:43,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:43,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:43,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:43,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:43,471 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,471 INFO L229 MonitoredProcess]: Starting monitored process 51 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-08-31 04:20:43,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-08-31 04:20:43,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:20:43,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:43,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:43,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:43,484 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-31 04:20:43,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:43,485 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 04:20:43,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:43,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:43,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:43,502 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,504 INFO L229 MonitoredProcess]: Starting monitored process 52 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-08-31 04:20:43,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-08-31 04:20:43,506 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-08-31 04:20:43,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:43,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:43,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:43,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:43,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:43,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:43,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:43,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:43,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-08-31 04:20:43,531 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,532 INFO L229 MonitoredProcess]: Starting monitored process 53 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-08-31 04:20:43,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-08-31 04:20:43,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:20:43,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:43,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:43,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:43,540 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-31 04:20:43,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:43,546 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 04:20:43,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:43,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:20:43,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-08-31 04:20:43,564 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,564 INFO L229 MonitoredProcess]: Starting monitored process 54 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-08-31 04:20:43,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-08-31 04:20:43,566 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-08-31 04:20:43,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:43,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:43,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:43,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:43,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:43,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:43,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:43,574 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 04:20:43,576 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 04:20:43,576 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 04:20:43,576 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:43,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:43,577 INFO L229 MonitoredProcess]: Starting monitored process 55 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-08-31 04:20:43,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-08-31 04:20:43,578 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 04:20:43,579 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 04:20:43,579 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 04:20:43,579 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2021-08-31 04:20:43,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-08-31 04:20:43,595 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 04:20:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:43,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 04:20:43,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:20:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:43,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 04:20:43,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:20:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:44,002 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-08-31 04:20:44,003 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2157 states and 3613 transitions. cyclomatic complexity: 1465 Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-08-31 04:20:44,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:44,454 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2157 states and 3613 transitions. cyclomatic complexity: 1465. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 4282 states and 7173 transitions. Complement of second has 7 states. [2021-08-31 04:20:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-31 04:20:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-08-31 04:20:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2021-08-31 04:20:44,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 370 transitions. Stem has 24 letters. Loop has 38 letters. [2021-08-31 04:20:44,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:44,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 370 transitions. Stem has 62 letters. Loop has 38 letters. [2021-08-31 04:20:44,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:44,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 370 transitions. Stem has 24 letters. Loop has 76 letters. [2021-08-31 04:20:44,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:44,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4282 states and 7173 transitions. [2021-08-31 04:20:44,479 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1969 [2021-08-31 04:20:44,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4282 states to 4227 states and 7095 transitions. [2021-08-31 04:20:44,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2202 [2021-08-31 04:20:44,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2210 [2021-08-31 04:20:44,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4227 states and 7095 transitions. [2021-08-31 04:20:44,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:44,504 INFO L681 BuchiCegarLoop]: Abstraction has 4227 states and 7095 transitions. [2021-08-31 04:20:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4227 states and 7095 transitions. [2021-08-31 04:20:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4227 to 3465. [2021-08-31 04:20:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 3465 states have (on average 1.6810966810966812) internal successors, (5825), 3464 states have internal predecessors, (5825), 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-08-31 04:20:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 5825 transitions. [2021-08-31 04:20:44,587 INFO L704 BuchiCegarLoop]: Abstraction has 3465 states and 5825 transitions. [2021-08-31 04:20:44,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:44,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 04:20:44,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 04:20:44,588 INFO L87 Difference]: Start difference. First operand 3465 states and 5825 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:20:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:45,089 INFO L93 Difference]: Finished difference Result 5316 states and 8926 transitions. [2021-08-31 04:20:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 04:20:45,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5316 states and 8926 transitions. [2021-08-31 04:20:45,116 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 2292 [2021-08-31 04:20:45,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5316 states to 5316 states and 8926 transitions. [2021-08-31 04:20:45,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2664 [2021-08-31 04:20:45,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2664 [2021-08-31 04:20:45,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5316 states and 8926 transitions. [2021-08-31 04:20:45,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:45,143 INFO L681 BuchiCegarLoop]: Abstraction has 5316 states and 8926 transitions. [2021-08-31 04:20:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states and 8926 transitions. [2021-08-31 04:20:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4687. [2021-08-31 04:20:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 4687 states have (on average 1.6867932579475144) internal successors, (7906), 4686 states have internal predecessors, (7906), 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-08-31 04:20:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 7906 transitions. [2021-08-31 04:20:45,248 INFO L704 BuchiCegarLoop]: Abstraction has 4687 states and 7906 transitions. [2021-08-31 04:20:45,248 INFO L587 BuchiCegarLoop]: Abstraction has 4687 states and 7906 transitions. [2021-08-31 04:20:45,248 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 04:20:45,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4687 states and 7906 transitions. [2021-08-31 04:20:45,265 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1893 [2021-08-31 04:20:45,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:45,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:45,266 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:45,266 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:45,267 INFO L791 eck$LassoCheckResult]: Stem: 32478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 32344#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 32345#L408 assume !(1 == ~c_req_up~0); 32276#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 32491#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 32492#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 32396#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 32397#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 32358#L439-1 assume !(0 == ~e_f~0); 32359#L444-1 assume !(0 == ~e_g~0); 32499#L449-1 assume !(0 == ~e_e~0); 32384#L454-1 assume !(0 == ~e_c~0); 32385#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 32299#L464-1 assume !(1 == ~wl_pc~0); 32300#L476 assume !(2 == ~wl_pc~0); 33223#L477 assume !(1 == ~c1_pc~0); 33775#L487 assume !(1 == ~c2_pc~0); 33771#L496 assume !(1 == ~wb_pc~0); 33764#L505 assume !(1 == ~e_c~0); 33763#L514-1 assume !(1 == ~e_e~0); 33762#L519-1 assume !(1 == ~e_f~0); 33761#L524-1 assume !(1 == ~e_g~0); 33760#L529-1 assume !(1 == ~e_c~0); 33758#L534-1 assume !(1 == ~e_wl~0); 32211#L676-1 assume !false; 35444#L546 [2021-08-31 04:20:45,267 INFO L793 eck$LassoCheckResult]: Loop: 35444#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 36415#L381 assume !false; 36412#L299 assume 0 == ~wl_st~0; 36409#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 36405#L325 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 36375#L58 assume 0 == ~wl_pc~0; 36361#L71 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 36358#L321 assume !(0 == ~c1_st~0); 36320#L336 assume !(0 == ~c2_st~0); 36316#L351 assume !(0 == ~wb_st~0); 36311#L366 assume !(0 == ~r_st~0); 36308#L381 assume !false; 36307#L299 assume !(0 == ~wl_st~0); 36306#L303 assume !(0 == ~c1_st~0); 36305#L306 assume !(0 == ~c2_st~0); 36304#L309 assume !(0 == ~wb_st~0); 36302#L312 assume !(0 == ~r_st~0); 36301#L397 start_simulation_~kernel_st~0 := 2; 36147#L552 assume !(1 == ~c_req_up~0); 36148#L552-2 start_simulation_~kernel_st~0 := 3; 36367#L564 assume !(0 == ~e_f~0); 36362#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 36359#L569-1 assume !(0 == ~e_e~0); 36354#L574-1 assume !(0 == ~e_c~0); 36353#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 36349#L584-1 assume 1 == ~wl_pc~0; 36350#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 36294#L597 assume !(1 == ~c1_pc~0); 36438#L607 assume !(1 == ~c2_pc~0); 36433#L616 assume !(1 == ~wb_pc~0); 36431#L625 assume !(1 == ~e_c~0); 36429#L634-1 assume !(1 == ~e_e~0); 36427#L639-1 assume !(1 == ~e_f~0); 36425#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 36423#L649-1 assume !(1 == ~e_c~0); 36421#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 36420#L659-1 assume 0 == ~wl_st~0; 36419#L676-1 assume !false; 35444#L546 [2021-08-31 04:20:45,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:45,267 INFO L82 PathProgramCache]: Analyzing trace with hash -79370950, now seen corresponding path program 1 times [2021-08-31 04:20:45,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:45,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086806316] [2021-08-31 04:20:45,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:45,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:45,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:45,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086806316] [2021-08-31 04:20:45,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086806316] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:45,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:45,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 04:20:45,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385778417] [2021-08-31 04:20:45,288 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:20:45,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:45,289 INFO L82 PathProgramCache]: Analyzing trace with hash -368922987, now seen corresponding path program 1 times [2021-08-31 04:20:45,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:45,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757407771] [2021-08-31 04:20:45,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:45,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:45,293 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:45,298 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:45,579 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:20:45,579 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:20:45,579 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:20:45,579 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:20:45,579 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 04:20:45,580 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:45,580 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:20:45,580 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:20:45,580 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration12_Loop [2021-08-31 04:20:45,580 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:20:45,580 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:20:45,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,816 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:20:45,816 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 04:20:45,816 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:45,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:45,822 INFO L229 MonitoredProcess]: Starting monitored process 56 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-08-31 04:20:45,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-08-31 04:20:45,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:20:45,824 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:45,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-08-31 04:20:45,847 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:45,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:45,847 INFO L229 MonitoredProcess]: Starting monitored process 57 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-08-31 04:20:45,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-08-31 04:20:45,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 04:20:45,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:20:45,900 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 04:20:45,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-08-31 04:20:45,916 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:20:45,916 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:20:45,916 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:20:45,916 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:20:45,916 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 04:20:45,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:45,916 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:20:45,916 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:20:45,916 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration12_Loop [2021-08-31 04:20:45,916 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:20:45,916 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:20:45,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,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-08-31 04:20:45,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:45,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:20:46,131 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:20:46,131 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 04:20:46,131 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:46,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:46,133 INFO L229 MonitoredProcess]: Starting monitored process 58 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-08-31 04:20:46,144 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-08-31 04:20:46,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-08-31 04:20:46,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:20:46,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:20:46,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:20:46,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:20:46,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:20:46,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:20:46,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:20:46,162 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 04:20:46,163 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 04:20:46,163 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 04:20:46,163 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:20:46,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:20:46,164 INFO L229 MonitoredProcess]: Starting monitored process 59 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-08-31 04:20:46,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-08-31 04:20:46,166 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 04:20:46,166 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 04:20:46,166 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 04:20:46,166 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2021-08-31 04:20:46,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:46,181 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 04:20:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:46,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 04:20:46,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:20:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:46,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 04:20:46,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:20:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:46,477 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-08-31 04:20:46,478 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4687 states and 7906 transitions. cyclomatic complexity: 3238 Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-08-31 04:20:46,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-08-31 04:20:46,891 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4687 states and 7906 transitions. cyclomatic complexity: 3238. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 12056 states and 20297 transitions. Complement of second has 7 states. [2021-08-31 04:20:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-31 04:20:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-08-31 04:20:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2021-08-31 04:20:46,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 214 transitions. Stem has 25 letters. Loop has 38 letters. [2021-08-31 04:20:46,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:46,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 214 transitions. Stem has 63 letters. Loop has 38 letters. [2021-08-31 04:20:46,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:46,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 214 transitions. Stem has 25 letters. Loop has 76 letters. [2021-08-31 04:20:46,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:20:46,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12056 states and 20297 transitions. [2021-08-31 04:20:46,982 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 2885 [2021-08-31 04:20:47,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12056 states to 10119 states and 17059 transitions. [2021-08-31 04:20:47,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3672 [2021-08-31 04:20:47,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3688 [2021-08-31 04:20:47,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10119 states and 17059 transitions. [2021-08-31 04:20:47,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:47,032 INFO L681 BuchiCegarLoop]: Abstraction has 10119 states and 17059 transitions. [2021-08-31 04:20:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10119 states and 17059 transitions. [2021-08-31 04:20:47,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10119 to 8392. [2021-08-31 04:20:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8392 states, 8392 states have (on average 1.6898236415633938) internal successors, (14181), 8391 states have internal predecessors, (14181), 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-08-31 04:20:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8392 states to 8392 states and 14181 transitions. [2021-08-31 04:20:47,176 INFO L704 BuchiCegarLoop]: Abstraction has 8392 states and 14181 transitions. [2021-08-31 04:20:47,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:47,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 04:20:47,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 04:20:47,177 INFO L87 Difference]: Start difference. First operand 8392 states and 14181 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:20:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:47,612 INFO L93 Difference]: Finished difference Result 11272 states and 18726 transitions. [2021-08-31 04:20:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 04:20:47,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11272 states and 18726 transitions. [2021-08-31 04:20:47,657 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 3138 [2021-08-31 04:20:47,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11272 states to 11272 states and 18726 transitions. [2021-08-31 04:20:47,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3925 [2021-08-31 04:20:47,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3925 [2021-08-31 04:20:47,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11272 states and 18726 transitions. [2021-08-31 04:20:47,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:47,703 INFO L681 BuchiCegarLoop]: Abstraction has 11272 states and 18726 transitions. [2021-08-31 04:20:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11272 states and 18726 transitions. [2021-08-31 04:20:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11272 to 10394. [2021-08-31 04:20:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10394 states, 10394 states have (on average 1.6680777371560516) internal successors, (17338), 10393 states have internal predecessors, (17338), 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-08-31 04:20:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 17338 transitions. [2021-08-31 04:20:47,893 INFO L704 BuchiCegarLoop]: Abstraction has 10394 states and 17338 transitions. [2021-08-31 04:20:47,893 INFO L587 BuchiCegarLoop]: Abstraction has 10394 states and 17338 transitions. [2021-08-31 04:20:47,894 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-31 04:20:47,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10394 states and 17338 transitions. [2021-08-31 04:20:47,963 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 2993 [2021-08-31 04:20:47,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:47,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:47,966 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:47,966 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:47,966 INFO L791 eck$LassoCheckResult]: Stem: 69094#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 68968#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 68969#L408 assume !(1 == ~c_req_up~0); 69067#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 69068#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 69105#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 69106#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 69095#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 69096#L439-1 assume !(0 == ~e_f~0); 68850#L444-1 assume !(0 == ~e_g~0); 68851#L449-1 assume !(0 == ~e_e~0); 69014#L454-1 assume !(0 == ~e_c~0); 69015#L459-1 assume !(0 == ~e_wl~0); 69139#L464-1 assume !(1 == ~wl_pc~0); 68981#L476 assume !(2 == ~wl_pc~0); 68982#L477 assume !(1 == ~c1_pc~0); 69129#L487 assume !(1 == ~c2_pc~0); 69124#L496 assume !(1 == ~wb_pc~0); 69121#L505 assume !(1 == ~e_c~0); 69120#L514-1 assume !(1 == ~e_e~0); 69119#L519-1 assume !(1 == ~e_f~0); 69118#L524-1 assume !(1 == ~e_g~0); 69112#L529-1 assume !(1 == ~e_c~0); 69113#L534-1 assume !(1 == ~e_wl~0); 73340#L676-1 assume !false; 73341#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 75656#L381 [2021-08-31 04:20:47,967 INFO L793 eck$LassoCheckResult]: Loop: 75656#L381 assume !false; 78367#L299 assume 0 == ~wl_st~0; 78366#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 78364#L325 assume !(0 != eval_~tmp~0); 78365#L321 assume !(0 == ~c1_st~0); 78404#L336 assume !(0 == ~c2_st~0); 78400#L351 assume !(0 == ~wb_st~0); 78372#L366 assume !(0 == ~r_st~0); 75656#L381 [2021-08-31 04:20:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:47,969 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2021-08-31 04:20:47,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:47,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214240624] [2021-08-31 04:20:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:47,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:47,976 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:47,986 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1289372155, now seen corresponding path program 1 times [2021-08-31 04:20:47,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:47,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921613971] [2021-08-31 04:20:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:47,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:47,990 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:47,992 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:47,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:47,994 INFO L82 PathProgramCache]: Analyzing trace with hash 370417651, now seen corresponding path program 1 times [2021-08-31 04:20:47,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:47,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6963815] [2021-08-31 04:20:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:47,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:48,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:48,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6963815] [2021-08-31 04:20:48,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6963815] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:48,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:48,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:48,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655651450] [2021-08-31 04:20:48,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:20:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:20:48,059 INFO L87 Difference]: Start difference. First operand 10394 states and 17338 transitions. cyclomatic complexity: 6999 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-08-31 04:20:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:48,335 INFO L93 Difference]: Finished difference Result 16129 states and 26683 transitions. [2021-08-31 04:20:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:20:48,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16129 states and 26683 transitions. [2021-08-31 04:20:48,444 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 4724 [2021-08-31 04:20:48,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16129 states to 16129 states and 26683 transitions. [2021-08-31 04:20:48,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5804 [2021-08-31 04:20:48,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5804 [2021-08-31 04:20:48,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16129 states and 26683 transitions. [2021-08-31 04:20:48,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:48,504 INFO L681 BuchiCegarLoop]: Abstraction has 16129 states and 26683 transitions. [2021-08-31 04:20:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16129 states and 26683 transitions. [2021-08-31 04:20:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16129 to 16129. [2021-08-31 04:20:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16129 states, 16129 states have (on average 1.6543493086986174) internal successors, (26683), 16128 states have internal predecessors, (26683), 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-08-31 04:20:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16129 states to 16129 states and 26683 transitions. [2021-08-31 04:20:48,811 INFO L704 BuchiCegarLoop]: Abstraction has 16129 states and 26683 transitions. [2021-08-31 04:20:48,811 INFO L587 BuchiCegarLoop]: Abstraction has 16129 states and 26683 transitions. [2021-08-31 04:20:48,811 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-31 04:20:48,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16129 states and 26683 transitions. [2021-08-31 04:20:48,855 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 4724 [2021-08-31 04:20:48,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:48,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:48,856 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:48,856 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:48,856 INFO L791 eck$LassoCheckResult]: Stem: 95636#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 95497#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 95498#L408 assume !(1 == ~c_req_up~0); 95429#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 95644#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 95645#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 95553#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 95554#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 95510#L439-1 assume !(0 == ~e_f~0); 95511#L444-1 assume !(0 == ~e_g~0); 95621#L449-1 assume !(0 == ~e_e~0); 95622#L454-1 assume !(0 == ~e_c~0); 95669#L459-1 assume !(0 == ~e_wl~0); 95668#L464-1 assume !(1 == ~wl_pc~0); 95665#L476 assume !(2 == ~wl_pc~0); 95664#L477 assume !(1 == ~c1_pc~0); 95662#L487 assume !(1 == ~c2_pc~0); 95660#L496 assume !(1 == ~wb_pc~0); 95658#L505 assume !(1 == ~e_c~0); 95657#L514-1 assume !(1 == ~e_e~0); 95656#L519-1 assume !(1 == ~e_f~0); 95655#L524-1 assume !(1 == ~e_g~0); 95649#L529-1 assume !(1 == ~e_c~0); 95650#L534-1 assume !(1 == ~e_wl~0); 102087#L676-1 assume !false; 102088#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 105724#L381 [2021-08-31 04:20:48,856 INFO L793 eck$LassoCheckResult]: Loop: 105724#L381 assume !false; 107171#L299 assume 0 == ~wl_st~0; 107168#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 107161#L325 assume !(0 != eval_~tmp~0); 107162#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 107194#L340 assume !(0 != eval_~tmp___0~0); 107192#L336 assume !(0 == ~c2_st~0); 107180#L351 assume !(0 == ~wb_st~0); 107174#L366 assume !(0 == ~r_st~0); 105724#L381 [2021-08-31 04:20:48,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2021-08-31 04:20:48,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:48,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182916729] [2021-08-31 04:20:48,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:48,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:48,870 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:48,877 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 1 times [2021-08-31 04:20:48,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:48,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009313318] [2021-08-31 04:20:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:48,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:48,882 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:48,884 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:48,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1452726936, now seen corresponding path program 1 times [2021-08-31 04:20:48,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:48,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747961938] [2021-08-31 04:20:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:48,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:48,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:48,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747961938] [2021-08-31 04:20:48,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747961938] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:48,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:48,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:48,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978457020] [2021-08-31 04:20:48,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:48,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:20:48,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:20:48,940 INFO L87 Difference]: Start difference. First operand 16129 states and 26683 transitions. cyclomatic complexity: 10609 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-08-31 04:20:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:49,264 INFO L93 Difference]: Finished difference Result 24580 states and 40120 transitions. [2021-08-31 04:20:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:20:49,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24580 states and 40120 transitions. [2021-08-31 04:20:49,418 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 7412 [2021-08-31 04:20:49,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24580 states to 24580 states and 40120 transitions. [2021-08-31 04:20:49,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8934 [2021-08-31 04:20:49,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8934 [2021-08-31 04:20:49,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24580 states and 40120 transitions. [2021-08-31 04:20:49,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:49,512 INFO L681 BuchiCegarLoop]: Abstraction has 24580 states and 40120 transitions. [2021-08-31 04:20:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24580 states and 40120 transitions. [2021-08-31 04:20:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24580 to 24580. [2021-08-31 04:20:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24580 states, 24580 states have (on average 1.6322213181448333) internal successors, (40120), 24579 states have internal predecessors, (40120), 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-08-31 04:20:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24580 states to 24580 states and 40120 transitions. [2021-08-31 04:20:49,916 INFO L704 BuchiCegarLoop]: Abstraction has 24580 states and 40120 transitions. [2021-08-31 04:20:49,916 INFO L587 BuchiCegarLoop]: Abstraction has 24580 states and 40120 transitions. [2021-08-31 04:20:49,916 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-31 04:20:49,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24580 states and 40120 transitions. [2021-08-31 04:20:49,983 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 7412 [2021-08-31 04:20:49,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:49,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:49,984 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:49,984 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:49,984 INFO L791 eck$LassoCheckResult]: Stem: 136378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 136219#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 136220#L408 assume !(1 == ~c_req_up~0); 136344#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 136345#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 136388#L424-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 136389#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 136379#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 136380#L439-1 assume !(0 == ~e_f~0); 136098#L444-1 assume !(0 == ~e_g~0); 136099#L449-1 assume !(0 == ~e_e~0); 136272#L454-1 assume !(0 == ~e_c~0); 136273#L459-1 assume !(0 == ~e_wl~0); 136443#L464-1 assume !(1 == ~wl_pc~0); 136442#L476 assume !(2 == ~wl_pc~0); 136435#L477 assume !(1 == ~c1_pc~0); 136434#L487 assume !(1 == ~c2_pc~0); 136423#L496 assume !(1 == ~wb_pc~0); 136422#L505 assume !(1 == ~e_c~0); 136416#L514-1 assume !(1 == ~e_e~0); 136414#L519-1 assume !(1 == ~e_f~0); 136415#L524-1 assume !(1 == ~e_g~0); 139323#L529-1 assume !(1 == ~e_c~0); 139313#L534-1 assume !(1 == ~e_wl~0); 139304#L676-1 assume !false; 139305#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 148347#L381 [2021-08-31 04:20:49,984 INFO L793 eck$LassoCheckResult]: Loop: 148347#L381 assume !false; 148345#L299 assume 0 == ~wl_st~0; 148344#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 148343#L325 assume !(0 != eval_~tmp~0); 148342#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 148335#L340 assume !(0 != eval_~tmp___0~0); 148341#L336 assume !(0 == ~c2_st~0); 148413#L351 assume !(0 == ~wb_st~0); 148353#L366 assume !(0 == ~r_st~0); 148347#L381 [2021-08-31 04:20:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2021-08-31 04:20:49,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:49,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225174519] [2021-08-31 04:20:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:49,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:50,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:50,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225174519] [2021-08-31 04:20:50,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225174519] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:50,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:50,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:50,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539032280] [2021-08-31 04:20:50,003 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:20:50,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:50,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 2 times [2021-08-31 04:20:50,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:50,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69309869] [2021-08-31 04:20:50,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:50,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:50,006 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:50,009 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:50,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:50,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:20:50,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:20:50,046 INFO L87 Difference]: Start difference. First operand 24580 states and 40120 transitions. cyclomatic complexity: 15595 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:20:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:50,261 INFO L93 Difference]: Finished difference Result 24508 states and 39999 transitions. [2021-08-31 04:20:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:20:50,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24508 states and 39999 transitions. [2021-08-31 04:20:50,338 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 7412 [2021-08-31 04:20:50,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24508 states to 24508 states and 39999 transitions. [2021-08-31 04:20:50,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8866 [2021-08-31 04:20:50,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8866 [2021-08-31 04:20:50,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24508 states and 39999 transitions. [2021-08-31 04:20:50,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:50,538 INFO L681 BuchiCegarLoop]: Abstraction has 24508 states and 39999 transitions. [2021-08-31 04:20:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24508 states and 39999 transitions. [2021-08-31 04:20:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24508 to 24508. [2021-08-31 04:20:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24508 states, 24508 states have (on average 1.6320793210380284) internal successors, (39999), 24507 states have internal predecessors, (39999), 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-08-31 04:20:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24508 states to 24508 states and 39999 transitions. [2021-08-31 04:20:50,972 INFO L704 BuchiCegarLoop]: Abstraction has 24508 states and 39999 transitions. [2021-08-31 04:20:50,972 INFO L587 BuchiCegarLoop]: Abstraction has 24508 states and 39999 transitions. [2021-08-31 04:20:50,972 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-31 04:20:50,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24508 states and 39999 transitions. [2021-08-31 04:20:51,033 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 7412 [2021-08-31 04:20:51,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:51,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:51,034 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:51,034 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:51,035 INFO L791 eck$LassoCheckResult]: Stem: 185451#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 185309#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 185310#L408 assume !(1 == ~c_req_up~0); 185423#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 185424#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 185459#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 185460#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 185452#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 185453#L439-1 assume !(0 == ~e_f~0); 185192#L444-1 assume !(0 == ~e_g~0); 185193#L449-1 assume !(0 == ~e_e~0); 185358#L454-1 assume !(0 == ~e_c~0); 185359#L459-1 assume !(0 == ~e_wl~0); 185501#L464-1 assume !(1 == ~wl_pc~0); 185321#L476 assume !(2 == ~wl_pc~0); 185322#L477 assume !(1 == ~c1_pc~0); 185491#L487 assume !(1 == ~c2_pc~0); 185486#L496 assume !(1 == ~wb_pc~0); 185483#L505 assume !(1 == ~e_c~0); 185482#L514-1 assume !(1 == ~e_e~0); 185481#L519-1 assume !(1 == ~e_f~0); 185480#L524-1 assume !(1 == ~e_g~0); 185474#L529-1 assume !(1 == ~e_c~0); 185176#L534-1 assume !(1 == ~e_wl~0); 185177#L676-1 assume !false; 191342#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 191343#L381 [2021-08-31 04:20:51,035 INFO L793 eck$LassoCheckResult]: Loop: 191343#L381 assume !false; 207749#L299 assume 0 == ~wl_st~0; 207747#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 207745#L325 assume !(0 != eval_~tmp~0); 207640#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 207638#L340 assume !(0 != eval_~tmp___0~0); 207637#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 207625#L355 assume !(0 != eval_~tmp___1~0); 207636#L351 assume !(0 == ~wb_st~0); 207754#L366 assume !(0 == ~r_st~0); 191343#L381 [2021-08-31 04:20:51,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:51,035 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2021-08-31 04:20:51,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:51,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394654684] [2021-08-31 04:20:51,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:51,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:51,041 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:51,050 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:51,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:51,050 INFO L82 PathProgramCache]: Analyzing trace with hash 560500646, now seen corresponding path program 1 times [2021-08-31 04:20:51,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:51,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857834125] [2021-08-31 04:20:51,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:51,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:51,053 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:51,055 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:51,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2086482018, now seen corresponding path program 1 times [2021-08-31 04:20:51,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:51,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415732210] [2021-08-31 04:20:51,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:51,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:20:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:20:51,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:20:51,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415732210] [2021-08-31 04:20:51,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415732210] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:20:51,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:20:51,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:20:51,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024819061] [2021-08-31 04:20:51,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:20:51,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:20:51,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:20:51,133 INFO L87 Difference]: Start difference. First operand 24508 states and 39999 transitions. cyclomatic complexity: 15546 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-08-31 04:20:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:20:51,447 INFO L93 Difference]: Finished difference Result 40806 states and 65442 transitions. [2021-08-31 04:20:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:20:51,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40806 states and 65442 transitions. [2021-08-31 04:20:51,675 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 12598 [2021-08-31 04:20:51,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40806 states to 40806 states and 65442 transitions. [2021-08-31 04:20:51,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14826 [2021-08-31 04:20:51,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14826 [2021-08-31 04:20:51,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40806 states and 65442 transitions. [2021-08-31 04:20:51,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 04:20:51,797 INFO L681 BuchiCegarLoop]: Abstraction has 40806 states and 65442 transitions. [2021-08-31 04:20:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40806 states and 65442 transitions. [2021-08-31 04:20:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40806 to 40806. [2021-08-31 04:20:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40806 states, 40806 states have (on average 1.6037347448904573) internal successors, (65442), 40805 states have internal predecessors, (65442), 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-08-31 04:20:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40806 states to 40806 states and 65442 transitions. [2021-08-31 04:20:52,393 INFO L704 BuchiCegarLoop]: Abstraction has 40806 states and 65442 transitions. [2021-08-31 04:20:52,393 INFO L587 BuchiCegarLoop]: Abstraction has 40806 states and 65442 transitions. [2021-08-31 04:20:52,393 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-31 04:20:52,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40806 states and 65442 transitions. [2021-08-31 04:20:52,670 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 12598 [2021-08-31 04:20:52,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:20:52,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:20:52,685 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:52,685 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:20:52,686 INFO L791 eck$LassoCheckResult]: Stem: 250807#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 250632#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 250633#L408 assume !(1 == ~c_req_up~0); 250562#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 250820#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 250821#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 250695#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 250696#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 250646#L439-1 assume !(0 == ~e_f~0); 250647#L444-1 assume !(0 == ~e_g~0); 250785#L449-1 assume !(0 == ~e_e~0); 250786#L454-1 assume !(0 == ~e_c~0); 250855#L459-1 assume !(0 == ~e_wl~0); 250854#L464-1 assume !(1 == ~wl_pc~0); 250851#L476 assume !(2 == ~wl_pc~0); 250850#L477 assume !(1 == ~c1_pc~0); 250848#L487 assume !(1 == ~c2_pc~0); 250846#L496 assume !(1 == ~wb_pc~0); 250844#L505 assume !(1 == ~e_c~0); 250843#L514-1 assume !(1 == ~e_e~0); 250842#L519-1 assume !(1 == ~e_f~0); 250841#L524-1 assume !(1 == ~e_g~0); 250835#L529-1 assume !(1 == ~e_c~0); 250836#L534-1 assume !(1 == ~e_wl~0); 264160#L676-1 assume !false; 264161#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 281256#L381 [2021-08-31 04:20:52,686 INFO L793 eck$LassoCheckResult]: Loop: 281256#L381 assume !false; 285885#L299 assume 0 == ~wl_st~0; 285884#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 285883#L325 assume !(0 != eval_~tmp~0); 285574#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 285572#L340 assume !(0 != eval_~tmp___0~0); 285571#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 285567#L355 assume !(0 != eval_~tmp___1~0); 285565#L351 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 285543#L370 assume !(0 != eval_~tmp___2~0); 285564#L366 assume !(0 == ~r_st~0); 281256#L381 [2021-08-31 04:20:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2021-08-31 04:20:52,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:52,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524533124] [2021-08-31 04:20:52,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:52,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:52,697 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:52,707 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:52,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:52,713 INFO L82 PathProgramCache]: Analyzing trace with hash 195616437, now seen corresponding path program 1 times [2021-08-31 04:20:52,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:52,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211659192] [2021-08-31 04:20:52,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:52,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:52,716 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:52,719 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:20:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash -256467523, now seen corresponding path program 1 times [2021-08-31 04:20:52,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:20:52,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227221962] [2021-08-31 04:20:52,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:20:52,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:20:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:52,727 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:20:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:20:52,736 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:20:53,671 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 04:20:53,674 INFO L158 Benchmark]: Toolchain (without parser) took 22533.90ms. Allocated memory was 65.0MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 44.9MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 575.2MB. Max. memory is 16.1GB. [2021-08-31 04:20:53,675 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 65.0MB. Free memory was 46.9MB in the beginning and 46.9MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 04:20:53,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.48ms. Allocated memory is still 65.0MB. Free memory was 44.7MB in the beginning and 44.4MB in the end (delta: 239.8kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-31 04:20:53,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.74ms. Allocated memory is still 65.0MB. Free memory was 44.4MB in the beginning and 42.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 04:20:53,675 INFO L158 Benchmark]: Boogie Preprocessor took 25.06ms. Allocated memory is still 65.0MB. Free memory was 42.0MB in the beginning and 40.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 04:20:53,676 INFO L158 Benchmark]: RCFGBuilder took 367.09ms. Allocated memory is still 65.0MB. Free memory was 39.9MB in the beginning and 43.1MB in the end (delta: -3.2MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2021-08-31 04:20:53,676 INFO L158 Benchmark]: BuchiAutomizer took 21809.12ms. Allocated memory was 65.0MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 43.1MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 573.5MB. Max. memory is 16.1GB. [2021-08-31 04:20:53,677 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.30ms. Allocated memory is still 65.0MB. Free memory was 46.9MB in the beginning and 46.9MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.48ms. Allocated memory is still 65.0MB. Free memory was 44.7MB in the beginning and 44.4MB in the end (delta: 239.8kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.74ms. Allocated memory is still 65.0MB. Free memory was 44.4MB in the beginning and 42.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.06ms. Allocated memory is still 65.0MB. Free memory was 42.0MB in the beginning and 40.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 367.09ms. Allocated memory is still 65.0MB. Free memory was 39.9MB in the beginning and 43.1MB in the end (delta: -3.2MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 21809.12ms. Allocated memory was 65.0MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 43.1MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 573.5MB. 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 21 terminating modules (16 trivial, 5 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * e_c + 3 and consists of 4 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. 16 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 40806 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 04:20:53,701 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...