./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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/toy.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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 15:31:50,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 15:31:50,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 15:31:50,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 15:31:50,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 15:31:50,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 15:31:50,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 15:31:50,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 15:31:50,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 15:31:50,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 15:31:50,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 15:31:50,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 15:31:50,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 15:31:50,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 15:31:50,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 15:31:50,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 15:31:50,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 15:31:50,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 15:31:50,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 15:31:50,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 15:31:50,135 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 15:31:50,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 15:31:50,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 15:31:50,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 15:31:50,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 15:31:50,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 15:31:50,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 15:31:50,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 15:31:50,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 15:31:50,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 15:31:50,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 15:31:50,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 15:31:50,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 15:31:50,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 15:31:50,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 15:31:50,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 15:31:50,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 15:31:50,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 15:31:50,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 15:31:50,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 15:31:50,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 15:31:50,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 15:31:50,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 15:31:50,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 15:31:50,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 15:31:50,188 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 15:31:50,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 15:31:50,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 15:31:50,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 15:31:50,191 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 15:31:50,191 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 15:31:50,191 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 15:31:50,192 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 15:31:50,193 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 15:31:50,193 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 15:31:50,193 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 15:31:50,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 15:31:50,193 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 15:31:50,194 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 15:31:50,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 15:31:50,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 15:31:50,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 15:31:50,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 15:31:50,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 15:31:50,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 15:31:50,195 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 15:31:50,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 15:31:50,196 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 15:31:50,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 15:31:50,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 15:31:50,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 15:31:50,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 15:31:50,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 15:31:50,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 15:31:50,198 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 15:31:50,199 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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2022-07-23 15:31:50,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 15:31:50,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 15:31:50,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 15:31:50,461 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 15:31:50,461 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 15:31:50,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2022-07-23 15:31:50,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd8bd106/a5985cdfbaaf408292c3fddc8a11490e/FLAG1def25d79 [2022-07-23 15:31:50,939 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 15:31:50,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2022-07-23 15:31:50,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd8bd106/a5985cdfbaaf408292c3fddc8a11490e/FLAG1def25d79 [2022-07-23 15:31:51,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efd8bd106/a5985cdfbaaf408292c3fddc8a11490e [2022-07-23 15:31:51,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 15:31:51,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 15:31:51,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 15:31:51,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 15:31:51,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 15:31:51,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6643c7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51, skipping insertion in model container [2022-07-23 15:31:51,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 15:31:51,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 15:31:51,539 WARN L230 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/toy.cil.c[697,710] [2022-07-23 15:31:51,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:31:51,601 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 15:31:51,609 WARN L230 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/toy.cil.c[697,710] [2022-07-23 15:31:51,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:31:51,650 INFO L208 MainTranslator]: Completed translation [2022-07-23 15:31:51,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51 WrapperNode [2022-07-23 15:31:51,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 15:31:51,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 15:31:51,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 15:31:51,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 15:31:51,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,689 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 357 [2022-07-23 15:31:51,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 15:31:51,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 15:31:51,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 15:31:51,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 15:31:51,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 15:31:51,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 15:31:51,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 15:31:51,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 15:31:51,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51" (1/1) ... [2022-07-23 15:31:51,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:51,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:51,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:51,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 15:31:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 15:31:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 15:31:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 15:31:51,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 15:31:51,843 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 15:31:51,844 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 15:31:52,177 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 15:31:52,195 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 15:31:52,207 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-23 15:31:52,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:31:52 BoogieIcfgContainer [2022-07-23 15:31:52,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 15:31:52,210 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 15:31:52,211 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 15:31:52,215 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 15:31:52,215 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:31:52,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 03:31:51" (1/3) ... [2022-07-23 15:31:52,217 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@624c6e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:31:52, skipping insertion in model container [2022-07-23 15:31:52,217 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:31:52,217 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:31:51" (2/3) ... [2022-07-23 15:31:52,218 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@624c6e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:31:52, skipping insertion in model container [2022-07-23 15:31:52,218 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:31:52,218 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:31:52" (3/3) ... [2022-07-23 15:31:52,219 INFO L354 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2022-07-23 15:31:52,288 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 15:31:52,288 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 15:31:52,288 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 15:31:52,288 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 15:31:52,288 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 15:31:52,288 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 15:31:52,288 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 15:31:52,288 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 15:31:52,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:52,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2022-07-23 15:31:52,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:52,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:52,322 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:52,322 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:52,322 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 15:31:52,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:52,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2022-07-23 15:31:52,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:52,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:52,335 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:52,339 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:52,347 INFO L752 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 36#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 103#L408true assume !(1 == ~c_req_up~0); 88#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 126#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 124#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 62#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 119#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 41#L439-1true assume !(0 == ~e_f~0); 5#L444-1true assume !(0 == ~e_g~0); 99#L449-1true assume !(0 == ~e_e~0); 55#L454-1true assume !(0 == ~e_c~0); 108#L459-1true assume !(0 == ~e_wl~0); 23#L464-1true assume !(1 == ~wl_pc~0); 40#L476true assume !(2 == ~wl_pc~0); 22#L477true assume !(1 == ~c1_pc~0); 16#L487true assume !(1 == ~c2_pc~0); 90#L496true assume !(1 == ~wb_pc~0); 27#L505true assume !(1 == ~e_c~0); 33#L514-1true assume !(1 == ~e_e~0); 132#L519-1true assume !(1 == ~e_f~0); 37#L524-1true assume !(1 == ~e_g~0); 130#L529-1true assume !(1 == ~e_c~0); 2#L534-1true assume !(1 == ~e_wl~0); 4#L676-1true [2022-07-23 15:31:52,349 INFO L754 eck$LassoCheckResult]: Loop: 4#L676-1true assume !false; 32#L546true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 73#L381true assume !true; 125#L397true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 39#L552true assume !(1 == ~c_req_up~0); 61#L552-2true start_simulation_~kernel_st~0#1 := 3; 12#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 15#L564-2true assume !(0 == ~e_g~0); 6#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 129#L574-1true assume 0 == ~e_c~0;~e_c~0 := 1; 10#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 97#L584-1true assume 1 == ~wl_pc~0; 48#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 111#L597true assume !(1 == ~c1_pc~0); 25#L607true assume !(1 == ~c2_pc~0); 101#L616true assume !(1 == ~wb_pc~0); 121#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 60#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 54#L639-1true assume !(1 == ~e_f~0); 114#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 80#L649-1true assume 1 == ~e_c~0;~e_c~0 := 2; 38#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 20#L659-1true assume 0 == ~wl_st~0; 4#L676-1true [2022-07-23 15:31:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2022-07-23 15:31:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:52,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961381740] [2022-07-23 15:31:52,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:52,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:52,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961381740] [2022-07-23 15:31:52,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961381740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:52,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:52,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518838552] [2022-07-23 15:31:52,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:52,554 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:31:52,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash 672584946, now seen corresponding path program 1 times [2022-07-23 15:31:52,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:52,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350410184] [2022-07-23 15:31:52,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:52,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:52,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:52,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350410184] [2022-07-23 15:31:52,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350410184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:52,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:52,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 15:31:52,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838195860] [2022-07-23 15:31:52,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:52,570 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:31:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 15:31:52,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 15:31:52,595 INFO L87 Difference]: Start difference. First operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 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) [2022-07-23 15:31:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:52,610 INFO L93 Difference]: Finished difference Result 130 states and 224 transitions. [2022-07-23 15:31:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 15:31:52,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 224 transitions. [2022-07-23 15:31:52,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-07-23 15:31:52,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 219 transitions. [2022-07-23 15:31:52,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-07-23 15:31:52,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-07-23 15:31:52,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 219 transitions. [2022-07-23 15:31:52,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:31:52,632 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2022-07-23 15:31:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 219 transitions. [2022-07-23 15:31:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-23 15:31:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.752) internal successors, (219), 124 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 219 transitions. [2022-07-23 15:31:52,659 INFO L392 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2022-07-23 15:31:52,659 INFO L374 stractBuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2022-07-23 15:31:52,659 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 15:31:52,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 219 transitions. [2022-07-23 15:31:52,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-07-23 15:31:52,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:52,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:52,662 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:52,662 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:52,663 INFO L752 eck$LassoCheckResult]: Stem: 391#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 338#L408 assume !(1 == ~c_req_up~0); 302#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 384#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 393#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 366#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 367#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 346#L439-1 assume !(0 == ~e_f~0); 273#L444-1 assume !(0 == ~e_g~0); 274#L449-1 assume !(0 == ~e_e~0); 362#L454-1 assume !(0 == ~e_c~0); 363#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); 295#L487 assume !(1 == ~c2_pc~0); 297#L496 assume !(1 == ~wb_pc~0); 321#L505 assume !(1 == ~e_c~0); 322#L514-1 assume !(1 == ~e_e~0); 333#L519-1 assume !(1 == ~e_f~0); 340#L524-1 assume !(1 == ~e_g~0); 341#L529-1 assume !(1 == ~e_c~0); 270#L534-1 assume !(1 == ~e_wl~0); 271#L676-1 [2022-07-23 15:31:52,663 INFO L754 eck$LassoCheckResult]: Loop: 271#L676-1 assume !false; 272#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 294#L381 assume !false; 334#L299 assume !(0 == ~wl_st~0); 335#L303 assume !(0 == ~c1_st~0); 392#L306 assume !(0 == ~c2_st~0); 386#L309 assume !(0 == ~wb_st~0); 387#L312 assume !(0 == ~r_st~0); 394#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 342#L552 assume !(1 == ~c_req_up~0); 343#L552-2 start_simulation_~kernel_st~0#1 := 3; 290#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 291#L564-2 assume !(0 == ~e_g~0); 275#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 276#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 285#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 286#L584-1 assume 1 == ~wl_pc~0; 355#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 352#L597 assume !(1 == ~c1_pc~0); 315#L607 assume !(1 == ~c2_pc~0); 316#L616 assume !(1 == ~wb_pc~0); 375#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 365#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 360#L639-1 assume !(1 == ~e_f~0); 361#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 376#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 339#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 303#L659-1 assume 0 == ~wl_st~0; 271#L676-1 [2022-07-23 15:31:52,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2022-07-23 15:31:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:52,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984903563] [2022-07-23 15:31:52,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:52,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984903563] [2022-07-23 15:31:52,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984903563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:52,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:52,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:52,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969809215] [2022-07-23 15:31:52,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:52,711 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:31:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 1 times [2022-07-23 15:31:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:52,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800421209] [2022-07-23 15:31:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:52,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800421209] [2022-07-23 15:31:52,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800421209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:52,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:52,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:52,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332444634] [2022-07-23 15:31:52,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:52,764 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:31:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:52,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:31:52,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:31:52,767 INFO L87 Difference]: Start difference. First operand 125 states and 219 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) [2022-07-23 15:31:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:52,798 INFO L93 Difference]: Finished difference Result 125 states and 218 transitions. [2022-07-23 15:31:52,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:31:52,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 218 transitions. [2022-07-23 15:31:52,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-07-23 15:31:52,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 218 transitions. [2022-07-23 15:31:52,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-07-23 15:31:52,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-07-23 15:31:52,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 218 transitions. [2022-07-23 15:31:52,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:31:52,810 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 218 transitions. [2022-07-23 15:31:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 218 transitions. [2022-07-23 15:31:52,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-23 15:31:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.744) internal successors, (218), 124 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 218 transitions. [2022-07-23 15:31:52,817 INFO L392 hiAutomatonCegarLoop]: Abstraction has 125 states and 218 transitions. [2022-07-23 15:31:52,817 INFO L374 stractBuchiCegarLoop]: Abstraction has 125 states and 218 transitions. [2022-07-23 15:31:52,817 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 15:31:52,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 218 transitions. [2022-07-23 15:31:52,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-07-23 15:31:52,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:52,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:52,827 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:52,827 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:52,828 INFO L752 eck$LassoCheckResult]: Stem: 648#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 594#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 595#L408 assume !(1 == ~c_req_up~0); 559#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 641#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 650#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 623#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 624#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 603#L439-1 assume !(0 == ~e_f~0); 530#L444-1 assume !(0 == ~e_g~0); 531#L449-1 assume !(0 == ~e_e~0); 619#L454-1 assume !(0 == ~e_c~0); 620#L459-1 assume !(0 == ~e_wl~0); 566#L464-1 assume !(1 == ~wl_pc~0); 567#L476 assume !(2 == ~wl_pc~0); 564#L477 assume !(1 == ~c1_pc~0); 552#L487 assume !(1 == ~c2_pc~0); 554#L496 assume !(1 == ~wb_pc~0); 578#L505 assume !(1 == ~e_c~0); 579#L514-1 assume !(1 == ~e_e~0); 590#L519-1 assume !(1 == ~e_f~0); 597#L524-1 assume !(1 == ~e_g~0); 598#L529-1 assume !(1 == ~e_c~0); 527#L534-1 assume !(1 == ~e_wl~0); 528#L676-1 [2022-07-23 15:31:52,828 INFO L754 eck$LassoCheckResult]: Loop: 528#L676-1 assume !false; 529#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 551#L381 assume !false; 591#L299 assume !(0 == ~wl_st~0); 592#L303 assume !(0 == ~c1_st~0); 649#L306 assume !(0 == ~c2_st~0); 643#L309 assume !(0 == ~wb_st~0); 644#L312 assume !(0 == ~r_st~0); 651#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 599#L552 assume !(1 == ~c_req_up~0); 600#L552-2 start_simulation_~kernel_st~0#1 := 3; 547#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 548#L564-2 assume !(0 == ~e_g~0); 532#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 533#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 542#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 543#L584-1 assume 1 == ~wl_pc~0; 612#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 609#L597 assume !(1 == ~c1_pc~0); 572#L607 assume !(1 == ~c2_pc~0); 573#L616 assume !(1 == ~wb_pc~0); 632#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 622#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 617#L639-1 assume !(1 == ~e_f~0); 618#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 634#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 596#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 560#L659-1 assume 0 == ~wl_st~0; 528#L676-1 [2022-07-23 15:31:52,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:52,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2022-07-23 15:31:52,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:52,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919092803] [2022-07-23 15:31:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:52,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:52,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:52,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919092803] [2022-07-23 15:31:52,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919092803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:52,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:52,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:52,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464283315] [2022-07-23 15:31:52,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:52,874 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:31:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 2 times [2022-07-23 15:31:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:52,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816024629] [2022-07-23 15:31:52,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:52,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:52,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816024629] [2022-07-23 15:31:52,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816024629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:52,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:52,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:52,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273723918] [2022-07-23 15:31:52,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:52,901 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:31:52,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:52,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:31:52,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:31:52,902 INFO L87 Difference]: Start difference. First operand 125 states and 218 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) [2022-07-23 15:31:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:52,915 INFO L93 Difference]: Finished difference Result 125 states and 217 transitions. [2022-07-23 15:31:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:31:52,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 217 transitions. [2022-07-23 15:31:52,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-07-23 15:31:52,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 217 transitions. [2022-07-23 15:31:52,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-07-23 15:31:52,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-07-23 15:31:52,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 217 transitions. [2022-07-23 15:31:52,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:31:52,920 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 217 transitions. [2022-07-23 15:31:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 217 transitions. [2022-07-23 15:31:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-23 15:31:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.736) internal successors, (217), 124 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 217 transitions. [2022-07-23 15:31:52,926 INFO L392 hiAutomatonCegarLoop]: Abstraction has 125 states and 217 transitions. [2022-07-23 15:31:52,926 INFO L374 stractBuchiCegarLoop]: Abstraction has 125 states and 217 transitions. [2022-07-23 15:31:52,926 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 15:31:52,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 217 transitions. [2022-07-23 15:31:52,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-07-23 15:31:52,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:52,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:52,928 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:52,928 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:52,928 INFO L752 eck$LassoCheckResult]: Stem: 905#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 851#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 852#L408 assume !(1 == ~c_req_up~0); 816#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 898#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 907#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 880#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 881#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 860#L439-1 assume !(0 == ~e_f~0); 787#L444-1 assume !(0 == ~e_g~0); 788#L449-1 assume !(0 == ~e_e~0); 876#L454-1 assume !(0 == ~e_c~0); 877#L459-1 assume !(0 == ~e_wl~0); 823#L464-1 assume !(1 == ~wl_pc~0); 824#L476 assume !(2 == ~wl_pc~0); 821#L477 assume !(1 == ~c1_pc~0); 809#L487 assume !(1 == ~c2_pc~0); 811#L496 assume !(1 == ~wb_pc~0); 835#L505 assume !(1 == ~e_c~0); 836#L514-1 assume !(1 == ~e_e~0); 847#L519-1 assume !(1 == ~e_f~0); 854#L524-1 assume !(1 == ~e_g~0); 855#L529-1 assume !(1 == ~e_c~0); 784#L534-1 assume !(1 == ~e_wl~0); 785#L676-1 [2022-07-23 15:31:52,929 INFO L754 eck$LassoCheckResult]: Loop: 785#L676-1 assume !false; 786#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 808#L381 assume !false; 848#L299 assume !(0 == ~wl_st~0); 849#L303 assume !(0 == ~c1_st~0); 906#L306 assume !(0 == ~c2_st~0); 900#L309 assume !(0 == ~wb_st~0); 901#L312 assume !(0 == ~r_st~0); 908#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 856#L552 assume !(1 == ~c_req_up~0); 857#L552-2 start_simulation_~kernel_st~0#1 := 3; 804#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 805#L564-2 assume !(0 == ~e_g~0); 789#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 790#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 799#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 800#L584-1 assume !(1 == ~wl_pc~0); 864#L596 assume !(2 == ~wl_pc~0); 866#L597 assume !(1 == ~c1_pc~0); 829#L607 assume !(1 == ~c2_pc~0); 830#L616 assume !(1 == ~wb_pc~0); 889#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 879#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 874#L639-1 assume !(1 == ~e_f~0); 875#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 891#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 853#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 817#L659-1 assume 0 == ~wl_st~0; 785#L676-1 [2022-07-23 15:31:52,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2022-07-23 15:31:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:52,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280742975] [2022-07-23 15:31:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:52,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:52,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280742975] [2022-07-23 15:31:52,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280742975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:52,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:52,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:52,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199644760] [2022-07-23 15:31:52,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:52,955 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:31:52,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:52,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1622720252, now seen corresponding path program 1 times [2022-07-23 15:31:52,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:52,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891521982] [2022-07-23 15:31:52,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:52,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:52,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:52,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891521982] [2022-07-23 15:31:52,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891521982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:52,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:52,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:52,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16037360] [2022-07-23 15:31:52,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:52,979 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:31:52,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:31:52,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:31:52,980 INFO L87 Difference]: Start difference. First operand 125 states and 217 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) [2022-07-23 15:31:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:52,991 INFO L93 Difference]: Finished difference Result 125 states and 216 transitions. [2022-07-23 15:31:52,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:31:52,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 216 transitions. [2022-07-23 15:31:52,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-07-23 15:31:53,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 216 transitions. [2022-07-23 15:31:53,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-07-23 15:31:53,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-07-23 15:31:53,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 216 transitions. [2022-07-23 15:31:53,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:31:53,001 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 216 transitions. [2022-07-23 15:31:53,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 216 transitions. [2022-07-23 15:31:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-23 15:31:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.728) internal successors, (216), 124 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 216 transitions. [2022-07-23 15:31:53,006 INFO L392 hiAutomatonCegarLoop]: Abstraction has 125 states and 216 transitions. [2022-07-23 15:31:53,006 INFO L374 stractBuchiCegarLoop]: Abstraction has 125 states and 216 transitions. [2022-07-23 15:31:53,007 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 15:31:53,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 216 transitions. [2022-07-23 15:31:53,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-07-23 15:31:53,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:53,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:53,009 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:53,009 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:53,009 INFO L752 eck$LassoCheckResult]: Stem: 1162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 1108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1109#L408 assume !(1 == ~c_req_up~0); 1073#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1155#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1164#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1137#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1138#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1117#L439-1 assume !(0 == ~e_f~0); 1044#L444-1 assume !(0 == ~e_g~0); 1045#L449-1 assume !(0 == ~e_e~0); 1133#L454-1 assume !(0 == ~e_c~0); 1134#L459-1 assume !(0 == ~e_wl~0); 1080#L464-1 assume !(1 == ~wl_pc~0); 1081#L476 assume !(2 == ~wl_pc~0); 1078#L477 assume !(1 == ~c1_pc~0); 1066#L487 assume !(1 == ~c2_pc~0); 1068#L496 assume !(1 == ~wb_pc~0); 1092#L505 assume !(1 == ~e_c~0); 1093#L514-1 assume !(1 == ~e_e~0); 1104#L519-1 assume !(1 == ~e_f~0); 1111#L524-1 assume !(1 == ~e_g~0); 1112#L529-1 assume !(1 == ~e_c~0); 1041#L534-1 assume !(1 == ~e_wl~0); 1042#L676-1 [2022-07-23 15:31:53,009 INFO L754 eck$LassoCheckResult]: Loop: 1042#L676-1 assume !false; 1043#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1065#L381 assume !false; 1105#L299 assume !(0 == ~wl_st~0); 1106#L303 assume !(0 == ~c1_st~0); 1163#L306 assume !(0 == ~c2_st~0); 1157#L309 assume !(0 == ~wb_st~0); 1158#L312 assume !(0 == ~r_st~0); 1165#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1113#L552 assume !(1 == ~c_req_up~0); 1114#L552-2 start_simulation_~kernel_st~0#1 := 3; 1061#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1062#L564-2 assume !(0 == ~e_g~0); 1046#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1047#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1056#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1057#L584-1 assume !(1 == ~wl_pc~0); 1121#L596 assume !(2 == ~wl_pc~0); 1123#L597 assume !(1 == ~c1_pc~0); 1086#L607 assume !(1 == ~c2_pc~0); 1087#L616 assume !(1 == ~wb_pc~0); 1146#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1136#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1131#L639-1 assume !(1 == ~e_f~0); 1132#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1148#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1110#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1074#L659-1 assume 0 == ~wl_st~0; 1042#L676-1 [2022-07-23 15:31:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2022-07-23 15:31:53,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:53,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857927031] [2022-07-23 15:31:53,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:53,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:53,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:53,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:53,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1622720252, now seen corresponding path program 2 times [2022-07-23 15:31:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:53,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537940937] [2022-07-23 15:31:53,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:53,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:53,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:53,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537940937] [2022-07-23 15:31:53,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537940937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:53,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:53,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:53,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541580746] [2022-07-23 15:31:53,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:53,111 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:31:53,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:53,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:31:53,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:31:53,112 INFO L87 Difference]: Start difference. First operand 125 states and 216 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) [2022-07-23 15:31:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:53,176 INFO L93 Difference]: Finished difference Result 159 states and 276 transitions. [2022-07-23 15:31:53,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:31:53,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 276 transitions. [2022-07-23 15:31:53,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 111 [2022-07-23 15:31:53,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 276 transitions. [2022-07-23 15:31:53,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2022-07-23 15:31:53,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2022-07-23 15:31:53,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 276 transitions. [2022-07-23 15:31:53,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:31:53,182 INFO L369 hiAutomatonCegarLoop]: Abstraction has 159 states and 276 transitions. [2022-07-23 15:31:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 276 transitions. [2022-07-23 15:31:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-07-23 15:31:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.7358490566037736) internal successors, (276), 158 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 276 transitions. [2022-07-23 15:31:53,187 INFO L392 hiAutomatonCegarLoop]: Abstraction has 159 states and 276 transitions. [2022-07-23 15:31:53,188 INFO L374 stractBuchiCegarLoop]: Abstraction has 159 states and 276 transitions. [2022-07-23 15:31:53,188 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 15:31:53,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 276 transitions. [2022-07-23 15:31:53,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 111 [2022-07-23 15:31:53,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:53,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:53,190 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:53,190 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:53,190 INFO L752 eck$LassoCheckResult]: Stem: 1458#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 1399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1400#L408 assume !(1 == ~c_req_up~0); 1364#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1450#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1461#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1429#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1430#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1408#L439-1 assume 0 == ~e_f~0;~e_f~0 := 1; 1334#L444-1 assume !(0 == ~e_g~0); 1335#L449-1 assume !(0 == ~e_e~0); 1425#L454-1 assume !(0 == ~e_c~0); 1426#L459-1 assume !(0 == ~e_wl~0); 1371#L464-1 assume !(1 == ~wl_pc~0); 1372#L476 assume !(2 == ~wl_pc~0); 1369#L477 assume !(1 == ~c1_pc~0); 1357#L487 assume !(1 == ~c2_pc~0); 1359#L496 assume !(1 == ~wb_pc~0); 1383#L505 assume !(1 == ~e_c~0); 1384#L514-1 assume !(1 == ~e_e~0); 1395#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1402#L524-1 assume !(1 == ~e_g~0); 1403#L529-1 assume !(1 == ~e_c~0); 1331#L534-1 assume !(1 == ~e_wl~0); 1332#L676-1 [2022-07-23 15:31:53,190 INFO L754 eck$LassoCheckResult]: Loop: 1332#L676-1 assume !false; 1333#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1356#L381 assume !false; 1396#L299 assume !(0 == ~wl_st~0); 1397#L303 assume !(0 == ~c1_st~0); 1460#L306 assume !(0 == ~c2_st~0); 1452#L309 assume !(0 == ~wb_st~0); 1453#L312 assume !(0 == ~r_st~0); 1462#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1404#L552 assume !(1 == ~c_req_up~0); 1405#L552-2 start_simulation_~kernel_st~0#1 := 3; 1351#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1352#L564-2 assume !(0 == ~e_g~0); 1489#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1488#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1487#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1486#L584-1 assume 1 == ~wl_pc~0; 1484#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1482#L597 assume !(1 == ~c1_pc~0); 1442#L607 assume !(1 == ~c2_pc~0); 1436#L616 assume !(1 == ~wb_pc~0); 1479#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1428#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1423#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1424#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1443#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1401#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1365#L659-1 assume 0 == ~wl_st~0; 1332#L676-1 [2022-07-23 15:31:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1276613851, now seen corresponding path program 1 times [2022-07-23 15:31:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:53,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783529597] [2022-07-23 15:31:53,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:53,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:53,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:53,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783529597] [2022-07-23 15:31:53,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783529597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:53,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:53,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:53,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686384562] [2022-07-23 15:31:53,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:53,260 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:31:53,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:53,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1071613489, now seen corresponding path program 1 times [2022-07-23 15:31:53,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:53,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650252158] [2022-07-23 15:31:53,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:53,269 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:53,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:53,584 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:31:53,585 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:31:53,586 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:31:53,586 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:31:53,586 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 15:31:53,586 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:53,591 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:31:53,591 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:31:53,591 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2022-07-23 15:31:53,591 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:31:53,591 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:31:53,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:53,893 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:31:53,900 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 15:31:53,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:53,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:53,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:53,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-23 15:31:53,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:53,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:53,942 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:31:53,943 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:31:53,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:53,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:53,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:53,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:53,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-23 15:31:53,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:53,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:53,988 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:31:53,989 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:31:54,004 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 [2022-07-23 15:31:54,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:54,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:54,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:54,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 15:31:54,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:54,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:54,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-23 15:31:54,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:54,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:54,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:54,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 15:31:54,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:54,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-23 15:31:54,218 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 15:31:54,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:54,247 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:31:54,248 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:31:54,248 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:31:54,248 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:31:54,248 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 15:31:54,248 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:54,248 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:31:54,248 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:31:54,248 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2022-07-23 15:31:54,248 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:31:54,248 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:31:54,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:54,530 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:31:54,534 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 15:31:54,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:54,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:54,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:54,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 15:31:54,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:31:54,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:54,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:54,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:54,551 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 15:31:54,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:54,553 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 15:31:54,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:54,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:31:54,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:54,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:54,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:54,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:54,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:31:54,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:54,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:54,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:54,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:31:54,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:54,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:31:54,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:54,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 15:31:54,627 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 15:31:54,631 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-23 15:31:54,631 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-23 15:31:54,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:54,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:54,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:54,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 15:31:54,641 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 15:31:54,641 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-23 15:31:54,642 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 15:31:54,642 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2022-07-23 15:31:54,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-23 15:31:54,668 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-23 15:31:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:54,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 15:31:54,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:31:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:54,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 15:31:54,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:31:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:54,867 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 [2022-07-23 15:31:54,868 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 159 states and 276 transitions. cyclomatic complexity: 118 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) [2022-07-23 15:31:54,937 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 159 states and 276 transitions. cyclomatic complexity: 118. 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 500 states and 860 transitions. Complement of second has 5 states. [2022-07-23 15:31:54,938 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 [2022-07-23 15:31:54,939 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) [2022-07-23 15:31:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2022-07-23 15:31:54,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2022-07-23 15:31:54,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:31:54,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2022-07-23 15:31:54,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:31:54,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2022-07-23 15:31:54,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:31:54,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 500 states and 860 transitions. [2022-07-23 15:31:54,963 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 333 [2022-07-23 15:31:54,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 500 states to 500 states and 860 transitions. [2022-07-23 15:31:54,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 382 [2022-07-23 15:31:54,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2022-07-23 15:31:54,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 500 states and 860 transitions. [2022-07-23 15:31:54,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:54,967 INFO L369 hiAutomatonCegarLoop]: Abstraction has 500 states and 860 transitions. [2022-07-23 15:31:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states and 860 transitions. [2022-07-23 15:31:54,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 385. [2022-07-23 15:31:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 385 states have (on average 1.7246753246753246) internal successors, (664), 384 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 664 transitions. [2022-07-23 15:31:54,980 INFO L392 hiAutomatonCegarLoop]: Abstraction has 385 states and 664 transitions. [2022-07-23 15:31:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:31:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:31:54,981 INFO L87 Difference]: Start difference. First operand 385 states and 664 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) [2022-07-23 15:31:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:55,001 INFO L93 Difference]: Finished difference Result 316 states and 521 transitions. [2022-07-23 15:31:55,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:31:55,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 521 transitions. [2022-07-23 15:31:55,004 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2022-07-23 15:31:55,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 521 transitions. [2022-07-23 15:31:55,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2022-07-23 15:31:55,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2022-07-23 15:31:55,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 521 transitions. [2022-07-23 15:31:55,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:55,007 INFO L369 hiAutomatonCegarLoop]: Abstraction has 316 states and 521 transitions. [2022-07-23 15:31:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 521 transitions. [2022-07-23 15:31:55,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-07-23 15:31:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.6487341772151898) internal successors, (521), 315 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 521 transitions. [2022-07-23 15:31:55,014 INFO L392 hiAutomatonCegarLoop]: Abstraction has 316 states and 521 transitions. [2022-07-23 15:31:55,014 INFO L374 stractBuchiCegarLoop]: Abstraction has 316 states and 521 transitions. [2022-07-23 15:31:55,014 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 15:31:55,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 521 transitions. [2022-07-23 15:31:55,018 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2022-07-23 15:31:55,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:55,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:55,019 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:55,019 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:55,020 INFO L752 eck$LassoCheckResult]: Stem: 3100#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 2991#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 2992#L408 assume !(1 == ~c_req_up~0); 2928#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3086#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3105#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3043#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3044#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3004#L439-1 assume !(0 == ~e_f~0); 2874#L444-1 assume !(0 == ~e_g~0); 2875#L449-1 assume !(0 == ~e_e~0); 3036#L454-1 assume !(0 == ~e_c~0); 3037#L459-1 assume !(0 == ~e_wl~0); 2939#L464-1 assume !(1 == ~wl_pc~0); 2940#L476 assume !(2 == ~wl_pc~0); 2937#L477 assume !(1 == ~c1_pc~0); 2918#L487 assume !(1 == ~c2_pc~0); 2920#L496 assume !(1 == ~wb_pc~0); 2960#L505 assume !(1 == ~e_c~0); 2961#L514-1 assume !(1 == ~e_e~0); 2983#L519-1 assume !(1 == ~e_f~0); 2993#L524-1 assume !(1 == ~e_g~0); 2994#L529-1 assume !(1 == ~e_c~0); 2868#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2869#L676-1 [2022-07-23 15:31:55,020 INFO L754 eck$LassoCheckResult]: Loop: 2869#L676-1 assume !false; 2871#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 3134#L381 assume !false; 3133#L299 assume !(0 == ~wl_st~0); 3132#L303 assume !(0 == ~c1_st~0); 3131#L306 assume !(0 == ~c2_st~0); 3130#L309 assume !(0 == ~wb_st~0); 3129#L312 assume !(0 == ~r_st~0); 3115#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 3113#L552 assume !(1 == ~c_req_up~0); 3112#L552-2 start_simulation_~kernel_st~0#1 := 3; 3111#L564 assume !(0 == ~e_f~0); 2916#L564-2 assume !(0 == ~e_g~0); 2917#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3110#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 2896#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 2897#L584-1 assume !(1 == ~wl_pc~0); 3011#L596 assume !(2 == ~wl_pc~0); 3013#L597 assume !(1 == ~c1_pc~0); 3064#L607 assume !(1 == ~c2_pc~0); 3121#L616 assume !(1 == ~wb_pc~0); 3101#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 3102#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3119#L639-1 assume !(1 == ~e_f~0); 3118#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3117#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2995#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2929#L659-1 assume 0 == ~wl_st~0; 2869#L676-1 [2022-07-23 15:31:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:55,020 INFO L85 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2022-07-23 15:31:55,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:55,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750321761] [2022-07-23 15:31:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:55,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:55,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-23 15:31:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:55,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:55,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750321761] [2022-07-23 15:31:55,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750321761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:55,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:55,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:55,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496211953] [2022-07-23 15:31:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:55,049 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:31:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:55,049 INFO L85 PathProgramCache]: Analyzing trace with hash 34372350, now seen corresponding path program 1 times [2022-07-23 15:31:55,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:55,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494544052] [2022-07-23 15:31:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:55,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:55,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494544052] [2022-07-23 15:31:55,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494544052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:55,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:55,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 15:31:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795071661] [2022-07-23 15:31:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:55,065 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:31:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:55,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 15:31:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 15:31:55,065 INFO L87 Difference]: Start difference. First operand 316 states and 521 transitions. cyclomatic complexity: 208 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) [2022-07-23 15:31:55,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:55,147 INFO L93 Difference]: Finished difference Result 597 states and 967 transitions. [2022-07-23 15:31:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 15:31:55,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 597 states and 967 transitions. [2022-07-23 15:31:55,152 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 313 [2022-07-23 15:31:55,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 597 states to 597 states and 967 transitions. [2022-07-23 15:31:55,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 390 [2022-07-23 15:31:55,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 390 [2022-07-23 15:31:55,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 597 states and 967 transitions. [2022-07-23 15:31:55,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:55,157 INFO L369 hiAutomatonCegarLoop]: Abstraction has 597 states and 967 transitions. [2022-07-23 15:31:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states and 967 transitions. [2022-07-23 15:31:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2022-07-23 15:31:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 595 states have (on average 1.6218487394957983) internal successors, (965), 594 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 965 transitions. [2022-07-23 15:31:55,169 INFO L392 hiAutomatonCegarLoop]: Abstraction has 595 states and 965 transitions. [2022-07-23 15:31:55,169 INFO L374 stractBuchiCegarLoop]: Abstraction has 595 states and 965 transitions. [2022-07-23 15:31:55,169 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 15:31:55,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 595 states and 965 transitions. [2022-07-23 15:31:55,172 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 313 [2022-07-23 15:31:55,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:55,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:55,173 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:55,173 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:55,173 INFO L752 eck$LassoCheckResult]: Stem: 4051#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 3917#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 3918#L408 assume !(1 == ~c_req_up~0); 4041#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4153#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4152#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4151#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4150#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4149#L439-1 assume !(0 == ~e_f~0); 4148#L444-1 assume !(0 == ~e_g~0); 4147#L449-1 assume !(0 == ~e_e~0); 4146#L454-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3969#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4045#L464-1 assume !(1 == ~wl_pc~0); 4091#L476 assume !(2 == ~wl_pc~0); 4090#L477 assume !(1 == ~c1_pc~0); 3840#L487 assume !(1 == ~c2_pc~0); 3842#L496 assume !(1 == ~wb_pc~0); 3883#L505 assume !(1 == ~e_c~0); 3884#L514-1 assume !(1 == ~e_e~0); 3908#L519-1 assume !(1 == ~e_f~0); 3919#L524-1 assume !(1 == ~e_g~0); 3920#L529-1 assume !(1 == ~e_c~0); 4069#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4207#L676-1 [2022-07-23 15:31:55,174 INFO L754 eck$LassoCheckResult]: Loop: 4207#L676-1 assume !false; 4200#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 4197#L381 assume !false; 4196#L299 assume !(0 == ~wl_st~0); 4195#L303 assume !(0 == ~c1_st~0); 4194#L306 assume !(0 == ~c2_st~0); 4193#L309 assume !(0 == ~wb_st~0); 4191#L312 assume !(0 == ~r_st~0); 4190#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 4188#L552 assume !(1 == ~c_req_up~0); 4187#L552-2 start_simulation_~kernel_st~0#1 := 3; 4186#L564 assume !(0 == ~e_f~0); 4185#L564-2 assume !(0 == ~e_g~0); 4184#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 4182#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4183#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4248#L584-1 assume 1 == ~wl_pc~0; 4241#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4239#L597 assume !(1 == ~c1_pc~0); 4237#L607 assume !(1 == ~c2_pc~0); 4233#L616 assume !(1 == ~wb_pc~0); 4229#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 4227#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4225#L639-1 assume !(1 == ~e_f~0); 4223#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4221#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4218#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4212#L659-1 assume 0 == ~wl_st~0; 4207#L676-1 [2022-07-23 15:31:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash 584245653, now seen corresponding path program 1 times [2022-07-23 15:31:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:55,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162104869] [2022-07-23 15:31:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:55,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:55,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:55,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162104869] [2022-07-23 15:31:55,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162104869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:55,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:55,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 15:31:55,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076545591] [2022-07-23 15:31:55,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:55,197 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:31:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash -514887371, now seen corresponding path program 1 times [2022-07-23 15:31:55,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:55,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421665723] [2022-07-23 15:31:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:55,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:55,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:55,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:55,432 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:31:55,432 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:31:55,432 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:31:55,432 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:31:55,432 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 15:31:55,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:55,433 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:31:55,433 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:31:55,433 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2022-07-23 15:31:55,433 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:31:55,433 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:31:55,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:55,652 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:31:55,652 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 15:31:55,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:55,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:55,654 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:55,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-23 15:31:55,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:55,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:55,680 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:31:55,680 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:31:55,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:55,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:55,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:55,703 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:55,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:55,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:55,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-23 15:31:55,730 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:31:55,730 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:31:55,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:55,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:55,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:55,757 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:55,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:55,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:55,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-23 15:31:55,791 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:31:55,791 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:31:55,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:55,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:55,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:55,817 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:55,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-23 15:31:55,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:55,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:55,852 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:31:55,852 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:31:55,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:55,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:55,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:55,879 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:55,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:55,886 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:55,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-23 15:31:55,911 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:31:55,912 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:31:55,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:55,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:55,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:55,938 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:55,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-23 15:31:55,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:55,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:55,987 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 [2022-07-23 15:31:55,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:55,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:55,989 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:55,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 15:31:55,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:56,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-23 15:31:56,011 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 15:31:56,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:56,036 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:31:56,036 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:31:56,036 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:31:56,036 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:31:56,036 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 15:31:56,036 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:56,036 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:31:56,036 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:31:56,036 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2022-07-23 15:31:56,036 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:31:56,036 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:31:56,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:56,269 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:31:56,269 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 15:31:56,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:56,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:56,271 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:56,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-23 15:31:56,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 [2022-07-23 15:31:56,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:56,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:56,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:56,290 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 15:31:56,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:56,291 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 15:31:56,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:56,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:31:56,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:56,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:56,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:56,312 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:56,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 15:31:56,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:31:56,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:56,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:56,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:56,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:31:56,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:56,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:31:56,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:56,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:31:56,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:56,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:56,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:56,359 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:56,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 15:31:56,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:31:56,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:56,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:56,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:56,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:31:56,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:56,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:31:56,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:56,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:31:56,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:56,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:56,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:56,434 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:56,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 15:31:56,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:31:56,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:56,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:56,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:56,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:31:56,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:56,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:31:56,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:56,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:31:56,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:56,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:56,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:56,494 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:56,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:31:56,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:56,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:56,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:56,508 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 15:31:56,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:56,509 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 15:31:56,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:56,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-23 15:31:56,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:31:56,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:56,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:56,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:56,554 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:56,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:31:56,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:56,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:56,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:56,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:31:56,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:56,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:31:56,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:56,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-23 15:31:56,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 15:31:56,609 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-23 15:31:56,609 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-23 15:31:56,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:56,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:56,611 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:56,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-23 15:31:56,614 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 15:31:56,614 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-23 15:31:56,614 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 15:31:56,614 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2022-07-23 15:31:56,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:56,644 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-23 15:31:56,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:56,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 15:31:56,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:31:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:56,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 15:31:56,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:31:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:56,780 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 [2022-07-23 15:31:56,781 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 595 states and 965 transitions. cyclomatic complexity: 375 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) [2022-07-23 15:31:56,817 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 595 states and 965 transitions. cyclomatic complexity: 375. 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 933 states and 1520 transitions. Complement of second has 5 states. [2022-07-23 15:31:56,818 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 [2022-07-23 15:31:56,819 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) [2022-07-23 15:31:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2022-07-23 15:31:56,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 362 transitions. Stem has 24 letters. Loop has 28 letters. [2022-07-23 15:31:56,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:31:56,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 362 transitions. Stem has 52 letters. Loop has 28 letters. [2022-07-23 15:31:56,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:31:56,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 362 transitions. Stem has 24 letters. Loop has 56 letters. [2022-07-23 15:31:56,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:31:56,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 933 states and 1520 transitions. [2022-07-23 15:31:56,829 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 533 [2022-07-23 15:31:56,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 933 states to 933 states and 1520 transitions. [2022-07-23 15:31:56,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 610 [2022-07-23 15:31:56,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 614 [2022-07-23 15:31:56,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 933 states and 1520 transitions. [2022-07-23 15:31:56,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:56,836 INFO L369 hiAutomatonCegarLoop]: Abstraction has 933 states and 1520 transitions. [2022-07-23 15:31:56,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states and 1520 transitions. [2022-07-23 15:31:56,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 595. [2022-07-23 15:31:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 595 states have (on average 1.6218487394957983) internal successors, (965), 594 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 965 transitions. [2022-07-23 15:31:56,849 INFO L392 hiAutomatonCegarLoop]: Abstraction has 595 states and 965 transitions. [2022-07-23 15:31:56,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:56,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 15:31:56,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 15:31:56,850 INFO L87 Difference]: Start difference. First operand 595 states and 965 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) [2022-07-23 15:31:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:56,909 INFO L93 Difference]: Finished difference Result 1015 states and 1639 transitions. [2022-07-23 15:31:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 15:31:56,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1015 states and 1639 transitions. [2022-07-23 15:31:56,916 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 498 [2022-07-23 15:31:56,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1015 states to 1015 states and 1639 transitions. [2022-07-23 15:31:56,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2022-07-23 15:31:56,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 618 [2022-07-23 15:31:56,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1639 transitions. [2022-07-23 15:31:56,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:56,922 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1015 states and 1639 transitions. [2022-07-23 15:31:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1639 transitions. [2022-07-23 15:31:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 600. [2022-07-23 15:31:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 600 states have (on average 1.61) internal successors, (966), 599 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 966 transitions. [2022-07-23 15:31:56,934 INFO L392 hiAutomatonCegarLoop]: Abstraction has 600 states and 966 transitions. [2022-07-23 15:31:56,934 INFO L374 stractBuchiCegarLoop]: Abstraction has 600 states and 966 transitions. [2022-07-23 15:31:56,934 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 15:31:56,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 600 states and 966 transitions. [2022-07-23 15:31:56,937 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 319 [2022-07-23 15:31:56,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:56,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:56,938 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:56,938 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:56,938 INFO L752 eck$LassoCheckResult]: Stem: 7409#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 7237#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 7238#L408 assume !(1 == ~c_req_up~0); 7371#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7372#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7419#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7420#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7410#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 7411#L439-1 assume !(0 == ~e_f~0); 7116#L444-1 assume !(0 == ~e_g~0); 7117#L449-1 assume !(0 == ~e_e~0); 7293#L454-1 assume !(0 == ~e_c~0); 7294#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 7183#L464-1 assume !(1 == ~wl_pc~0); 7184#L476 assume !(2 == ~wl_pc~0); 7446#L477 assume !(1 == ~c1_pc~0); 7444#L487 assume !(1 == ~c2_pc~0); 7442#L496 assume !(1 == ~wb_pc~0); 7440#L505 assume !(1 == ~e_c~0); 7439#L514-1 assume !(1 == ~e_e~0); 7438#L519-1 assume !(1 == ~e_f~0); 7437#L524-1 assume !(1 == ~e_g~0); 7436#L529-1 assume !(1 == ~e_c~0); 7435#L534-1 assume !(1 == ~e_wl~0); 7111#L676-1 assume !false; 7113#L546 [2022-07-23 15:31:56,938 INFO L754 eck$LassoCheckResult]: Loop: 7113#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 7327#L381 assume !false; 7328#L299 assume !(0 == ~wl_st~0); 7414#L303 assume !(0 == ~c1_st~0); 7415#L306 assume !(0 == ~c2_st~0); 7426#L309 assume !(0 == ~wb_st~0); 7429#L312 assume !(0 == ~r_st~0); 7421#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 7244#L552 assume !(1 == ~c_req_up~0); 7245#L552-2 start_simulation_~kernel_st~0#1 := 3; 7148#L564 assume !(0 == ~e_f~0); 7149#L564-2 assume !(0 == ~e_g~0); 7118#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7119#L574-1 assume !(0 == ~e_c~0); 7138#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 7139#L584-1 assume 1 == ~wl_pc~0; 7654#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 7652#L597 assume !(1 == ~c1_pc~0); 7650#L607 assume !(1 == ~c2_pc~0); 7648#L616 assume !(1 == ~wb_pc~0); 7646#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 7645#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7644#L639-1 assume !(1 == ~e_f~0); 7643#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7535#L649-1 assume !(1 == ~e_c~0); 7532#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7173#L659-1 assume 0 == ~wl_st~0; 7112#L676-1 assume !false; 7113#L546 [2022-07-23 15:31:56,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:56,938 INFO L85 PathProgramCache]: Analyzing trace with hash -79370950, now seen corresponding path program 1 times [2022-07-23 15:31:56,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:56,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928047529] [2022-07-23 15:31:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:56,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:56,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:56,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928047529] [2022-07-23 15:31:56,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928047529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:56,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:56,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 15:31:56,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157974751] [2022-07-23 15:31:56,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:56,966 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:31:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:56,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1109190157, now seen corresponding path program 1 times [2022-07-23 15:31:56,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:56,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397031900] [2022-07-23 15:31:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:56,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:56,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:56,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397031900] [2022-07-23 15:31:56,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397031900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:56,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:56,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:56,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154282467] [2022-07-23 15:31:56,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:56,979 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:31:56,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:56,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 15:31:56,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 15:31:56,979 INFO L87 Difference]: Start difference. First operand 600 states and 966 transitions. cyclomatic complexity: 371 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) [2022-07-23 15:31:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:57,058 INFO L93 Difference]: Finished difference Result 1248 states and 1981 transitions. [2022-07-23 15:31:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 15:31:57,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1248 states and 1981 transitions. [2022-07-23 15:31:57,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:57,070 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 710 [2022-07-23 15:31:57,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1248 states to 1248 states and 1981 transitions. [2022-07-23 15:31:57,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 796 [2022-07-23 15:31:57,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 796 [2022-07-23 15:31:57,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1248 states and 1981 transitions. [2022-07-23 15:31:57,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:57,079 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1248 states and 1981 transitions. [2022-07-23 15:31:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states and 1981 transitions. [2022-07-23 15:31:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 800. [2022-07-23 15:31:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 800 states have (on average 1.58875) internal successors, (1271), 799 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1271 transitions. [2022-07-23 15:31:57,094 INFO L392 hiAutomatonCegarLoop]: Abstraction has 800 states and 1271 transitions. [2022-07-23 15:31:57,094 INFO L374 stractBuchiCegarLoop]: Abstraction has 800 states and 1271 transitions. [2022-07-23 15:31:57,095 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-23 15:31:57,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 800 states and 1271 transitions. [2022-07-23 15:31:57,098 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 465 [2022-07-23 15:31:57,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:57,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:57,101 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:57,101 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:57,102 INFO L752 eck$LassoCheckResult]: Stem: 9244#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 9091#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 9092#L408 assume !(1 == ~c_req_up~0); 9209#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9210#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9257#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9156#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9157#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9245#L439-1 assume !(0 == ~e_f~0); 8974#L444-1 assume !(0 == ~e_g~0); 8975#L449-1 assume !(0 == ~e_e~0); 9145#L454-1 assume !(0 == ~e_c~0); 9146#L459-1 assume !(0 == ~e_wl~0); 9039#L464-1 assume !(1 == ~wl_pc~0); 9040#L476 assume !(2 == ~wl_pc~0); 9036#L477 assume !(1 == ~c1_pc~0); 9038#L487 assume !(1 == ~c2_pc~0); 9211#L496 assume !(1 == ~wb_pc~0); 9212#L505 assume !(1 == ~e_c~0); 9271#L514-1 assume !(1 == ~e_e~0); 9266#L519-1 assume !(1 == ~e_f~0); 9097#L524-1 assume !(1 == ~e_g~0); 9098#L529-1 assume !(1 == ~e_c~0); 9265#L534-1 assume !(1 == ~e_wl~0); 9279#L676-1 assume !false; 9280#L546 [2022-07-23 15:31:57,102 INFO L754 eck$LassoCheckResult]: Loop: 9280#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 9711#L381 assume !false; 9710#L299 assume !(0 == ~wl_st~0); 9709#L303 assume !(0 == ~c1_st~0); 9708#L306 assume !(0 == ~c2_st~0); 9707#L309 assume !(0 == ~wb_st~0); 9609#L312 assume !(0 == ~r_st~0); 9254#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 9099#L552 assume !(1 == ~c_req_up~0); 9100#L552-2 start_simulation_~kernel_st~0#1 := 3; 9004#L564 assume !(0 == ~e_f~0); 9005#L564-2 assume !(0 == ~e_g~0); 8976#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 8977#L574-1 assume !(0 == ~e_c~0); 8996#L579-1 assume !(0 == ~e_wl~0); 8997#L584-1 assume !(1 == ~wl_pc~0); 9118#L596 assume !(2 == ~wl_pc~0); 9120#L597 assume !(1 == ~c1_pc~0); 9048#L607 assume !(1 == ~c2_pc~0); 9049#L616 assume !(1 == ~wb_pc~0); 9180#L625 assume !(1 == ~e_c~0); 9246#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 9767#L639-1 assume !(1 == ~e_f~0); 9766#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 9765#L649-1 assume !(1 == ~e_c~0); 9764#L654-1 assume !(1 == ~e_wl~0); 9762#L659-1 assume 0 == ~wl_st~0; 9618#L676-1 assume !false; 9280#L546 [2022-07-23 15:31:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:57,102 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2022-07-23 15:31:57,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:57,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748670133] [2022-07-23 15:31:57,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:57,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:57,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:57,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:57,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash -864089630, now seen corresponding path program 1 times [2022-07-23 15:31:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:57,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777691994] [2022-07-23 15:31:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:57,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777691994] [2022-07-23 15:31:57,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777691994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:57,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:57,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865585588] [2022-07-23 15:31:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:57,163 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:31:57,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:57,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:31:57,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:31:57,164 INFO L87 Difference]: Start difference. First operand 800 states and 1271 transitions. cyclomatic complexity: 476 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) [2022-07-23 15:31:57,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:57,186 INFO L93 Difference]: Finished difference Result 1241 states and 1961 transitions. [2022-07-23 15:31:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:31:57,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1241 states and 1961 transitions. [2022-07-23 15:31:57,194 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 739 [2022-07-23 15:31:57,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1241 states to 1241 states and 1961 transitions. [2022-07-23 15:31:57,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 799 [2022-07-23 15:31:57,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 799 [2022-07-23 15:31:57,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1241 states and 1961 transitions. [2022-07-23 15:31:57,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:57,202 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2022-07-23 15:31:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states and 1961 transitions. [2022-07-23 15:31:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2022-07-23 15:31:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1241 states have (on average 1.5801772763900082) internal successors, (1961), 1240 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1961 transitions. [2022-07-23 15:31:57,223 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2022-07-23 15:31:57,224 INFO L374 stractBuchiCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2022-07-23 15:31:57,224 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-23 15:31:57,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1241 states and 1961 transitions. [2022-07-23 15:31:57,228 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 739 [2022-07-23 15:31:57,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:57,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:57,229 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:57,229 INFO L180 hiAutomatonCegarLoop]: 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, 1] [2022-07-23 15:31:57,229 INFO L752 eck$LassoCheckResult]: Stem: 11289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 11136#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 11137#L408 assume !(1 == ~c_req_up~0); 11253#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 11254#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 11298#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 11299#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 11290#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 11291#L439-1 assume !(0 == ~e_f~0); 11021#L444-1 assume !(0 == ~e_g~0); 11022#L449-1 assume !(0 == ~e_e~0); 11187#L454-1 assume !(0 == ~e_c~0); 11188#L459-1 assume !(0 == ~e_wl~0); 11278#L464-1 assume !(1 == ~wl_pc~0); 11320#L476 assume !(2 == ~wl_pc~0); 11319#L477 assume !(1 == ~c1_pc~0); 11069#L487 assume !(1 == ~c2_pc~0); 11071#L496 assume !(1 == ~wb_pc~0); 11105#L505 assume !(1 == ~e_c~0); 11106#L514-1 assume !(1 == ~e_e~0); 11310#L519-1 assume !(1 == ~e_f~0); 11141#L524-1 assume !(1 == ~e_g~0); 11142#L529-1 assume !(1 == ~e_c~0); 11309#L534-1 assume !(1 == ~e_wl~0); 11451#L676-1 assume !false; 11452#L546 [2022-07-23 15:31:57,229 INFO L754 eck$LassoCheckResult]: Loop: 11452#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 11815#L381 assume !false; 11813#L299 assume !(0 == ~wl_st~0); 11129#L303 assume !(0 == ~c1_st~0); 11294#L306 assume !(0 == ~c2_st~0); 11258#L309 assume !(0 == ~wb_st~0); 11259#L312 assume !(0 == ~r_st~0); 11300#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 11143#L552 assume !(1 == ~c_req_up~0); 11144#L552-2 start_simulation_~kernel_st~0#1 := 3; 11051#L564 assume !(0 == ~e_f~0); 11052#L564-2 assume !(0 == ~e_g~0); 11023#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 11024#L574-1 assume !(0 == ~e_c~0); 11043#L579-1 assume !(0 == ~e_wl~0); 11044#L584-1 assume !(1 == ~wl_pc~0); 11162#L596 assume 2 == ~wl_pc~0; 11163#L598 assume 1 == ~e_e~0;~wl_st~0 := 0; 12136#L597 assume !(1 == ~c1_pc~0); 12132#L607 assume !(1 == ~c2_pc~0); 12128#L616 assume !(1 == ~wb_pc~0); 11292#L625 assume !(1 == ~e_c~0); 11193#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 11183#L639-1 assume !(1 == ~e_f~0); 11184#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 11231#L649-1 assume !(1 == ~e_c~0); 11232#L654-1 assume !(1 == ~e_wl~0); 12078#L659-1 assume 0 == ~wl_st~0; 12075#L676-1 assume !false; 11452#L546 [2022-07-23 15:31:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2022-07-23 15:31:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:57,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324335669] [2022-07-23 15:31:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:57,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:57,236 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:57,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1766031718, now seen corresponding path program 1 times [2022-07-23 15:31:57,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:57,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454190860] [2022-07-23 15:31:57,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:57,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:57,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:57,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:57,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:57,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1128637889, now seen corresponding path program 1 times [2022-07-23 15:31:57,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:57,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454240140] [2022-07-23 15:31:57,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:57,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:57,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:57,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454240140] [2022-07-23 15:31:57,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454240140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:57,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:57,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362236181] [2022-07-23 15:31:57,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:57,442 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:31:57,442 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:31:57,442 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:31:57,442 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:31:57,443 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 15:31:57,443 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:57,443 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:31:57,443 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:31:57,443 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration11_Loop [2022-07-23 15:31:57,443 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:31:57,443 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:31:57,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,709 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:31:57,709 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 15:31:57,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:57,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:57,711 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:57,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:57,720 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:57,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-23 15:31:57,744 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:31:57,744 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:31:57,769 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 [2022-07-23 15:31:57,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:57,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:57,771 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:57,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-23 15:31:57,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:57,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:57,795 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:31:57,795 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:31:57,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:57,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:57,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:57,822 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:57,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-23 15:31:57,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:57,824 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:57,832 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:31:57,832 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:31:57,852 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 [2022-07-23 15:31:57,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:57,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:57,853 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:31:57,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-23 15:31:57,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:31:57,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:57,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-23 15:31:57,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:57,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:57,879 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) [2022-07-23 15:31:57,880 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 [2022-07-23 15:31:57,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 15:31:57,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:31:57,893 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 15:31:57,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-23 15:31:57,909 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:31:57,909 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:31:57,909 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:31:57,909 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:31:57,909 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 15:31:57,909 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:57,909 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:31:57,910 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:31:57,910 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration11_Loop [2022-07-23 15:31:57,910 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:31:57,910 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:31:57,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:57,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:31:58,155 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:31:58,156 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 15:31:58,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:58,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:58,157 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) [2022-07-23 15:31:58,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:31:58,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:58,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:58,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:58,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:31:58,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:58,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:31:58,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:58,174 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 [2022-07-23 15:31:58,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:31:58,209 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 [2022-07-23 15:31:58,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:58,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:58,211 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) [2022-07-23 15:31:58,212 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 [2022-07-23 15:31:58,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:31:58,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:58,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:58,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:58,221 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 15:31:58,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:58,222 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 15:31:58,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:58,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:31:58,260 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 [2022-07-23 15:31:58,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:58,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:58,262 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) [2022-07-23 15:31:58,263 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 [2022-07-23 15:31:58,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:31:58,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:58,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:58,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:58,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:31:58,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:58,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:31:58,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:58,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:31:58,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-23 15:31:58,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:58,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:58,313 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) [2022-07-23 15:31:58,314 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 [2022-07-23 15:31:58,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:31:58,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:31:58,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:31:58,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:31:58,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:31:58,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:31:58,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:31:58,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:31:58,324 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 15:31:58,326 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-23 15:31:58,326 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-23 15:31:58,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:31:58,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:31:58,327 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) [2022-07-23 15:31:58,328 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 [2022-07-23 15:31:58,329 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 15:31:58,329 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-23 15:31:58,329 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 15:31:58,329 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2022-07-23 15:31:58,345 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 [2022-07-23 15:31:58,345 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-23 15:31:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:58,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 15:31:58,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:31:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:58,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 15:31:58,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:31:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:58,482 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 [2022-07-23 15:31:58,482 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1241 states and 1961 transitions. cyclomatic complexity: 725 Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:58,519 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1241 states and 1961 transitions. cyclomatic complexity: 725. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 3166 states and 4998 transitions. Complement of second has 5 states. [2022-07-23 15:31:58,520 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 [2022-07-23 15:31:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2022-07-23 15:31:58,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 25 letters. Loop has 29 letters. [2022-07-23 15:31:58,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:31:58,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 54 letters. Loop has 29 letters. [2022-07-23 15:31:58,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:31:58,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 25 letters. Loop has 58 letters. [2022-07-23 15:31:58,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:31:58,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3166 states and 4998 transitions. [2022-07-23 15:31:58,543 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2022-07-23 15:31:58,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3166 states to 3166 states and 4998 transitions. [2022-07-23 15:31:58,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1384 [2022-07-23 15:31:58,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1401 [2022-07-23 15:31:58,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3166 states and 4998 transitions. [2022-07-23 15:31:58,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:58,564 INFO L369 hiAutomatonCegarLoop]: Abstraction has 3166 states and 4998 transitions. [2022-07-23 15:31:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states and 4998 transitions. [2022-07-23 15:31:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3149. [2022-07-23 15:31:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3149 states have (on average 1.577961257542077) internal successors, (4969), 3148 states have internal predecessors, (4969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4969 transitions. [2022-07-23 15:31:58,635 INFO L392 hiAutomatonCegarLoop]: Abstraction has 3149 states and 4969 transitions. [2022-07-23 15:31:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:58,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:31:58,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:31:58,636 INFO L87 Difference]: Start difference. First operand 3149 states and 4969 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:58,652 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 [2022-07-23 15:31:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:58,670 INFO L93 Difference]: Finished difference Result 3149 states and 4917 transitions. [2022-07-23 15:31:58,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:31:58,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3149 states and 4917 transitions. [2022-07-23 15:31:58,689 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2022-07-23 15:31:58,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3149 states to 3149 states and 4917 transitions. [2022-07-23 15:31:58,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1384 [2022-07-23 15:31:58,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1384 [2022-07-23 15:31:58,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3149 states and 4917 transitions. [2022-07-23 15:31:58,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:58,709 INFO L369 hiAutomatonCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2022-07-23 15:31:58,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states and 4917 transitions. [2022-07-23 15:31:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3149. [2022-07-23 15:31:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3149 states have (on average 1.5614480787551603) internal successors, (4917), 3148 states have internal predecessors, (4917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4917 transitions. [2022-07-23 15:31:58,768 INFO L392 hiAutomatonCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2022-07-23 15:31:58,768 INFO L374 stractBuchiCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2022-07-23 15:31:58,769 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-23 15:31:58,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3149 states and 4917 transitions. [2022-07-23 15:31:58,782 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2022-07-23 15:31:58,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:58,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:58,783 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:58,783 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:31:58,783 INFO L752 eck$LassoCheckResult]: Stem: 22170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 22025#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 22026#L408 assume !(1 == ~c_req_up~0); 21962#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 22191#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 22176#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 22177#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 22187#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 22186#L439-1 assume !(0 == ~e_f~0); 21911#L444-1 assume !(0 == ~e_g~0); 21912#L449-1 assume !(0 == ~e_e~0); 22076#L454-1 assume !(0 == ~e_c~0); 22077#L459-1 assume !(0 == ~e_wl~0); 22162#L464-1 assume !(1 == ~wl_pc~0); 22198#L476 assume !(2 == ~wl_pc~0); 22197#L477 assume !(1 == ~c1_pc~0); 21952#L487 assume !(1 == ~c2_pc~0); 21954#L496 assume !(1 == ~wb_pc~0); 21993#L505 assume !(1 == ~e_c~0); 21994#L514-1 assume !(1 == ~e_e~0); 22017#L519-1 assume !(1 == ~e_f~0); 22027#L524-1 assume !(1 == ~e_g~0); 22028#L529-1 assume !(1 == ~e_c~0); 21905#L534-1 assume !(1 == ~e_wl~0); 21906#L676-1 assume !false; 22616#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 22107#L381 [2022-07-23 15:31:58,783 INFO L754 eck$LassoCheckResult]: Loop: 22107#L381 assume !false; 22018#L299 assume 0 == ~wl_st~0; 21977#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 21978#L325 assume !(0 != eval_~tmp~0#1); 22108#L321 assume !(0 == ~c1_st~0); 24723#L336 assume !(0 == ~c2_st~0); 24719#L351 assume !(0 == ~wb_st~0); 24714#L366 assume !(0 == ~r_st~0); 22107#L381 [2022-07-23 15:31:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2022-07-23 15:31:58,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:58,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022229965] [2022-07-23 15:31:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:58,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:58,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:58,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:58,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:58,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1282723830, now seen corresponding path program 1 times [2022-07-23 15:31:58,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:58,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512044779] [2022-07-23 15:31:58,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:58,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:58,802 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:58,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:58,805 INFO L85 PathProgramCache]: Analyzing trace with hash 363769326, now seen corresponding path program 1 times [2022-07-23 15:31:58,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:58,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752836769] [2022-07-23 15:31:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:58,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:58,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752836769] [2022-07-23 15:31:58,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752836769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:58,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:58,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:58,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530231685] [2022-07-23 15:31:58,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:58,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:31:58,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:31:58,851 INFO L87 Difference]: Start difference. First operand 3149 states and 4917 transitions. cyclomatic complexity: 1783 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) [2022-07-23 15:31:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:58,917 INFO L93 Difference]: Finished difference Result 4634 states and 7109 transitions. [2022-07-23 15:31:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:31:58,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4634 states and 7109 transitions. [2022-07-23 15:31:58,938 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1978 [2022-07-23 15:31:58,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4634 states to 4634 states and 7109 transitions. [2022-07-23 15:31:58,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2042 [2022-07-23 15:31:58,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2042 [2022-07-23 15:31:58,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4634 states and 7109 transitions. [2022-07-23 15:31:58,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:58,966 INFO L369 hiAutomatonCegarLoop]: Abstraction has 4634 states and 7109 transitions. [2022-07-23 15:31:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states and 7109 transitions. [2022-07-23 15:31:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4616. [2022-07-23 15:31:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4616 states, 4616 states have (on average 1.5361785095320624) internal successors, (7091), 4615 states have internal predecessors, (7091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4616 states to 4616 states and 7091 transitions. [2022-07-23 15:31:59,040 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4616 states and 7091 transitions. [2022-07-23 15:31:59,040 INFO L374 stractBuchiCegarLoop]: Abstraction has 4616 states and 7091 transitions. [2022-07-23 15:31:59,040 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-23 15:31:59,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4616 states and 7091 transitions. [2022-07-23 15:31:59,052 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1970 [2022-07-23 15:31:59,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:59,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:59,053 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:59,053 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:31:59,053 INFO L752 eck$LassoCheckResult]: Stem: 29972#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 29819#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 29820#L408 assume !(1 == ~c_req_up~0); 29751#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 29997#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 29979#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 29980#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 29994#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 29993#L439-1 assume !(0 == ~e_f~0); 29702#L444-1 assume !(0 == ~e_g~0); 29703#L449-1 assume !(0 == ~e_e~0); 29870#L454-1 assume !(0 == ~e_c~0); 29871#L459-1 assume !(0 == ~e_wl~0); 29962#L464-1 assume !(1 == ~wl_pc~0); 30004#L476 assume !(2 == ~wl_pc~0); 30003#L477 assume !(1 == ~c1_pc~0); 29741#L487 assume !(1 == ~c2_pc~0); 29743#L496 assume !(1 == ~wb_pc~0); 29782#L505 assume !(1 == ~e_c~0); 29783#L514-1 assume !(1 == ~e_e~0); 29809#L519-1 assume !(1 == ~e_f~0); 29821#L524-1 assume !(1 == ~e_g~0); 29822#L529-1 assume !(1 == ~e_c~0); 29991#L534-1 assume !(1 == ~e_wl~0); 32259#L676-1 assume !false; 32251#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 32249#L381 [2022-07-23 15:31:59,053 INFO L754 eck$LassoCheckResult]: Loop: 32249#L381 assume !false; 31538#L299 assume 0 == ~wl_st~0; 31539#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 31512#L325 assume !(0 != eval_~tmp~0#1); 31513#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 31619#L340 assume !(0 != eval_~tmp___0~0#1); 31621#L336 assume !(0 == ~c2_st~0); 31612#L351 assume !(0 == ~wb_st~0); 31609#L366 assume !(0 == ~r_st~0); 32249#L381 [2022-07-23 15:31:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:59,054 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2022-07-23 15:31:59,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:59,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425125146] [2022-07-23 15:31:59,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:59,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:59,065 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:59,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:59,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1058006530, now seen corresponding path program 1 times [2022-07-23 15:31:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:59,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532887734] [2022-07-23 15:31:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:59,076 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:59,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1659779318, now seen corresponding path program 1 times [2022-07-23 15:31:59,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:59,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226379336] [2022-07-23 15:31:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:59,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:59,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226379336] [2022-07-23 15:31:59,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226379336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:59,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:59,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:59,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574519719] [2022-07-23 15:31:59,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:59,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:31:59,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:31:59,144 INFO L87 Difference]: Start difference. First operand 4616 states and 7091 transitions. cyclomatic complexity: 2490 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) [2022-07-23 15:31:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:59,185 INFO L93 Difference]: Finished difference Result 7194 states and 10846 transitions. [2022-07-23 15:31:59,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:31:59,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7194 states and 10846 transitions. [2022-07-23 15:31:59,214 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3096 [2022-07-23 15:31:59,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7194 states to 7194 states and 10846 transitions. [2022-07-23 15:31:59,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3210 [2022-07-23 15:31:59,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3210 [2022-07-23 15:31:59,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7194 states and 10846 transitions. [2022-07-23 15:31:59,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:59,288 INFO L369 hiAutomatonCegarLoop]: Abstraction has 7194 states and 10846 transitions. [2022-07-23 15:31:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states and 10846 transitions. [2022-07-23 15:31:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 7158. [2022-07-23 15:31:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7158 states, 7158 states have (on average 1.5101983794355964) internal successors, (10810), 7157 states have internal predecessors, (10810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 10810 transitions. [2022-07-23 15:31:59,416 INFO L392 hiAutomatonCegarLoop]: Abstraction has 7158 states and 10810 transitions. [2022-07-23 15:31:59,416 INFO L374 stractBuchiCegarLoop]: Abstraction has 7158 states and 10810 transitions. [2022-07-23 15:31:59,416 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-23 15:31:59,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7158 states and 10810 transitions. [2022-07-23 15:31:59,435 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2022-07-23 15:31:59,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:59,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:59,436 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:59,436 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:31:59,436 INFO L752 eck$LassoCheckResult]: Stem: 41811#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 41642#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 41643#L408 assume !(1 == ~c_req_up~0); 41572#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 41824#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 41825#L424-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 41851#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 41846#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 41847#L439-1 assume !(0 == ~e_f~0); 41520#L444-1 assume !(0 == ~e_g~0); 41521#L449-1 assume !(0 == ~e_e~0); 41698#L454-1 assume !(0 == ~e_c~0); 41699#L459-1 assume !(0 == ~e_wl~0); 41874#L464-1 assume !(1 == ~wl_pc~0); 41873#L476 assume !(2 == ~wl_pc~0); 41868#L477 assume !(1 == ~c1_pc~0); 41867#L487 assume !(1 == ~c2_pc~0); 41860#L496 assume !(1 == ~wb_pc~0); 41859#L505 assume !(1 == ~e_c~0); 41631#L514-1 assume !(1 == ~e_e~0); 41632#L519-1 assume !(1 == ~e_f~0); 41644#L524-1 assume !(1 == ~e_g~0); 41645#L529-1 assume !(1 == ~e_c~0); 42624#L534-1 assume !(1 == ~e_wl~0); 44178#L676-1 assume !false; 44179#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 45904#L381 [2022-07-23 15:31:59,436 INFO L754 eck$LassoCheckResult]: Loop: 45904#L381 assume !false; 47756#L299 assume 0 == ~wl_st~0; 47755#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 47754#L325 assume !(0 != eval_~tmp~0#1); 47753#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 47737#L340 assume !(0 != eval_~tmp___0~0#1); 47752#L336 assume !(0 == ~c2_st~0); 47767#L351 assume !(0 == ~wb_st~0); 47759#L366 assume !(0 == ~r_st~0); 45904#L381 [2022-07-23 15:31:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:59,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2022-07-23 15:31:59,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:59,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534665630] [2022-07-23 15:31:59,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:59,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:59,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534665630] [2022-07-23 15:31:59,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534665630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:59,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:59,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:59,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213474693] [2022-07-23 15:31:59,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:59,459 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:31:59,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:59,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1058006530, now seen corresponding path program 2 times [2022-07-23 15:31:59,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:59,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239080142] [2022-07-23 15:31:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:59,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:59,462 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:59,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:59,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:59,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:31:59,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:31:59,498 INFO L87 Difference]: Start difference. First operand 7158 states and 10810 transitions. cyclomatic complexity: 3667 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) [2022-07-23 15:31:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:59,588 INFO L93 Difference]: Finished difference Result 7106 states and 10723 transitions. [2022-07-23 15:31:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:31:59,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7106 states and 10723 transitions. [2022-07-23 15:31:59,614 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2022-07-23 15:31:59,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7106 states to 7106 states and 10723 transitions. [2022-07-23 15:31:59,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3144 [2022-07-23 15:31:59,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3144 [2022-07-23 15:31:59,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7106 states and 10723 transitions. [2022-07-23 15:31:59,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:31:59,642 INFO L369 hiAutomatonCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2022-07-23 15:31:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states and 10723 transitions. [2022-07-23 15:31:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 7106. [2022-07-23 15:31:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7106 states, 7106 states have (on average 1.5090064734027582) internal successors, (10723), 7105 states have internal predecessors, (10723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:31:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7106 states to 7106 states and 10723 transitions. [2022-07-23 15:31:59,768 INFO L392 hiAutomatonCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2022-07-23 15:31:59,768 INFO L374 stractBuchiCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2022-07-23 15:31:59,768 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-23 15:31:59,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7106 states and 10723 transitions. [2022-07-23 15:31:59,786 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2022-07-23 15:31:59,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:31:59,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:31:59,787 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:31:59,787 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:31:59,787 INFO L752 eck$LassoCheckResult]: Stem: 56063#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 55907#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 55908#L408 assume !(1 == ~c_req_up~0); 56029#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 56030#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 56073#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 55971#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 55972#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 56064#L439-1 assume !(0 == ~e_f~0); 55790#L444-1 assume !(0 == ~e_g~0); 55791#L449-1 assume !(0 == ~e_e~0); 55958#L454-1 assume !(0 == ~e_c~0); 55959#L459-1 assume !(0 == ~e_wl~0); 55854#L464-1 assume !(1 == ~wl_pc~0); 55855#L476 assume !(2 == ~wl_pc~0); 55851#L477 assume !(1 == ~c1_pc~0); 55853#L487 assume !(1 == ~c2_pc~0); 56031#L496 assume !(1 == ~wb_pc~0); 56032#L505 assume !(1 == ~e_c~0); 56086#L514-1 assume !(1 == ~e_e~0); 56080#L519-1 assume !(1 == ~e_f~0); 55911#L524-1 assume !(1 == ~e_g~0); 55912#L529-1 assume !(1 == ~e_c~0); 55784#L534-1 assume !(1 == ~e_wl~0); 55785#L676-1 assume !false; 58393#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 58394#L381 [2022-07-23 15:31:59,788 INFO L754 eck$LassoCheckResult]: Loop: 58394#L381 assume !false; 62766#L299 assume 0 == ~wl_st~0; 62765#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 58651#L325 assume !(0 != eval_~tmp~0#1); 58562#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 58560#L340 assume !(0 != eval_~tmp___0~0#1); 58559#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 58538#L355 assume !(0 != eval_~tmp___1~0#1); 62077#L351 assume !(0 == ~wb_st~0); 62073#L366 assume !(0 == ~r_st~0); 58394#L381 [2022-07-23 15:31:59,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2022-07-23 15:31:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:59,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664061165] [2022-07-23 15:31:59,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:59,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:59,795 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:59,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:59,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:59,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1563186686, now seen corresponding path program 1 times [2022-07-23 15:31:59,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:59,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349074836] [2022-07-23 15:31:59,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:59,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:59,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:31:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:31:59,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:31:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:31:59,809 INFO L85 PathProgramCache]: Analyzing trace with hash 84797946, now seen corresponding path program 1 times [2022-07-23 15:31:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:31:59,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434938154] [2022-07-23 15:31:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:31:59,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:31:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:31:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:31:59,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:31:59,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434938154] [2022-07-23 15:31:59,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434938154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:31:59,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:31:59,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:31:59,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597301297] [2022-07-23 15:31:59,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:31:59,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:31:59,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:31:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:31:59,875 INFO L87 Difference]: Start difference. First operand 7106 states and 10723 transitions. cyclomatic complexity: 3632 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) [2022-07-23 15:31:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:31:59,969 INFO L93 Difference]: Finished difference Result 12263 states and 18336 transitions. [2022-07-23 15:31:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:31:59,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12263 states and 18336 transitions. [2022-07-23 15:32:00,023 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 5356 [2022-07-23 15:32:00,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12263 states to 12263 states and 18336 transitions. [2022-07-23 15:32:00,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5422 [2022-07-23 15:32:00,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5422 [2022-07-23 15:32:00,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12263 states and 18336 transitions. [2022-07-23 15:32:00,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:32:00,080 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2022-07-23 15:32:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12263 states and 18336 transitions. [2022-07-23 15:32:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12263 to 12263. [2022-07-23 15:32:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12263 states, 12263 states have (on average 1.4952295523118324) internal successors, (18336), 12262 states have internal predecessors, (18336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:32:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12263 states to 12263 states and 18336 transitions. [2022-07-23 15:32:00,329 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2022-07-23 15:32:00,330 INFO L374 stractBuchiCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2022-07-23 15:32:00,330 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-23 15:32:00,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12263 states and 18336 transitions. [2022-07-23 15:32:00,376 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 5356 [2022-07-23 15:32:00,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:32:00,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:32:00,377 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:32:00,377 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:32:00,377 INFO L752 eck$LassoCheckResult]: Stem: 75469#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~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; 75287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 75288#L408 assume !(1 == ~c_req_up~0); 75426#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 75427#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 75481#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 75354#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 75355#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 75470#L439-1 assume !(0 == ~e_f~0); 75167#L444-1 assume !(0 == ~e_g~0); 75168#L449-1 assume !(0 == ~e_e~0); 75343#L454-1 assume !(0 == ~e_c~0); 75344#L459-1 assume !(0 == ~e_wl~0); 75230#L464-1 assume !(1 == ~wl_pc~0); 75231#L476 assume !(2 == ~wl_pc~0); 75227#L477 assume !(1 == ~c1_pc~0); 75229#L487 assume !(1 == ~c2_pc~0); 75428#L496 assume !(1 == ~wb_pc~0); 75429#L505 assume !(1 == ~e_c~0); 75500#L514-1 assume !(1 == ~e_e~0); 75494#L519-1 assume !(1 == ~e_f~0); 75291#L524-1 assume !(1 == ~e_g~0); 75292#L529-1 assume !(1 == ~e_c~0); 75161#L534-1 assume !(1 == ~e_wl~0); 75162#L676-1 assume !false; 77744#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 78410#L381 [2022-07-23 15:32:00,377 INFO L754 eck$LassoCheckResult]: Loop: 78410#L381 assume !false; 83897#L299 assume 0 == ~wl_st~0; 83896#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 78394#L325 assume !(0 != eval_~tmp~0#1); 78395#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 83908#L340 assume !(0 != eval_~tmp___0~0#1); 83907#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 83904#L355 assume !(0 != eval_~tmp___1~0#1); 83903#L351 assume 0 == ~wb_st~0;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 83901#L370 assume !(0 != eval_~tmp___2~0#1); 83898#L366 assume !(0 == ~r_st~0); 78410#L381 [2022-07-23 15:32:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:32:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2022-07-23 15:32:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:32:00,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311414101] [2022-07-23 15:32:00,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:32:00,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:32:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:32:00,384 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:32:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:32:00,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:32:00,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:32:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1214182410, now seen corresponding path program 1 times [2022-07-23 15:32:00,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:32:00,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032209266] [2022-07-23 15:32:00,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:32:00,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:32:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:32:00,394 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:32:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:32:00,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:32:00,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:32:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1666266370, now seen corresponding path program 1 times [2022-07-23 15:32:00,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:32:00,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820918751] [2022-07-23 15:32:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:32:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:32:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:32:00,409 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:32:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:32:00,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:32:01,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 03:32:01 BoogieIcfgContainer [2022-07-23 15:32:01,414 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 15:32:01,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 15:32:01,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 15:32:01,415 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 15:32:01,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:31:52" (3/4) ... [2022-07-23 15:32:01,418 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-23 15:32:01,463 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-23 15:32:01,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 15:32:01,464 INFO L158 Benchmark]: Toolchain (without parser) took 10132.59ms. Allocated memory was 81.8MB in the beginning and 285.2MB in the end (delta: 203.4MB). Free memory was 48.0MB in the beginning and 176.5MB in the end (delta: -128.5MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2022-07-23 15:32:01,464 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 17.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 15:32:01,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.18ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 47.8MB in the beginning and 68.2MB in the end (delta: -20.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-23 15:32:01,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.44ms. Allocated memory is still 98.6MB. Free memory was 68.2MB in the beginning and 65.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 15:32:01,465 INFO L158 Benchmark]: Boogie Preprocessor took 31.09ms. Allocated memory is still 98.6MB. Free memory was 65.8MB in the beginning and 64.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 15:32:01,465 INFO L158 Benchmark]: RCFGBuilder took 487.62ms. Allocated memory is still 98.6MB. Free memory was 63.7MB in the beginning and 74.9MB in the end (delta: -11.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2022-07-23 15:32:01,466 INFO L158 Benchmark]: BuchiAutomizer took 9203.83ms. Allocated memory was 98.6MB in the beginning and 285.2MB in the end (delta: 186.6MB). Free memory was 74.7MB in the beginning and 179.6MB in the end (delta: -104.9MB). Peak memory consumption was 182.8MB. Max. memory is 16.1GB. [2022-07-23 15:32:01,466 INFO L158 Benchmark]: Witness Printer took 48.12ms. Allocated memory is still 285.2MB. Free memory was 179.6MB in the beginning and 176.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 15:32:01,468 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.18ms. Allocated memory is still 81.8MB. Free memory was 61.2MB in the beginning and 61.2MB in the end (delta: 17.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.18ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 47.8MB in the beginning and 68.2MB in the end (delta: -20.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.44ms. Allocated memory is still 98.6MB. Free memory was 68.2MB in the beginning and 65.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.09ms. Allocated memory is still 98.6MB. Free memory was 65.8MB in the beginning and 64.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 487.62ms. Allocated memory is still 98.6MB. Free memory was 63.7MB in the beginning and 74.9MB in the end (delta: -11.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 9203.83ms. Allocated memory was 98.6MB in the beginning and 285.2MB in the end (delta: 186.6MB). Free memory was 74.7MB in the beginning and 179.6MB in the end (delta: -104.9MB). Peak memory consumption was 182.8MB. Max. memory is 16.1GB. * Witness Printer took 48.12ms. Allocated memory is still 285.2MB. Free memory was 179.6MB in the beginning and 176.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 18 terminating modules (15 trivial, 3 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 -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 12263 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 6.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 13. Automata minimization 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 1389 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3826 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3823 mSDsluCounter, 7046 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2603 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 305 IncrementalHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 4443 mSDtfsCounter, 305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI6 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf190 smp75 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 298]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p_out=0, wb_st=0, NULL=0, processed=0, tmp___3=0, __retres1=0, NULL=1, tmp___2=0, c2_st=0, wl_pc=0, e_wl=2, e_c=2, e_e=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67912e9=0, e_p_in=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5560c826=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65de6043=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53110d08=0, t_b=0, p_in=0, wb_pc=0, data=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d5b2663=0, wb_i=1, tmp___1=0, c_req_up=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, c1_i=1, c2_pc=0, c2_i=1, tmp=0, tmp___0=0, \result=0, r_i=0, d=0, e_f=2, e_g=2, NULL=0, kernel_st=1, r_st=2, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 298]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] kernel_st = 0 [L408] COND FALSE !((int )c_req_up == 1) [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 [L444] COND FALSE !((int )e_f == 0) [L449] COND FALSE !((int )e_g == 0) [L454] COND FALSE !((int )e_e == 0) [L459] COND FALSE !((int )e_c == 0) [L464] COND FALSE !((int )e_wl == 0) [L469] COND FALSE !((int )wl_pc == 1) [L477] COND FALSE !((int )wl_pc == 2) [L487] COND FALSE !((int )c1_pc == 1) [L496] COND FALSE !((int )c2_pc == 1) [L505] COND FALSE !((int )wb_pc == 1) [L514] COND FALSE !((int )e_c == 1) [L519] COND FALSE !((int )e_e == 1) [L524] COND FALSE !((int )e_f == 1) [L529] COND FALSE !((int )e_g == 1) [L534] COND FALSE !((int )e_c == 1) [L539] COND FALSE !((int )e_wl == 1) [L545] COND TRUE 1 [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; Loop: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-23 15:32:01,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)