./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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/toy2.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 a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 16:03:25,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 16:03:25,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 16:03:25,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 16:03:25,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 16:03:25,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 16:03:25,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 16:03:25,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 16:03:25,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 16:03:25,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 16:03:25,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 16:03:25,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 16:03:25,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 16:03:25,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 16:03:25,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 16:03:25,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 16:03:25,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 16:03:25,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 16:03:25,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 16:03:25,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 16:03:25,487 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 16:03:25,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 16:03:25,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 16:03:25,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 16:03:25,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 16:03:25,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 16:03:25,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 16:03:25,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 16:03:25,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 16:03:25,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 16:03:25,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 16:03:25,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 16:03:25,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 16:03:25,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 16:03:25,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 16:03:25,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 16:03:25,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 16:03:25,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 16:03:25,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 16:03:25,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 16:03:25,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 16:03:25,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 16:03:25,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 16:03:25,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 16:03:25,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 16:03:25,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 16:03:25,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 16:03:25,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 16:03:25,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 16:03:25,528 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 16:03:25,528 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 16:03:25,528 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 16:03:25,529 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 16:03:25,529 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 16:03:25,529 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 16:03:25,529 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 16:03:25,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 16:03:25,530 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 16:03:25,530 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 16:03:25,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 16:03:25,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 16:03:25,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 16:03:25,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 16:03:25,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 16:03:25,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 16:03:25,531 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 16:03:25,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 16:03:25,531 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 16:03:25,531 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 16:03:25,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 16:03:25,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 16:03:25,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 16:03:25,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 16:03:25,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 16:03:25,533 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 16:03:25,533 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 -> a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 [2022-07-14 16:03:25,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 16:03:25,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 16:03:25,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 16:03:25,747 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 16:03:25,748 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 16:03:25,749 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2022-07-14 16:03:25,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c76368f/ad5b1216ab4e45829fb3b065382c40ed/FLAG244e0cfb1 [2022-07-14 16:03:26,151 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 16:03:26,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2022-07-14 16:03:26,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c76368f/ad5b1216ab4e45829fb3b065382c40ed/FLAG244e0cfb1 [2022-07-14 16:03:26,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c76368f/ad5b1216ab4e45829fb3b065382c40ed [2022-07-14 16:03:26,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 16:03:26,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 16:03:26,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 16:03:26,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 16:03:26,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 16:03:26,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5e1d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26, skipping insertion in model container [2022-07-14 16:03:26,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 16:03:26,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 16:03:26,719 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/toy2.cil.c[698,711] [2022-07-14 16:03:26,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:03:26,763 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 16:03:26,770 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/toy2.cil.c[698,711] [2022-07-14 16:03:26,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:03:26,801 INFO L208 MainTranslator]: Completed translation [2022-07-14 16:03:26,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26 WrapperNode [2022-07-14 16:03:26,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 16:03:26,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 16:03:26,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 16:03:26,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 16:03:26,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,834 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 356 [2022-07-14 16:03:26,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 16:03:26,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 16:03:26,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 16:03:26,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 16:03:26,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 16:03:26,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 16:03:26,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 16:03:26,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 16:03:26,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26" (1/1) ... [2022-07-14 16:03:26,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:26,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:26,888 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-14 16:03:26,897 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-14 16:03:26,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 16:03:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 16:03:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 16:03:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 16:03:26,967 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 16:03:26,968 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 16:03:27,216 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 16:03:27,222 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 16:03:27,222 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-14 16:03:27,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:03:27 BoogieIcfgContainer [2022-07-14 16:03:27,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 16:03:27,224 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 16:03:27,224 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 16:03:27,226 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 16:03:27,227 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:03:27,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 04:03:26" (1/3) ... [2022-07-14 16:03:27,233 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f4bdfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:03:27, skipping insertion in model container [2022-07-14 16:03:27,233 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:03:27,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:03:26" (2/3) ... [2022-07-14 16:03:27,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f4bdfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:03:27, skipping insertion in model container [2022-07-14 16:03:27,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:03:27,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:03:27" (3/3) ... [2022-07-14 16:03:27,235 INFO L354 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2022-07-14 16:03:27,297 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 16:03:27,297 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 16:03:27,297 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 16:03:27,297 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 16:03:27,298 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 16:03:27,298 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 16:03:27,298 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 16:03:27,298 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 16:03:27,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 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-14 16:03:27,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-14 16:03:27,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:27,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:27,332 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-14 16:03:27,332 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-14 16:03:27,332 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 16:03:27,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 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-14 16:03:27,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-14 16:03:27,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:27,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:27,339 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-14 16:03:27,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-14 16:03:27,351 INFO L752 eck$LassoCheckResult]: Stem: 118#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(11, 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; 46#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; 113#L404true assume !(1 == ~c_req_up~0); 66#L404-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 25#L415-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 55#L420-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 89#L425-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 43#L430-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 125#L435-1true assume !(0 == ~e_f~0); 31#L440-1true assume !(0 == ~e_g~0); 48#L445-1true assume !(0 == ~e_e~0); 51#L450-1true assume !(0 == ~e_c~0); 24#L455-1true assume !(0 == ~e_wl~0); 81#L460-1true assume !(1 == ~wl_pc~0); 38#L472true assume !(2 == ~wl_pc~0); 122#L473true assume !(1 == ~c1_pc~0); 103#L483true assume !(1 == ~c2_pc~0); 114#L492true assume !(1 == ~wb_pc~0); 57#L501true assume !(1 == ~e_c~0); 36#L510-1true assume !(1 == ~e_e~0); 26#L515-1true assume !(1 == ~e_f~0); 15#L520-1true assume !(1 == ~e_g~0); 49#L525-1true assume !(1 == ~e_c~0); 86#L530-1true assume !(1 == ~e_wl~0); 68#L672-1true [2022-07-14 16:03:27,353 INFO L754 eck$LassoCheckResult]: Loop: 68#L672-1true assume !false; 8#L542true 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; 127#L377true assume !true; 23#L393true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 67#L548true assume !(1 == ~c_req_up~0); 11#L548-2true start_simulation_~kernel_st~0#1 := 3; 28#L560true assume 0 == ~e_f~0;~e_f~0 := 1; 97#L560-2true assume 0 == ~e_g~0;~e_g~0 := 1; 19#L565-1true assume 0 == ~e_e~0;~e_e~0 := 1; 128#L570-1true assume 0 == ~e_c~0;~e_c~0 := 1; 39#L575-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 123#L580-1true assume 1 == ~wl_pc~0; 101#L586true assume 1 == ~e_wl~0;~wl_st~0 := 0; 84#L593true assume !(1 == ~c1_pc~0); 115#L603true assume !(1 == ~c2_pc~0); 4#L612true assume !(1 == ~wb_pc~0); 65#L621true assume !(1 == ~e_c~0); 63#L630-1true assume 1 == ~e_e~0;~e_e~0 := 2; 130#L635-1true assume 1 == ~e_f~0;~e_f~0 := 2; 129#L640-1true assume 1 == ~e_g~0;~e_g~0 := 2; 111#L645-1true assume 1 == ~e_c~0;~e_c~0 := 2; 13#L650-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 44#L655-1true assume 0 == ~wl_st~0; 68#L672-1true [2022-07-14 16:03:27,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2022-07-14 16:03:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:27,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141295066] [2022-07-14 16:03:27,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:27,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:27,503 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-14 16:03:27,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:27,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141295066] [2022-07-14 16:03:27,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141295066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:27,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:27,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:27,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470851391] [2022-07-14 16:03:27,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:27,514 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1920133393, now seen corresponding path program 1 times [2022-07-14 16:03:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:27,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425964582] [2022-07-14 16:03:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:27,533 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-14 16:03:27,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:27,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425964582] [2022-07-14 16:03:27,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425964582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:27,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:27,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 16:03:27,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54541640] [2022-07-14 16:03:27,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:27,536 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:27,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:27,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 16:03:27,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 16:03:27,564 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 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-14 16:03:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:27,580 INFO L93 Difference]: Finished difference Result 129 states and 222 transitions. [2022-07-14 16:03:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 16:03:27,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 222 transitions. [2022-07-14 16:03:27,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-14 16:03:27,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 124 states and 217 transitions. [2022-07-14 16:03:27,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-14 16:03:27,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-14 16:03:27,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 217 transitions. [2022-07-14 16:03:27,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:27,596 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2022-07-14 16:03:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 217 transitions. [2022-07-14 16:03:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-14 16:03:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.75) internal successors, (217), 123 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-14 16:03:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 217 transitions. [2022-07-14 16:03:27,619 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2022-07-14 16:03:27,620 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 217 transitions. [2022-07-14 16:03:27,620 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 16:03:27,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 217 transitions. [2022-07-14 16:03:27,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-14 16:03:27,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:27,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:27,624 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-14 16:03:27,624 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-14 16:03:27,624 INFO L752 eck$LassoCheckResult]: Stem: 389#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(11, 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; 346#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; 347#L404 assume !(1 == ~c_req_up~0); 367#L404-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 314#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 315#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 360#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 343#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 344#L435-1 assume !(0 == ~e_f~0); 323#L440-1 assume !(0 == ~e_g~0); 324#L445-1 assume !(0 == ~e_e~0); 350#L450-1 assume !(0 == ~e_c~0); 312#L455-1 assume !(0 == ~e_wl~0); 313#L460-1 assume !(1 == ~wl_pc~0); 332#L472 assume !(2 == ~wl_pc~0); 333#L473 assume !(1 == ~c1_pc~0); 384#L483 assume !(1 == ~c2_pc~0); 298#L492 assume !(1 == ~wb_pc~0); 349#L501 assume !(1 == ~e_c~0); 330#L510-1 assume !(1 == ~e_e~0); 316#L515-1 assume !(1 == ~e_f~0); 295#L520-1 assume !(1 == ~e_g~0); 296#L525-1 assume !(1 == ~e_c~0); 351#L530-1 assume !(1 == ~e_wl~0); 293#L672-1 [2022-07-14 16:03:27,624 INFO L754 eck$LassoCheckResult]: Loop: 293#L672-1 assume !false; 281#L542 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; 269#L377 assume !false; 276#L295 assume !(0 == ~wl_st~0); 278#L299 assume !(0 == ~c1_st~0); 342#L302 assume !(0 == ~c2_st~0); 368#L305 assume !(0 == ~wb_st~0); 288#L308 assume !(0 == ~r_st~0); 289#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 311#L548 assume !(1 == ~c_req_up~0); 286#L548-2 start_simulation_~kernel_st~0#1 := 3; 287#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 319#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 305#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 306#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 338#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 339#L580-1 assume !(1 == ~wl_pc~0); 308#L592 assume !(2 == ~wl_pc~0); 309#L593 assume !(1 == ~c1_pc~0); 359#L603 assume !(1 == ~c2_pc~0); 270#L612 assume !(1 == ~wb_pc~0); 272#L621 assume !(1 == ~e_c~0); 364#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 365#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 391#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 388#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 290#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 291#L655-1 assume 0 == ~wl_st~0; 293#L672-1 [2022-07-14 16:03:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2022-07-14 16:03:27,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:27,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144782451] [2022-07-14 16:03:27,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:27,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:27,665 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-14 16:03:27,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:27,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144782451] [2022-07-14 16:03:27,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144782451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:27,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:27,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:27,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868360243] [2022-07-14 16:03:27,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:27,667 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:27,668 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 1 times [2022-07-14 16:03:27,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:27,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862344423] [2022-07-14 16:03:27,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:27,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:27,690 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-14 16:03:27,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:27,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862344423] [2022-07-14 16:03:27,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862344423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:27,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:27,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:27,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402390684] [2022-07-14 16:03:27,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:27,692 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:27,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:27,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:27,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:27,693 INFO L87 Difference]: Start difference. First operand 124 states and 217 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-14 16:03:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:27,706 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2022-07-14 16:03:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:27,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 216 transitions. [2022-07-14 16:03:27,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-14 16:03:27,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 216 transitions. [2022-07-14 16:03:27,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-14 16:03:27,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-14 16:03:27,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 216 transitions. [2022-07-14 16:03:27,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:27,711 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2022-07-14 16:03:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 216 transitions. [2022-07-14 16:03:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-14 16:03:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 123 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-14 16:03:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 216 transitions. [2022-07-14 16:03:27,716 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2022-07-14 16:03:27,716 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 216 transitions. [2022-07-14 16:03:27,716 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 16:03:27,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 216 transitions. [2022-07-14 16:03:27,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-14 16:03:27,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:27,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:27,718 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-14 16:03:27,718 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-14 16:03:27,718 INFO L752 eck$LassoCheckResult]: Stem: 644#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(11, 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; 601#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; 602#L404 assume !(1 == ~c_req_up~0); 622#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 569#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 570#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 615#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 598#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 599#L435-1 assume !(0 == ~e_f~0); 578#L440-1 assume !(0 == ~e_g~0); 579#L445-1 assume !(0 == ~e_e~0); 605#L450-1 assume !(0 == ~e_c~0); 567#L455-1 assume !(0 == ~e_wl~0); 568#L460-1 assume !(1 == ~wl_pc~0); 587#L472 assume !(2 == ~wl_pc~0); 588#L473 assume !(1 == ~c1_pc~0); 639#L483 assume !(1 == ~c2_pc~0); 553#L492 assume !(1 == ~wb_pc~0); 604#L501 assume !(1 == ~e_c~0); 585#L510-1 assume !(1 == ~e_e~0); 571#L515-1 assume !(1 == ~e_f~0); 550#L520-1 assume !(1 == ~e_g~0); 551#L525-1 assume !(1 == ~e_c~0); 606#L530-1 assume !(1 == ~e_wl~0); 548#L672-1 [2022-07-14 16:03:27,719 INFO L754 eck$LassoCheckResult]: Loop: 548#L672-1 assume !false; 536#L542 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; 524#L377 assume !false; 531#L295 assume !(0 == ~wl_st~0); 533#L299 assume !(0 == ~c1_st~0); 597#L302 assume !(0 == ~c2_st~0); 623#L305 assume !(0 == ~wb_st~0); 543#L308 assume !(0 == ~r_st~0); 544#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 566#L548 assume !(1 == ~c_req_up~0); 541#L548-2 start_simulation_~kernel_st~0#1 := 3; 542#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 574#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 560#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 561#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 593#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 594#L580-1 assume !(1 == ~wl_pc~0); 563#L592 assume !(2 == ~wl_pc~0); 564#L593 assume !(1 == ~c1_pc~0); 614#L603 assume !(1 == ~c2_pc~0); 525#L612 assume !(1 == ~wb_pc~0); 527#L621 assume !(1 == ~e_c~0); 619#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 620#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 646#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 643#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 545#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 546#L655-1 assume 0 == ~wl_st~0; 548#L672-1 [2022-07-14 16:03:27,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:27,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2022-07-14 16:03:27,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:27,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549870239] [2022-07-14 16:03:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:27,744 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-14 16:03:27,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:27,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549870239] [2022-07-14 16:03:27,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549870239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:27,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:27,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:27,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931421186] [2022-07-14 16:03:27,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:27,746 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 2 times [2022-07-14 16:03:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:27,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28240291] [2022-07-14 16:03:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:27,766 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-14 16:03:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:27,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28240291] [2022-07-14 16:03:27,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28240291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:27,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:27,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:27,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508174448] [2022-07-14 16:03:27,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:27,768 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:27,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:27,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:27,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:27,768 INFO L87 Difference]: Start difference. First operand 124 states and 216 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-14 16:03:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:27,779 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2022-07-14 16:03:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:27,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 215 transitions. [2022-07-14 16:03:27,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-14 16:03:27,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 215 transitions. [2022-07-14 16:03:27,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-14 16:03:27,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-14 16:03:27,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 215 transitions. [2022-07-14 16:03:27,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:27,783 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2022-07-14 16:03:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 215 transitions. [2022-07-14 16:03:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-14 16:03:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 123 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 215 transitions. [2022-07-14 16:03:27,787 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2022-07-14 16:03:27,787 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 215 transitions. [2022-07-14 16:03:27,787 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 16:03:27,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 215 transitions. [2022-07-14 16:03:27,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-14 16:03:27,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:27,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:27,789 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-14 16:03:27,789 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-14 16:03:27,789 INFO L752 eck$LassoCheckResult]: Stem: 899#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(11, 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; 856#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; 857#L404 assume !(1 == ~c_req_up~0); 877#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 824#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 825#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 870#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 853#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 854#L435-1 assume !(0 == ~e_f~0); 833#L440-1 assume !(0 == ~e_g~0); 834#L445-1 assume !(0 == ~e_e~0); 860#L450-1 assume !(0 == ~e_c~0); 822#L455-1 assume !(0 == ~e_wl~0); 823#L460-1 assume !(1 == ~wl_pc~0); 842#L472 assume !(2 == ~wl_pc~0); 843#L473 assume !(1 == ~c1_pc~0); 894#L483 assume !(1 == ~c2_pc~0); 808#L492 assume !(1 == ~wb_pc~0); 859#L501 assume !(1 == ~e_c~0); 840#L510-1 assume !(1 == ~e_e~0); 826#L515-1 assume !(1 == ~e_f~0); 805#L520-1 assume !(1 == ~e_g~0); 806#L525-1 assume !(1 == ~e_c~0); 861#L530-1 assume !(1 == ~e_wl~0); 803#L672-1 [2022-07-14 16:03:27,789 INFO L754 eck$LassoCheckResult]: Loop: 803#L672-1 assume !false; 791#L542 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; 779#L377 assume !false; 786#L295 assume !(0 == ~wl_st~0); 788#L299 assume !(0 == ~c1_st~0); 852#L302 assume !(0 == ~c2_st~0); 878#L305 assume !(0 == ~wb_st~0); 798#L308 assume !(0 == ~r_st~0); 799#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 821#L548 assume !(1 == ~c_req_up~0); 796#L548-2 start_simulation_~kernel_st~0#1 := 3; 797#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 829#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 815#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 816#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 848#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 849#L580-1 assume !(1 == ~wl_pc~0); 818#L592 assume !(2 == ~wl_pc~0); 819#L593 assume !(1 == ~c1_pc~0); 869#L603 assume !(1 == ~c2_pc~0); 780#L612 assume !(1 == ~wb_pc~0); 782#L621 assume !(1 == ~e_c~0); 874#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 875#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 901#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 898#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 800#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 801#L655-1 assume 0 == ~wl_st~0; 803#L672-1 [2022-07-14 16:03:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2022-07-14 16:03:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:27,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31408461] [2022-07-14 16:03:27,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:27,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:27,843 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-14 16:03:27,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:27,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31408461] [2022-07-14 16:03:27,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31408461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:27,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:27,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:27,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467830459] [2022-07-14 16:03:27,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:27,847 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:27,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 3 times [2022-07-14 16:03:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:27,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771287987] [2022-07-14 16:03:27,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:27,882 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-14 16:03:27,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:27,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771287987] [2022-07-14 16:03:27,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771287987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:27,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:27,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:27,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508968029] [2022-07-14 16:03:27,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:27,884 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:27,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:27,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:27,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:27,885 INFO L87 Difference]: Start difference. First operand 124 states and 215 transitions. cyclomatic complexity: 92 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-14 16:03:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:27,892 INFO L93 Difference]: Finished difference Result 124 states and 214 transitions. [2022-07-14 16:03:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:27,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 214 transitions. [2022-07-14 16:03:27,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-14 16:03:27,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 214 transitions. [2022-07-14 16:03:27,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-14 16:03:27,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-14 16:03:27,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 214 transitions. [2022-07-14 16:03:27,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:27,896 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2022-07-14 16:03:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 214 transitions. [2022-07-14 16:03:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-14 16:03:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7258064516129032) internal successors, (214), 123 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 214 transitions. [2022-07-14 16:03:27,899 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2022-07-14 16:03:27,900 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 214 transitions. [2022-07-14 16:03:27,900 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 16:03:27,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 214 transitions. [2022-07-14 16:03:27,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-14 16:03:27,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:27,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:27,901 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-14 16:03:27,901 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-14 16:03:27,902 INFO L752 eck$LassoCheckResult]: Stem: 1154#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(11, 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; 1111#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; 1112#L404 assume !(1 == ~c_req_up~0); 1132#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1079#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1080#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1125#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1108#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1109#L435-1 assume !(0 == ~e_f~0); 1088#L440-1 assume !(0 == ~e_g~0); 1089#L445-1 assume !(0 == ~e_e~0); 1115#L450-1 assume !(0 == ~e_c~0); 1077#L455-1 assume !(0 == ~e_wl~0); 1078#L460-1 assume !(1 == ~wl_pc~0); 1097#L472 assume !(2 == ~wl_pc~0); 1098#L473 assume !(1 == ~c1_pc~0); 1149#L483 assume !(1 == ~c2_pc~0); 1063#L492 assume !(1 == ~wb_pc~0); 1114#L501 assume !(1 == ~e_c~0); 1095#L510-1 assume !(1 == ~e_e~0); 1081#L515-1 assume !(1 == ~e_f~0); 1060#L520-1 assume !(1 == ~e_g~0); 1061#L525-1 assume !(1 == ~e_c~0); 1116#L530-1 assume !(1 == ~e_wl~0); 1058#L672-1 [2022-07-14 16:03:27,902 INFO L754 eck$LassoCheckResult]: Loop: 1058#L672-1 assume !false; 1046#L542 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; 1034#L377 assume !false; 1041#L295 assume !(0 == ~wl_st~0); 1043#L299 assume !(0 == ~c1_st~0); 1107#L302 assume !(0 == ~c2_st~0); 1133#L305 assume !(0 == ~wb_st~0); 1053#L308 assume !(0 == ~r_st~0); 1054#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1076#L548 assume !(1 == ~c_req_up~0); 1051#L548-2 start_simulation_~kernel_st~0#1 := 3; 1052#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1084#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1070#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1071#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1103#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1104#L580-1 assume !(1 == ~wl_pc~0); 1073#L592 assume !(2 == ~wl_pc~0); 1074#L593 assume !(1 == ~c1_pc~0); 1124#L603 assume !(1 == ~c2_pc~0); 1035#L612 assume !(1 == ~wb_pc~0); 1037#L621 assume !(1 == ~e_c~0); 1129#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1130#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1156#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1153#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1055#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1056#L655-1 assume 0 == ~wl_st~0; 1058#L672-1 [2022-07-14 16:03:27,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:27,902 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2022-07-14 16:03:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:27,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545776619] [2022-07-14 16:03:27,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:27,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:27,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:27,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:27,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:27,940 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 4 times [2022-07-14 16:03:27,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:27,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580318550] [2022-07-14 16:03:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:27,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:27,956 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-14 16:03:27,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:27,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580318550] [2022-07-14 16:03:27,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580318550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:27,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:27,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:27,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315121461] [2022-07-14 16:03:27,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:27,957 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:27,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:27,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:27,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:27,958 INFO L87 Difference]: Start difference. First operand 124 states and 214 transitions. cyclomatic complexity: 91 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-14 16:03:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:27,980 INFO L93 Difference]: Finished difference Result 156 states and 274 transitions. [2022-07-14 16:03:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:27,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 274 transitions. [2022-07-14 16:03:27,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2022-07-14 16:03:27,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 274 transitions. [2022-07-14 16:03:27,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2022-07-14 16:03:27,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2022-07-14 16:03:27,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 274 transitions. [2022-07-14 16:03:27,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:27,985 INFO L369 hiAutomatonCegarLoop]: Abstraction has 156 states and 274 transitions. [2022-07-14 16:03:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 274 transitions. [2022-07-14 16:03:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-07-14 16:03:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 1.7564102564102564) internal successors, (274), 155 states have internal predecessors, (274), 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-14 16:03:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 274 transitions. [2022-07-14 16:03:27,989 INFO L392 hiAutomatonCegarLoop]: Abstraction has 156 states and 274 transitions. [2022-07-14 16:03:27,989 INFO L374 stractBuchiCegarLoop]: Abstraction has 156 states and 274 transitions. [2022-07-14 16:03:27,989 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 16:03:27,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 274 transitions. [2022-07-14 16:03:27,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2022-07-14 16:03:27,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:27,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:27,991 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-14 16:03:27,991 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-14 16:03:27,992 INFO L752 eck$LassoCheckResult]: Stem: 1441#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(11, 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; 1397#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; 1398#L404 assume !(1 == ~c_req_up~0); 1419#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1365#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1366#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1412#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1394#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1395#L435-1 assume !(0 == ~e_f~0); 1374#L440-1 assume !(0 == ~e_g~0); 1375#L445-1 assume !(0 == ~e_e~0); 1401#L450-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1363#L455-1 assume !(0 == ~e_wl~0); 1364#L460-1 assume !(1 == ~wl_pc~0); 1383#L472 assume !(2 == ~wl_pc~0); 1384#L473 assume !(1 == ~c1_pc~0); 1436#L483 assume !(1 == ~c2_pc~0); 1349#L492 assume !(1 == ~wb_pc~0); 1400#L501 assume 1 == ~e_c~0;~r_st~0 := 0; 1381#L510-1 assume !(1 == ~e_e~0); 1367#L515-1 assume !(1 == ~e_f~0); 1346#L520-1 assume !(1 == ~e_g~0); 1347#L525-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1402#L530-1 assume !(1 == ~e_wl~0); 1344#L672-1 [2022-07-14 16:03:27,992 INFO L754 eck$LassoCheckResult]: Loop: 1344#L672-1 assume !false; 1332#L542 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; 1323#L377 assume !false; 1327#L295 assume !(0 == ~wl_st~0); 1329#L299 assume !(0 == ~c1_st~0); 1393#L302 assume !(0 == ~c2_st~0); 1420#L305 assume !(0 == ~wb_st~0); 1339#L308 assume !(0 == ~r_st~0); 1340#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1362#L548 assume !(1 == ~c_req_up~0); 1337#L548-2 start_simulation_~kernel_st~0#1 := 3; 1338#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1370#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1356#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1357#L570-1 assume !(0 == ~e_c~0); 1443#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1474#L580-1 assume 1 == ~wl_pc~0; 1472#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1469#L593 assume !(1 == ~c1_pc~0); 1468#L603 assume !(1 == ~c2_pc~0); 1466#L612 assume !(1 == ~wb_pc~0); 1464#L621 assume !(1 == ~e_c~0); 1463#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1462#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1444#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1445#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1341#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1342#L655-1 assume 0 == ~wl_st~0; 1344#L672-1 [2022-07-14 16:03:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash 785152729, now seen corresponding path program 1 times [2022-07-14 16:03:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:27,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189193865] [2022-07-14 16:03:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:28,019 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-14 16:03:28,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:28,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189193865] [2022-07-14 16:03:28,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189193865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:28,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:28,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 16:03:28,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171141873] [2022-07-14 16:03:28,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:28,021 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:28,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1473620493, now seen corresponding path program 1 times [2022-07-14 16:03:28,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:28,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822128178] [2022-07-14 16:03:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:28,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:28,037 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-14 16:03:28,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:28,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822128178] [2022-07-14 16:03:28,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822128178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:28,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:28,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:28,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196505413] [2022-07-14 16:03:28,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:28,039 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:28,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:28,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 16:03:28,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 16:03:28,039 INFO L87 Difference]: Start difference. First operand 156 states and 274 transitions. cyclomatic complexity: 119 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-14 16:03:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:28,115 INFO L93 Difference]: Finished difference Result 285 states and 492 transitions. [2022-07-14 16:03:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 16:03:28,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 492 transitions. [2022-07-14 16:03:28,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 199 [2022-07-14 16:03:28,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 492 transitions. [2022-07-14 16:03:28,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2022-07-14 16:03:28,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2022-07-14 16:03:28,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 492 transitions. [2022-07-14 16:03:28,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:28,129 INFO L369 hiAutomatonCegarLoop]: Abstraction has 285 states and 492 transitions. [2022-07-14 16:03:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 492 transitions. [2022-07-14 16:03:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 273. [2022-07-14 16:03:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 273 states have (on average 1.7362637362637363) internal successors, (474), 272 states have internal predecessors, (474), 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-14 16:03:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 474 transitions. [2022-07-14 16:03:28,148 INFO L392 hiAutomatonCegarLoop]: Abstraction has 273 states and 474 transitions. [2022-07-14 16:03:28,148 INFO L374 stractBuchiCegarLoop]: Abstraction has 273 states and 474 transitions. [2022-07-14 16:03:28,148 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 16:03:28,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states and 474 transitions. [2022-07-14 16:03:28,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 199 [2022-07-14 16:03:28,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:28,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:28,152 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-14 16:03:28,153 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-14 16:03:28,153 INFO L752 eck$LassoCheckResult]: Stem: 1909#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(11, 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; 1851#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; 1852#L404 assume !(1 == ~c_req_up~0); 1887#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1819#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1820#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1897#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1898#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1912#L435-1 assume !(0 == ~e_f~0); 1826#L440-1 assume !(0 == ~e_g~0); 1827#L445-1 assume !(0 == ~e_e~0); 1858#L450-1 assume !(0 == ~e_c~0); 1859#L455-1 assume !(0 == ~e_wl~0); 2007#L460-1 assume !(1 == ~wl_pc~0); 2005#L472 assume !(2 == ~wl_pc~0); 2003#L473 assume !(1 == ~c1_pc~0); 1903#L483 assume !(1 == ~c2_pc~0); 1800#L492 assume !(1 == ~wb_pc~0); 1850#L501 assume 1 == ~e_c~0;~r_st~0 := 0; 1833#L510-1 assume !(1 == ~e_e~0); 1816#L515-1 assume !(1 == ~e_f~0); 1797#L520-1 assume !(1 == ~e_g~0); 1798#L525-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1855#L530-1 assume !(1 == ~e_wl~0); 1795#L672-1 [2022-07-14 16:03:28,153 INFO L754 eck$LassoCheckResult]: Loop: 1795#L672-1 assume !false; 1882#L542 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; 1964#L377 assume !false; 1963#L295 assume !(0 == ~wl_st~0); 1962#L299 assume !(0 == ~c1_st~0); 1961#L302 assume !(0 == ~c2_st~0); 1960#L305 assume !(0 == ~wb_st~0); 1958#L308 assume !(0 == ~r_st~0); 1957#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1881#L548 assume !(1 == ~c_req_up~0); 1788#L548-2 start_simulation_~kernel_st~0#1 := 3; 1789#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1953#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1995#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1994#L570-1 assume !(0 == ~e_c~0); 1927#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1993#L580-1 assume 1 == ~wl_pc~0; 1991#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1988#L593 assume !(1 == ~c1_pc~0); 1908#L603 assume !(1 == ~c2_pc~0); 1772#L612 assume !(1 == ~wb_pc~0); 1774#L621 assume !(1 == ~e_c~0); 1874#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1875#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1914#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1922#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1792#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1793#L655-1 assume 0 == ~wl_st~0; 1795#L672-1 [2022-07-14 16:03:28,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash 198346715, now seen corresponding path program 1 times [2022-07-14 16:03:28,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:28,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491788663] [2022-07-14 16:03:28,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:28,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:28,191 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-14 16:03:28,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:28,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491788663] [2022-07-14 16:03:28,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491788663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:28,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:28,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:28,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13986163] [2022-07-14 16:03:28,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:28,193 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:28,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:28,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1473620493, now seen corresponding path program 2 times [2022-07-14 16:03:28,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:28,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762436573] [2022-07-14 16:03:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:28,206 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-14 16:03:28,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:28,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762436573] [2022-07-14 16:03:28,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762436573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:28,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:28,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:28,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948643440] [2022-07-14 16:03:28,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:28,207 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:28,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:28,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:28,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:28,208 INFO L87 Difference]: Start difference. First operand 273 states and 474 transitions. cyclomatic complexity: 203 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-14 16:03:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:28,229 INFO L93 Difference]: Finished difference Result 369 states and 630 transitions. [2022-07-14 16:03:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:28,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 369 states and 630 transitions. [2022-07-14 16:03:28,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 292 [2022-07-14 16:03:28,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 369 states to 369 states and 630 transitions. [2022-07-14 16:03:28,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2022-07-14 16:03:28,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2022-07-14 16:03:28,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 369 states and 630 transitions. [2022-07-14 16:03:28,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:28,234 INFO L369 hiAutomatonCegarLoop]: Abstraction has 369 states and 630 transitions. [2022-07-14 16:03:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states and 630 transitions. [2022-07-14 16:03:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2022-07-14 16:03:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 369 states have (on average 1.7073170731707317) internal successors, (630), 368 states have internal predecessors, (630), 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-14 16:03:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 630 transitions. [2022-07-14 16:03:28,240 INFO L392 hiAutomatonCegarLoop]: Abstraction has 369 states and 630 transitions. [2022-07-14 16:03:28,240 INFO L374 stractBuchiCegarLoop]: Abstraction has 369 states and 630 transitions. [2022-07-14 16:03:28,240 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 16:03:28,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 630 transitions. [2022-07-14 16:03:28,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 292 [2022-07-14 16:03:28,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:28,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:28,243 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-14 16:03:28,243 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-14 16:03:28,243 INFO L752 eck$LassoCheckResult]: Stem: 2562#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(11, 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; 2502#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; 2503#L404 assume !(1 == ~c_req_up~0); 2529#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 2530#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 2518#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 2519#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 2498#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 2499#L435-1 assume !(0 == ~e_f~0); 2477#L440-1 assume !(0 == ~e_g~0); 2478#L445-1 assume !(0 == ~e_e~0); 2511#L450-1 assume !(0 == ~e_c~0); 2464#L455-1 assume !(0 == ~e_wl~0); 2465#L460-1 assume !(1 == ~wl_pc~0); 2487#L472 assume !(2 == ~wl_pc~0); 2488#L473 assume !(1 == ~c1_pc~0); 2556#L483 assume !(1 == ~c2_pc~0); 2450#L492 assume !(1 == ~wb_pc~0); 2505#L501 assume !(1 == ~e_c~0); 2522#L510-1 assume !(1 == ~e_e~0); 2468#L515-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2447#L520-1 assume !(1 == ~e_g~0); 2448#L525-1 assume !(1 == ~e_c~0); 2508#L530-1 assume !(1 == ~e_wl~0); 2728#L672-1 [2022-07-14 16:03:28,243 INFO L754 eck$LassoCheckResult]: Loop: 2728#L672-1 assume !false; 2723#L542 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; 2722#L377 assume !false; 2721#L295 assume !(0 == ~wl_st~0); 2720#L299 assume !(0 == ~c1_st~0); 2719#L302 assume !(0 == ~c2_st~0); 2718#L305 assume !(0 == ~wb_st~0); 2439#L308 assume !(0 == ~r_st~0); 2441#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 2463#L548 assume !(1 == ~c_req_up~0); 2437#L548-2 start_simulation_~kernel_st~0#1 := 3; 2438#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 2553#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2457#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2458#L570-1 assume !(0 == ~e_c~0); 2493#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 2494#L580-1 assume 1 == ~wl_pc~0; 2555#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 2460#L593 assume !(1 == ~c1_pc~0); 2517#L603 assume !(1 == ~c2_pc~0); 2501#L612 assume !(1 == ~wb_pc~0); 2751#L621 assume !(1 == ~e_c~0); 2745#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2743#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2565#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2742#L645-1 assume !(1 == ~e_c~0); 2601#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2739#L655-1 assume 0 == ~wl_st~0; 2728#L672-1 [2022-07-14 16:03:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2022-07-14 16:03:28,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:28,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426522730] [2022-07-14 16:03:28,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:28,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:28,287 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-14 16:03:28,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:28,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426522730] [2022-07-14 16:03:28,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426522730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:28,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:28,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 16:03:28,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211240366] [2022-07-14 16:03:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:28,291 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:28,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:28,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1473618571, now seen corresponding path program 1 times [2022-07-14 16:03:28,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:28,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836243335] [2022-07-14 16:03:28,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:28,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:28,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:28,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:28,527 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:28,532 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:28,532 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:28,532 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:28,532 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 16:03:28,533 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,533 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:28,533 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:28,533 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2022-07-14 16:03:28,533 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:28,536 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:28,548 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-14 16:03:28,556 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-14 16:03:28,558 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-14 16:03:28,561 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-14 16:03:28,562 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-14 16:03:28,564 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-14 16:03:28,566 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-14 16:03:28,569 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-14 16:03:28,571 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-14 16:03:28,573 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-14 16:03:28,574 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-14 16:03:28,576 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-14 16:03:28,578 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-14 16:03:28,580 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-14 16:03:28,581 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-14 16:03:28,584 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-14 16:03:28,586 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-14 16:03:28,588 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-14 16:03:28,591 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-14 16:03:28,592 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-14 16:03:28,594 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-14 16:03:28,595 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-14 16:03:28,599 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-14 16:03:28,601 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-14 16:03:28,602 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-14 16:03:28,605 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-14 16:03:28,771 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:28,772 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 16:03:28,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:28,776 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-14 16:03:28,777 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-14 16:03:28,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:28,779 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:28,792 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:28,793 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-7} Honda state: {~e_c~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:28,810 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-14 16:03:28,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:28,819 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-14 16:03:28,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:28,823 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:28,834 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-14 16:03:28,843 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:28,843 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-14 16:03:28,862 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-14 16:03:28,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:28,864 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-14 16:03:28,865 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-14 16:03:28,867 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:28,867 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:28,891 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:28,891 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-14 16:03:28,906 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-14 16:03:28,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:28,907 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-14 16:03:28,908 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-14 16:03:28,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:28,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:28,926 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:28,926 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:28,960 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-14 16:03:28,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:28,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:28,962 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-14 16:03:28,962 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-14 16:03:28,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:28,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:28,984 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:28,985 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-14 16:03:29,004 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-14 16:03:29,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:29,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:29,005 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-14 16:03:29,011 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-14 16:03:29,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:29,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:29,040 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:29,040 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_req_up~0=4} Honda state: {~c_req_up~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:29,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:29,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:29,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:29,059 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-14 16:03:29,059 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-14 16:03:29,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:29,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:29,081 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-14 16:03:29,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:29,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:29,084 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-14 16:03:29,085 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-14 16:03:29,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 16:03:29,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:29,108 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 16:03:29,125 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-14 16:03:29,126 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:29,126 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:29,126 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:29,126 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:29,126 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:03:29,126 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:29,126 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:29,126 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:29,126 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2022-07-14 16:03:29,126 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:29,126 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:29,127 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-14 16:03:29,139 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-14 16:03:29,141 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-14 16:03:29,143 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-14 16:03:29,145 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-14 16:03:29,147 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-14 16:03:29,150 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-14 16:03:29,152 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-14 16:03:29,153 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-14 16:03:29,155 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-14 16:03:29,156 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-14 16:03:29,158 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-14 16:03:29,160 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-14 16:03:29,161 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-14 16:03:29,164 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-14 16:03:29,166 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-14 16:03:29,168 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-14 16:03:29,170 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-14 16:03:29,173 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-14 16:03:29,175 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-14 16:03:29,177 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-14 16:03:29,178 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-14 16:03:29,182 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-14 16:03:29,184 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-14 16:03:29,185 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-14 16:03:29,189 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-14 16:03:29,337 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:29,340 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:03:29,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:29,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:29,342 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-14 16:03:29,344 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-14 16:03:29,345 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-14 16:03:29,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:29,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:29,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:29,351 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:29,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:29,353 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:29,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:29,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:29,387 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-14 16:03:29,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:29,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:29,388 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-14 16:03:29,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:29,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:29,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:29,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:29,399 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:29,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:29,400 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:29,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:29,404 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-14 16:03:29,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:29,428 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-14 16:03:29,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:29,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:29,430 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-14 16:03:29,430 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-14 16:03:29,432 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-14 16:03:29,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:29,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:29,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:29,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:29,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:29,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:29,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:29,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:29,454 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-14 16:03:29,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:29,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:29,456 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-14 16:03:29,457 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-14 16:03:29,458 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-14 16:03:29,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:29,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:29,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:29,463 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:29,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:29,464 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:29,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:29,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:29,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-14 16:03:29,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:29,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:29,498 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-14 16:03:29,502 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-14 16:03:29,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:29,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:29,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:29,509 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:29,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:29,512 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:29,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:29,515 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-14 16:03:29,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:29,543 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-14 16:03:29,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:29,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:29,545 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-14 16:03:29,554 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-14 16:03:29,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:29,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:29,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:29,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:29,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:29,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:29,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:29,567 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-14 16:03:29,573 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:03:29,576 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 16:03:29,576 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 16:03:29,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:29,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:29,579 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-14 16:03:29,580 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-14 16:03:29,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:03:29,620 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 16:03:29,620 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:03:29,621 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_wl~0) = -1*~e_wl~0 + 1 Supporting invariants [] [2022-07-14 16:03:29,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-14 16:03:29,638 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 16:03:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:29,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:03:29,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:29,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:03:29,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:29,802 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-14 16:03:29,805 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-14 16:03:29,806 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 630 transitions. cyclomatic complexity: 263 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-14 16:03:29,880 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 630 transitions. cyclomatic complexity: 263. 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 1270 states and 2159 transitions. Complement of second has 5 states. [2022-07-14 16:03:29,881 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-14 16:03:29,885 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-14 16:03:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2022-07-14 16:03:29,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2022-07-14 16:03:29,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:29,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2022-07-14 16:03:29,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:29,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2022-07-14 16:03:29,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:29,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1270 states and 2159 transitions. [2022-07-14 16:03:29,898 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 869 [2022-07-14 16:03:29,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1270 states to 1267 states and 2153 transitions. [2022-07-14 16:03:29,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 955 [2022-07-14 16:03:29,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 972 [2022-07-14 16:03:29,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1267 states and 2153 transitions. [2022-07-14 16:03:29,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:29,909 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1267 states and 2153 transitions. [2022-07-14 16:03:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states and 2153 transitions. [2022-07-14 16:03:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 952. [2022-07-14 16:03:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 952 states have (on average 1.7069327731092436) internal successors, (1625), 951 states have internal predecessors, (1625), 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-14 16:03:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1625 transitions. [2022-07-14 16:03:29,925 INFO L392 hiAutomatonCegarLoop]: Abstraction has 952 states and 1625 transitions. [2022-07-14 16:03:29,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:29,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 16:03:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 16:03:29,926 INFO L87 Difference]: Start difference. First operand 952 states and 1625 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-14 16:03:30,023 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-14 16:03:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:30,028 INFO L93 Difference]: Finished difference Result 1170 states and 1981 transitions. [2022-07-14 16:03:30,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 16:03:30,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1170 states and 1981 transitions. [2022-07-14 16:03:30,035 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 691 [2022-07-14 16:03:30,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1170 states to 1170 states and 1981 transitions. [2022-07-14 16:03:30,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 811 [2022-07-14 16:03:30,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 811 [2022-07-14 16:03:30,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1170 states and 1981 transitions. [2022-07-14 16:03:30,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:30,041 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1170 states and 1981 transitions. [2022-07-14 16:03:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states and 1981 transitions. [2022-07-14 16:03:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1149. [2022-07-14 16:03:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1149 states have (on average 1.7049608355091384) internal successors, (1959), 1148 states have internal predecessors, (1959), 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-14 16:03:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1959 transitions. [2022-07-14 16:03:30,057 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1149 states and 1959 transitions. [2022-07-14 16:03:30,057 INFO L374 stractBuchiCegarLoop]: Abstraction has 1149 states and 1959 transitions. [2022-07-14 16:03:30,057 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 16:03:30,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1149 states and 1959 transitions. [2022-07-14 16:03:30,061 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 687 [2022-07-14 16:03:30,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:30,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:30,062 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-14 16:03:30,062 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-14 16:03:30,062 INFO L752 eck$LassoCheckResult]: Stem: 6639#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(11, 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; 6513#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; 6514#L404 assume !(1 == ~c_req_up~0); 6637#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6723#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6722#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6721#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6720#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6647#L435-1 assume !(0 == ~e_f~0); 6465#L440-1 assume !(0 == ~e_g~0); 6466#L445-1 assume !(0 == ~e_e~0); 6517#L450-1 assume !(0 == ~e_c~0); 6523#L455-1 assume !(0 == ~e_wl~0); 6725#L460-1 assume !(1 == ~wl_pc~0); 6487#L472 assume !(2 == ~wl_pc~0); 6488#L473 assume !(1 == ~c1_pc~0); 6620#L483 assume !(1 == ~c2_pc~0); 6419#L492 assume !(1 == ~wb_pc~0); 6516#L501 assume !(1 == ~e_c~0); 6482#L510-1 assume !(1 == ~e_e~0); 6451#L515-1 assume !(1 == ~e_f~0); 6416#L520-1 assume !(1 == ~e_g~0); 6417#L525-1 assume !(1 == ~e_c~0); 6518#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6598#L672-1 [2022-07-14 16:03:30,062 INFO L754 eck$LassoCheckResult]: Loop: 6598#L672-1 assume !false; 7455#L542 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; 7454#L377 assume !false; 7453#L295 assume !(0 == ~wl_st~0); 7452#L299 assume !(0 == ~c1_st~0); 7451#L302 assume !(0 == ~c2_st~0); 7450#L305 assume !(0 == ~wb_st~0); 7219#L308 assume !(0 == ~r_st~0); 7221#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 7199#L548 assume !(1 == ~c_req_up~0); 6397#L548-2 start_simulation_~kernel_st~0#1 := 3; 6398#L560 assume !(0 == ~e_f~0); 6456#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6432#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6433#L570-1 assume !(0 == ~e_c~0); 6496#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6497#L580-1 assume !(1 == ~wl_pc~0); 6438#L592 assume !(2 == ~wl_pc~0); 6439#L593 assume !(1 == ~c1_pc~0); 6534#L603 assume !(1 == ~c2_pc~0); 6361#L612 assume !(1 == ~wb_pc~0); 6363#L621 assume !(1 == ~e_c~0); 7498#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7497#L635-1 assume !(1 == ~e_f~0); 7496#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7495#L645-1 assume !(1 == ~e_c~0); 7494#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7491#L655-1 assume 0 == ~wl_st~0; 6598#L672-1 [2022-07-14 16:03:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,063 INFO L85 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2022-07-14 16:03:30,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280751891] [2022-07-14 16:03:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:30,083 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-14 16:03:30,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:30,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280751891] [2022-07-14 16:03:30,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280751891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:30,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:30,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705585453] [2022-07-14 16:03:30,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:30,084 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1784107586, now seen corresponding path program 1 times [2022-07-14 16:03:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899706740] [2022-07-14 16:03:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:30,095 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-14 16:03:30,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:30,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899706740] [2022-07-14 16:03:30,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899706740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:30,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:30,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 16:03:30,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721805726] [2022-07-14 16:03:30,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:30,097 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:30,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:30,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 16:03:30,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 16:03:30,098 INFO L87 Difference]: Start difference. First operand 1149 states and 1959 transitions. cyclomatic complexity: 816 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-14 16:03:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:30,150 INFO L93 Difference]: Finished difference Result 1915 states and 3215 transitions. [2022-07-14 16:03:30,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 16:03:30,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1915 states and 3215 transitions. [2022-07-14 16:03:30,160 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 979 [2022-07-14 16:03:30,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1915 states to 1915 states and 3215 transitions. [2022-07-14 16:03:30,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1280 [2022-07-14 16:03:30,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1280 [2022-07-14 16:03:30,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1915 states and 3215 transitions. [2022-07-14 16:03:30,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:30,169 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1915 states and 3215 transitions. [2022-07-14 16:03:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states and 3215 transitions. [2022-07-14 16:03:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1427. [2022-07-14 16:03:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1427 states have (on average 1.6937631394533987) internal successors, (2417), 1426 states have internal predecessors, (2417), 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-14 16:03:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2417 transitions. [2022-07-14 16:03:30,190 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1427 states and 2417 transitions. [2022-07-14 16:03:30,190 INFO L374 stractBuchiCegarLoop]: Abstraction has 1427 states and 2417 transitions. [2022-07-14 16:03:30,190 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 16:03:30,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1427 states and 2417 transitions. [2022-07-14 16:03:30,194 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 789 [2022-07-14 16:03:30,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:30,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:30,196 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-14 16:03:30,197 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-14 16:03:30,197 INFO L752 eck$LassoCheckResult]: Stem: 9689#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(11, 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; 9585#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; 9586#L404 assume !(1 == ~c_req_up~0); 9640#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9527#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9528#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9661#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9662#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9692#L435-1 assume !(0 == ~e_f~0); 9693#L440-1 assume !(0 == ~e_g~0); 9702#L445-1 assume !(0 == ~e_e~0); 9596#L450-1 assume !(0 == ~e_c~0); 9520#L455-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 9521#L460-1 assume !(1 == ~wl_pc~0); 9649#L472 assume !(2 == ~wl_pc~0); 10155#L473 assume !(1 == ~c1_pc~0); 10186#L483 assume !(1 == ~c2_pc~0); 10184#L492 assume !(1 == ~wb_pc~0); 10182#L501 assume !(1 == ~e_c~0); 10181#L510-1 assume !(1 == ~e_e~0); 10180#L515-1 assume !(1 == ~e_f~0); 10178#L520-1 assume !(1 == ~e_g~0); 10177#L525-1 assume !(1 == ~e_c~0); 10158#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10159#L672-1 [2022-07-14 16:03:30,197 INFO L754 eck$LassoCheckResult]: Loop: 10159#L672-1 assume !false; 10505#L542 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; 10499#L377 assume !false; 10493#L295 assume !(0 == ~wl_st~0); 10491#L299 assume !(0 == ~c1_st~0); 10489#L302 assume !(0 == ~c2_st~0); 10487#L305 assume !(0 == ~wb_st~0); 10484#L308 assume !(0 == ~r_st~0); 10482#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 10478#L548 assume !(1 == ~c_req_up~0); 10479#L548-2 start_simulation_~kernel_st~0#1 := 3; 10568#L560 assume !(0 == ~e_f~0); 10567#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 10566#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 10565#L570-1 assume !(0 == ~e_c~0); 10563#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10562#L580-1 assume !(1 == ~wl_pc~0); 10560#L592 assume !(2 == ~wl_pc~0); 10555#L593 assume !(1 == ~c1_pc~0); 10554#L603 assume !(1 == ~c2_pc~0); 10552#L612 assume !(1 == ~wb_pc~0); 10550#L621 assume !(1 == ~e_c~0); 10549#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 10544#L635-1 assume !(1 == ~e_f~0); 10542#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10540#L645-1 assume !(1 == ~e_c~0); 10189#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10190#L655-1 assume 0 == ~wl_st~0; 10159#L672-1 [2022-07-14 16:03:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2022-07-14 16:03:30,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794035916] [2022-07-14 16:03:30,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:30,233 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-14 16:03:30,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:30,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794035916] [2022-07-14 16:03:30,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794035916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:30,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:30,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 16:03:30,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083657016] [2022-07-14 16:03:30,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:30,236 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1784107586, now seen corresponding path program 2 times [2022-07-14 16:03:30,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163987925] [2022-07-14 16:03:30,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:30,255 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-14 16:03:30,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:30,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163987925] [2022-07-14 16:03:30,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163987925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:30,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:30,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 16:03:30,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415876735] [2022-07-14 16:03:30,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:30,256 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:30,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:30,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 16:03:30,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 16:03:30,257 INFO L87 Difference]: Start difference. First operand 1427 states and 2417 transitions. cyclomatic complexity: 996 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-14 16:03:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:30,304 INFO L93 Difference]: Finished difference Result 1824 states and 2961 transitions. [2022-07-14 16:03:30,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 16:03:30,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1824 states and 2961 transitions. [2022-07-14 16:03:30,313 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1192 [2022-07-14 16:03:30,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1824 states to 1290 states and 2103 transitions. [2022-07-14 16:03:30,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2022-07-14 16:03:30,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2022-07-14 16:03:30,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 2103 transitions. [2022-07-14 16:03:30,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:30,319 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1290 states and 2103 transitions. [2022-07-14 16:03:30,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 2103 transitions. [2022-07-14 16:03:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1003. [2022-07-14 16:03:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1003 states have (on average 1.6340977068793618) internal successors, (1639), 1002 states have internal predecessors, (1639), 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-14 16:03:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1639 transitions. [2022-07-14 16:03:30,351 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1003 states and 1639 transitions. [2022-07-14 16:03:30,351 INFO L374 stractBuchiCegarLoop]: Abstraction has 1003 states and 1639 transitions. [2022-07-14 16:03:30,351 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-14 16:03:30,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1003 states and 1639 transitions. [2022-07-14 16:03:30,354 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 928 [2022-07-14 16:03:30,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:30,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:30,355 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-14 16:03:30,355 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-14 16:03:30,357 INFO L752 eck$LassoCheckResult]: Stem: 12849#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(11, 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; 12779#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; 12780#L404 assume !(1 == ~c_req_up~0); 12811#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 12812#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 12797#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 12798#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 12776#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 12777#L435-1 assume !(0 == ~e_f~0); 12754#L440-1 assume !(0 == ~e_g~0); 12755#L445-1 assume !(0 == ~e_e~0); 12789#L450-1 assume !(0 == ~e_c~0); 12790#L455-1 assume !(0 == ~e_wl~0); 12881#L460-1 assume !(1 == ~wl_pc~0); 12878#L472 assume !(2 == ~wl_pc~0); 12877#L473 assume !(1 == ~c1_pc~0); 12840#L483 assume !(1 == ~c2_pc~0); 12727#L492 assume !(1 == ~wb_pc~0); 12802#L501 assume !(1 == ~e_c~0); 12803#L510-1 assume !(1 == ~e_e~0); 12873#L515-1 assume !(1 == ~e_f~0); 12872#L520-1 assume !(1 == ~e_g~0); 12785#L525-1 assume !(1 == ~e_c~0); 12786#L530-1 assume !(1 == ~e_wl~0); 13238#L672-1 [2022-07-14 16:03:30,357 INFO L754 eck$LassoCheckResult]: Loop: 13238#L672-1 assume !false; 13239#L542 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; 13230#L377 assume !false; 13231#L295 assume !(0 == ~wl_st~0); 13226#L299 assume !(0 == ~c1_st~0); 13227#L302 assume !(0 == ~c2_st~0); 13219#L305 assume !(0 == ~wb_st~0); 13220#L308 assume !(0 == ~r_st~0); 13334#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 13335#L548 assume !(1 == ~c_req_up~0); 13330#L548-2 start_simulation_~kernel_st~0#1 := 3; 13325#L560 assume !(0 == ~e_f~0); 13326#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 13321#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 13322#L570-1 assume !(0 == ~e_c~0); 13317#L575-1 assume !(0 == ~e_wl~0); 13318#L580-1 assume !(1 == ~wl_pc~0); 13315#L592 assume !(2 == ~wl_pc~0); 13314#L593 assume !(1 == ~c1_pc~0); 13309#L603 assume !(1 == ~c2_pc~0); 13307#L612 assume !(1 == ~wb_pc~0); 13305#L621 assume !(1 == ~e_c~0); 13304#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 13302#L635-1 assume !(1 == ~e_f~0); 13303#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 13481#L645-1 assume !(1 == ~e_c~0); 13479#L650-1 assume !(1 == ~e_wl~0); 13288#L655-1 assume 0 == ~wl_st~0; 13238#L672-1 [2022-07-14 16:03:30,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,357 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2022-07-14 16:03:30,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591259941] [2022-07-14 16:03:30,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,366 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1197301634, now seen corresponding path program 1 times [2022-07-14 16:03:30,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700623274] [2022-07-14 16:03:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:30,397 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-14 16:03:30,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:30,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700623274] [2022-07-14 16:03:30,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700623274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:30,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:30,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 16:03:30,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713303246] [2022-07-14 16:03:30,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:30,398 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:03:30,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:30,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:30,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:30,398 INFO L87 Difference]: Start difference. First operand 1003 states and 1639 transitions. cyclomatic complexity: 640 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:30,418 INFO L93 Difference]: Finished difference Result 1585 states and 2559 transitions. [2022-07-14 16:03:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:30,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1585 states and 2559 transitions. [2022-07-14 16:03:30,426 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1510 [2022-07-14 16:03:30,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1585 states to 1585 states and 2559 transitions. [2022-07-14 16:03:30,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1585 [2022-07-14 16:03:30,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1585 [2022-07-14 16:03:30,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1585 states and 2559 transitions. [2022-07-14 16:03:30,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:03:30,435 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1585 states and 2559 transitions. [2022-07-14 16:03:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states and 2559 transitions. [2022-07-14 16:03:30,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2022-07-14 16:03:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1585 states have (on average 1.6145110410094636) internal successors, (2559), 1584 states have internal predecessors, (2559), 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-14 16:03:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2559 transitions. [2022-07-14 16:03:30,456 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1585 states and 2559 transitions. [2022-07-14 16:03:30,456 INFO L374 stractBuchiCegarLoop]: Abstraction has 1585 states and 2559 transitions. [2022-07-14 16:03:30,456 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-14 16:03:30,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1585 states and 2559 transitions. [2022-07-14 16:03:30,461 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1510 [2022-07-14 16:03:30,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:30,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:30,462 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-14 16:03:30,462 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-14 16:03:30,462 INFO L752 eck$LassoCheckResult]: Stem: 15442#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(11, 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; 15375#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; 15376#L404 assume !(1 == ~c_req_up~0); 15402#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 15338#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 15339#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 15392#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 15372#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 15373#L435-1 assume !(0 == ~e_f~0); 15350#L440-1 assume !(0 == ~e_g~0); 15351#L445-1 assume !(0 == ~e_e~0); 15379#L450-1 assume !(0 == ~e_c~0); 15384#L455-1 assume !(0 == ~e_wl~0); 15477#L460-1 assume !(1 == ~wl_pc~0); 15474#L472 assume !(2 == ~wl_pc~0); 15473#L473 assume !(1 == ~c1_pc~0); 15471#L483 assume !(1 == ~c2_pc~0); 15466#L492 assume !(1 == ~wb_pc~0); 15395#L501 assume !(1 == ~e_c~0); 15358#L510-1 assume !(1 == ~e_e~0); 15359#L515-1 assume !(1 == ~e_f~0); 15464#L520-1 assume !(1 == ~e_g~0); 15380#L525-1 assume !(1 == ~e_c~0); 15381#L530-1 assume !(1 == ~e_wl~0); 16050#L672-1 [2022-07-14 16:03:30,463 INFO L754 eck$LassoCheckResult]: Loop: 16050#L672-1 assume !false; 15983#L542 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; 15982#L377 assume !false; 15963#L295 assume !(0 == ~wl_st~0); 15964#L299 assume !(0 == ~c1_st~0); 16404#L302 assume !(0 == ~c2_st~0); 16401#L305 assume !(0 == ~wb_st~0); 16402#L308 assume !(0 == ~r_st~0); 16403#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 16466#L548 assume !(1 == ~c_req_up~0); 16463#L548-2 start_simulation_~kernel_st~0#1 := 3; 16461#L560 assume !(0 == ~e_f~0); 16460#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 16459#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 16458#L570-1 assume !(0 == ~e_c~0); 16457#L575-1 assume !(0 == ~e_wl~0); 16456#L580-1 assume !(1 == ~wl_pc~0); 16454#L592 assume 2 == ~wl_pc~0; 16452#L594 assume 1 == ~e_e~0;~wl_st~0 := 0; 16453#L593 assume !(1 == ~c1_pc~0); 16482#L603 assume !(1 == ~c2_pc~0); 16447#L612 assume !(1 == ~wb_pc~0); 16443#L621 assume !(1 == ~e_c~0); 16441#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 16439#L635-1 assume !(1 == ~e_f~0); 16437#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 16435#L645-1 assume !(1 == ~e_c~0); 16433#L650-1 assume !(1 == ~e_wl~0); 16430#L655-1 assume 0 == ~wl_st~0; 16050#L672-1 [2022-07-14 16:03:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 3 times [2022-07-14 16:03:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281647863] [2022-07-14 16:03:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,468 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:30,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,475 INFO L85 PathProgramCache]: Analyzing trace with hash -869781309, now seen corresponding path program 1 times [2022-07-14 16:03:30,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302847988] [2022-07-14 16:03:30,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,479 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:30,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:30,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash 44318509, now seen corresponding path program 1 times [2022-07-14 16:03:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:30,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432928394] [2022-07-14 16:03:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:30,499 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-14 16:03:30,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:30,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432928394] [2022-07-14 16:03:30,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432928394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:30,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:30,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:30,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716897931] [2022-07-14 16:03:30,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:30,633 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:30,633 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:30,633 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:30,633 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:30,633 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 16:03:30,633 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:30,633 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:30,633 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:30,633 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration12_Loop [2022-07-14 16:03:30,634 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:30,634 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:30,640 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-14 16:03:30,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-14 16:03:30,645 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-14 16:03:30,647 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-14 16:03:30,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-14 16:03:30,650 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-14 16:03:30,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-14 16:03:30,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-14 16:03:30,654 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-14 16:03:30,655 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-14 16:03:30,657 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-14 16:03:30,658 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-14 16:03:30,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-14 16:03:30,665 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-14 16:03:30,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-14 16:03:30,669 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-14 16:03:30,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-14 16:03:30,673 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-14 16:03:30,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-14 16:03:30,678 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-14 16:03:30,681 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-14 16:03:30,682 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-14 16:03:30,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-14 16:03:30,685 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-14 16:03:30,686 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-14 16:03:30,687 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-14 16:03:30,860 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:30,860 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 16:03:30,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:30,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:30,865 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-14 16:03:30,867 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-14 16:03:30,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:30,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:30,889 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:30,889 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-14 16:03:30,907 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-14 16:03:30,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:30,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:30,908 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-14 16:03:30,910 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-14 16:03:30,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:30,911 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:30,932 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:30,932 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-7} Honda state: {~e_c~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:30,951 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-14 16:03:30,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:30,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:30,953 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-14 16:03:30,955 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-14 16:03:30,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:30,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:30,978 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:30,978 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-14 16:03:30,996 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-14 16:03:30,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:30,997 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-14 16:03:31,004 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:31,004 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:31,013 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-14 16:03:31,022 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:31,022 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-14 16:03:31,039 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-14 16:03:31,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,041 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-14 16:03:31,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:31,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:31,057 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-14 16:03:31,064 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:31,065 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-14 16:03:31,083 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-14 16:03:31,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,084 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-14 16:03:31,085 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-14 16:03:31,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:31,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:31,103 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:31,103 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-14 16:03:31,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-14 16:03:31,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,119 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-14 16:03:31,120 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-14 16:03:31,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:31,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:31,127 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:31,127 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:31,144 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-14 16:03:31,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,145 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-14 16:03:31,146 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-14 16:03:31,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:31,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:31,156 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:31,156 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet5#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:31,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-14 16:03:31,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,172 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-14 16:03:31,172 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-14 16:03:31,174 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:31,174 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:31,191 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:31,191 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-14 16:03:31,207 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-14 16:03:31,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,208 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-14 16:03:31,209 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-14 16:03:31,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:31,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:31,231 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:31,231 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=-1} Honda state: {~wb_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:31,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:31,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,250 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-14 16:03:31,251 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-14 16:03:31,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:31,252 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:31,278 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:31,278 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:31,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-14 16:03:31,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,295 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-14 16:03:31,295 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-14 16:03:31,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:31,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:31,309 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:31,309 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_pc~0=4} Honda state: {~wb_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:31,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-14 16:03:31,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,326 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-14 16:03:31,327 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-14 16:03:31,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:31,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:31,364 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-14 16:03:31,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,365 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-14 16:03:31,366 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-14 16:03:31,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 16:03:31,367 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:31,405 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 16:03:31,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:31,409 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:31,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:31,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:31,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:31,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:03:31,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:31,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:31,409 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration12_Loop [2022-07-14 16:03:31,409 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:31,409 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:31,410 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-14 16:03:31,412 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-14 16:03:31,415 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-14 16:03:31,417 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-14 16:03:31,419 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-14 16:03:31,420 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-14 16:03:31,422 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-14 16:03:31,423 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-14 16:03:31,426 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-14 16:03:31,428 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-14 16:03:31,429 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-14 16:03:31,431 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-14 16:03:31,432 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-14 16:03:31,435 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-14 16:03:31,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-14 16:03:31,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-14 16:03:31,443 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-14 16:03:31,445 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-14 16:03:31,449 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-14 16:03:31,452 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-14 16:03:31,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-14 16:03:31,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-14 16:03:31,457 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-14 16:03:31,458 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-14 16:03:31,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-14 16:03:31,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-14 16:03:31,614 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:31,614 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:03:31,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,616 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-14 16:03:31,617 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-14 16:03:31,618 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-14 16:03:31,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:31,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:31,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:31,624 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:31,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:31,625 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:31,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:31,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:31,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-14 16:03:31,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,643 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-14 16:03:31,651 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-14 16:03:31,651 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-14 16:03:31,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:31,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:31,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:31,657 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:31,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:31,658 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:31,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:31,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:31,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-14 16:03:31,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,685 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:31,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-14 16:03:31,687 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-14 16:03:31,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:31,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:31,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:31,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:31,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:31,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:31,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:31,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:31,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:31,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,711 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:31,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-14 16:03:31,713 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-14 16:03:31,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:31,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:31,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:31,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:31,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:31,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:31,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:31,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:31,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:31,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,739 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:31,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-14 16:03:31,741 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-14 16:03:31,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:31,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:31,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:31,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:31,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:31,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:31,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:31,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:31,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:31,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,768 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:31,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-14 16:03:31,770 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-14 16:03:31,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:31,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:31,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:31,776 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:31,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:31,777 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:31,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:31,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:31,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-14 16:03:31,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,795 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:31,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-14 16:03:31,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:31,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:31,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:31,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:31,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:31,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:31,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:31,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:31,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:31,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-14 16:03:31,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,855 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:31,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-14 16:03:31,859 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-14 16:03:31,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:31,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:31,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:31,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:31,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:31,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:31,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:31,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:31,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-14 16:03:31,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,885 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:31,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-14 16:03:31,887 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-14 16:03:31,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:31,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:31,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:31,893 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:31,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:31,904 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:31,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:31,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:31,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-14 16:03:31,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,950 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:31,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-14 16:03:31,953 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-14 16:03:31,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:31,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:31,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:31,961 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:31,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:31,962 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:31,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:31,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:31,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-14 16:03:31,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:31,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:31,990 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:31,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-14 16:03:31,992 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-14 16:03:31,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:31,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:31,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:31,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:31,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:31,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:31,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:32,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:32,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:32,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:32,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:32,026 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:32,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-14 16:03:32,044 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-14 16:03:32,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:32,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:32,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:32,050 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:32,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:32,051 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:32,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:32,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:32,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-14 16:03:32,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:32,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:32,071 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:32,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-14 16:03:32,073 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-14 16:03:32,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:32,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:32,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:32,079 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:32,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:32,080 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:32,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:32,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:32,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:32,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:32,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:32,099 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:32,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-14 16:03:32,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:32,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:32,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:32,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:32,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:32,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:32,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:32,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:32,124 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:03:32,126 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 16:03:32,126 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 16:03:32,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:32,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:32,160 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:32,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-14 16:03:32,167 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:03:32,167 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 16:03:32,167 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:03:32,167 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_g~0) = -1*~e_g~0 + 1 Supporting invariants [] [2022-07-14 16:03:32,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-14 16:03:32,183 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 16:03:32,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:32,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:03:32,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:32,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:03:32,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:32,318 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-14 16:03:32,319 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-14 16:03:32,319 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1585 states and 2559 transitions. cyclomatic complexity: 978 Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-14 16:03:32,363 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1585 states and 2559 transitions. cyclomatic complexity: 978. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 4473 states and 7197 transitions. Complement of second has 5 states. [2022-07-14 16:03:32,363 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-14 16:03:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-14 16:03:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2022-07-14 16:03:32,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 24 letters. Loop has 29 letters. [2022-07-14 16:03:32,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:32,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 53 letters. Loop has 29 letters. [2022-07-14 16:03:32,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:32,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 24 letters. Loop has 58 letters. [2022-07-14 16:03:32,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:32,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4473 states and 7197 transitions. [2022-07-14 16:03:32,386 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2912 [2022-07-14 16:03:32,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4473 states to 4473 states and 7197 transitions. [2022-07-14 16:03:32,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2990 [2022-07-14 16:03:32,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3029 [2022-07-14 16:03:32,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4473 states and 7197 transitions. [2022-07-14 16:03:32,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:32,407 INFO L369 hiAutomatonCegarLoop]: Abstraction has 4473 states and 7197 transitions. [2022-07-14 16:03:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states and 7197 transitions. [2022-07-14 16:03:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4434. [2022-07-14 16:03:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4434 states, 4434 states have (on average 1.6118628777627424) internal successors, (7147), 4433 states have internal predecessors, (7147), 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-14 16:03:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4434 states to 4434 states and 7147 transitions. [2022-07-14 16:03:32,471 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4434 states and 7147 transitions. [2022-07-14 16:03:32,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:32,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:32,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:32,472 INFO L87 Difference]: Start difference. First operand 4434 states and 7147 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-14 16:03:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:32,497 INFO L93 Difference]: Finished difference Result 3528 states and 5680 transitions. [2022-07-14 16:03:32,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:32,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3528 states and 5680 transitions. [2022-07-14 16:03:32,510 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2306 [2022-07-14 16:03:32,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3528 states to 3528 states and 5680 transitions. [2022-07-14 16:03:32,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2387 [2022-07-14 16:03:32,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2387 [2022-07-14 16:03:32,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3528 states and 5680 transitions. [2022-07-14 16:03:32,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:32,526 INFO L369 hiAutomatonCegarLoop]: Abstraction has 3528 states and 5680 transitions. [2022-07-14 16:03:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states and 5680 transitions. [2022-07-14 16:03:32,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3180. [2022-07-14 16:03:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3180 states, 3180 states have (on average 1.6182389937106918) internal successors, (5146), 3179 states have internal predecessors, (5146), 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-14 16:03:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 5146 transitions. [2022-07-14 16:03:32,605 INFO L392 hiAutomatonCegarLoop]: Abstraction has 3180 states and 5146 transitions. [2022-07-14 16:03:32,605 INFO L374 stractBuchiCegarLoop]: Abstraction has 3180 states and 5146 transitions. [2022-07-14 16:03:32,605 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-14 16:03:32,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3180 states and 5146 transitions. [2022-07-14 16:03:32,611 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2072 [2022-07-14 16:03:32,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:32,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:32,612 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-14 16:03:32,612 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:32,612 INFO L752 eck$LassoCheckResult]: Stem: 29766#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(11, 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; 29640#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; 29641#L404 assume !(1 == ~c_req_up~0); 29763#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 29801#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 29800#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 29799#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 29633#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 29634#L435-1 assume !(0 == ~e_f~0); 29594#L440-1 assume !(0 == ~e_g~0); 29595#L445-1 assume !(0 == ~e_e~0); 29651#L450-1 assume !(0 == ~e_c~0); 29652#L455-1 assume !(0 == ~e_wl~0); 29716#L460-1 assume !(1 == ~wl_pc~0); 29609#L472 assume !(2 == ~wl_pc~0); 29610#L473 assume !(1 == ~c1_pc~0); 29771#L483 assume !(1 == ~c2_pc~0); 29764#L492 assume !(1 == ~wb_pc~0); 29643#L501 assume !(1 == ~e_c~0); 29786#L510-1 assume !(1 == ~e_e~0); 29787#L515-1 assume !(1 == ~e_f~0); 29547#L520-1 assume !(1 == ~e_g~0); 29548#L525-1 assume !(1 == ~e_c~0); 29646#L530-1 assume !(1 == ~e_wl~0); 29726#L672-1 assume !false; 30692#L542 [2022-07-14 16:03:32,612 INFO L754 eck$LassoCheckResult]: Loop: 30692#L542 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; 32094#L377 assume !false; 32091#L295 assume 0 == ~wl_st~0; 32089#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 32033#L321 assume 0 != eval_~tmp~0#1;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0#1;havoc write_loop_~t~0#1; 29622#L66 assume 0 == ~wl_pc~0; 29623#L79 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 29673#L127 assume { :end_inline_write_loop } true; 31701#L317 assume !(0 == ~c1_st~0); 31696#L332 assume !(0 == ~c2_st~0); 31703#L347 assume !(0 == ~wb_st~0); 32003#L362 assume !(0 == ~r_st~0); 32000#L377 assume !false; 31999#L295 assume !(0 == ~wl_st~0); 31997#L299 assume !(0 == ~c1_st~0); 31998#L302 assume !(0 == ~c2_st~0); 31994#L305 assume !(0 == ~wb_st~0); 31995#L308 assume !(0 == ~r_st~0); 31996#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 31128#L548 assume !(1 == ~c_req_up~0); 31129#L548-2 start_simulation_~kernel_st~0#1 := 3; 32345#L560 assume !(0 == ~e_f~0); 32343#L560-2 assume !(0 == ~e_g~0); 32342#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 32341#L570-1 assume !(0 == ~e_c~0); 32300#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 32298#L580-1 assume 1 == ~wl_pc~0; 32299#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 32296#L593 assume !(1 == ~c1_pc~0); 32392#L603 assume !(1 == ~c2_pc~0); 32390#L612 assume !(1 == ~wb_pc~0); 32386#L621 assume !(1 == ~e_c~0); 32381#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 32379#L635-1 assume !(1 == ~e_f~0); 32377#L640-1 assume !(1 == ~e_g~0); 32353#L645-1 assume !(1 == ~e_c~0); 32321#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 32319#L655-1 assume 0 == ~wl_st~0; 32301#L672-1 assume !false; 30692#L542 [2022-07-14 16:03:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2022-07-14 16:03:32,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:32,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498809036] [2022-07-14 16:03:32,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:32,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:32,617 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:32,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1995227012, now seen corresponding path program 1 times [2022-07-14 16:03:32,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:32,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121940375] [2022-07-14 16:03:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:32,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:32,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:32,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1594093335, now seen corresponding path program 1 times [2022-07-14 16:03:32,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:32,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088646108] [2022-07-14 16:03:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:32,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:03:32,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:32,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088646108] [2022-07-14 16:03:32,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088646108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:32,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:32,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:32,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069600913] [2022-07-14 16:03:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:32,814 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:32,815 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:32,815 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:32,815 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:32,815 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 16:03:32,815 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:32,815 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:32,815 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:32,815 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration13_Loop [2022-07-14 16:03:32,815 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:32,815 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:32,816 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-14 16:03:32,820 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-14 16:03:32,822 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-14 16:03:32,823 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-14 16:03:32,827 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-14 16:03:32,828 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-14 16:03:32,831 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-14 16:03:32,833 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-14 16:03:32,834 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-14 16:03:32,837 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-14 16:03:32,838 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-14 16:03:32,840 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-14 16:03:32,843 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-14 16:03:32,845 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-14 16:03:32,846 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-14 16:03:32,847 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-14 16:03:32,848 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-14 16:03:32,850 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-14 16:03:32,851 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-14 16:03:32,853 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-14 16:03:32,854 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-14 16:03:32,857 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-14 16:03:32,859 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-14 16:03:32,860 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-14 16:03:32,867 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-14 16:03:32,869 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-14 16:03:32,870 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-14 16:03:33,000 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:33,000 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 16:03:33,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:33,004 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:33,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-14 16:03:33,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:33,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:33,027 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:33,027 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-7} Honda state: {~e_c~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:03:33,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:33,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:33,044 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:33,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-14 16:03:33,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:33,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:33,071 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:33,071 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-14 16:03:33,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:33,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:33,089 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:33,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-14 16:03:33,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:33,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:33,105 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:03:33,105 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-14 16:03:33,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:33,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:33,122 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:33,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-14 16:03:33,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:03:33,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:33,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:33,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:33,147 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:33,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-14 16:03:33,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 16:03:33,149 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:03:33,156 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 16:03:33,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-14 16:03:33,171 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:03:33,171 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:03:33,171 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:03:33,171 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:03:33,171 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:03:33,171 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,171 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:03:33,171 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:03:33,171 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration13_Loop [2022-07-14 16:03:33,171 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:03:33,171 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:03:33,172 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-14 16:03:33,175 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-14 16:03:33,181 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-14 16:03:33,183 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-14 16:03:33,184 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-14 16:03:33,188 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-14 16:03:33,209 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-14 16:03:33,212 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-14 16:03:33,214 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-14 16:03:33,215 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-14 16:03:33,218 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-14 16:03:33,219 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-14 16:03:33,221 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-14 16:03:33,224 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-14 16:03:33,226 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-14 16:03:33,227 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-14 16:03:33,228 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-14 16:03:33,230 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-14 16:03:33,231 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-14 16:03:33,232 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-14 16:03:33,234 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-14 16:03:33,236 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-14 16:03:33,239 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-14 16:03:33,241 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-14 16:03:33,243 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-14 16:03:33,245 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-14 16:03:33,246 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-14 16:03:33,406 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:03:33,406 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:03:33,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:33,408 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:33,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-14 16:03:33,410 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-14 16:03:33,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:33,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:33,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:33,416 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:33,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:33,417 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:33,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:33,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:33,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-14 16:03:33,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:33,434 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:33,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-14 16:03:33,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-14 16:03:33,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:33,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:33,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:33,442 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:03:33,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:33,442 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:03:33,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:33,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:33,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-14 16:03:33,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:33,460 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:33,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-14 16:03:33,462 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-14 16:03:33,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:33,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:33,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:33,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:33,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:33,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:33,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:33,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:33,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-14 16:03:33,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:33,494 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:33,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-14 16:03:33,496 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-14 16:03:33,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:33,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:33,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:33,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:33,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:33,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:33,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:33,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:03:33,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-14 16:03:33,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:33,519 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:33,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-14 16:03:33,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:03:33,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:03:33,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:03:33,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:03:33,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:03:33,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:03:33,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:03:33,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:03:33,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:03:33,552 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 16:03:33,552 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 16:03:33,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:03:33,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:03:33,553 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:03:33,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-14 16:03:33,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:03:33,555 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 16:03:33,555 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:03:33,555 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2022-07-14 16:03:33,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-14 16:03:33,571 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 16:03:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:33,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:03:33,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:33,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:03:33,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:03:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 16:03:33,717 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-14 16:03:33,718 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3180 states and 5146 transitions. cyclomatic complexity: 1972 Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:33,762 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3180 states and 5146 transitions. cyclomatic complexity: 1972. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8425 states and 13698 transitions. Complement of second has 5 states. [2022-07-14 16:03:33,762 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-14 16:03:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:03:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2022-07-14 16:03:33,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 202 transitions. Stem has 25 letters. Loop has 39 letters. [2022-07-14 16:03:33,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:33,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 202 transitions. Stem has 64 letters. Loop has 39 letters. [2022-07-14 16:03:33,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:33,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 202 transitions. Stem has 25 letters. Loop has 78 letters. [2022-07-14 16:03:33,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:03:33,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8425 states and 13698 transitions. [2022-07-14 16:03:33,792 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 3740 [2022-07-14 16:03:33,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8425 states to 8425 states and 13698 transitions. [2022-07-14 16:03:33,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3861 [2022-07-14 16:03:33,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3924 [2022-07-14 16:03:33,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8425 states and 13698 transitions. [2022-07-14 16:03:33,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:33,846 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8425 states and 13698 transitions. [2022-07-14 16:03:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8425 states and 13698 transitions. [2022-07-14 16:03:33,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-14 16:03:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8425 to 8362. [2022-07-14 16:03:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8362 states, 8362 states have (on average 1.6270031093039943) internal successors, (13605), 8361 states have internal predecessors, (13605), 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-14 16:03:33,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 13605 transitions. [2022-07-14 16:03:33,949 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8362 states and 13605 transitions. [2022-07-14 16:03:33,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:33,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:33,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:33,949 INFO L87 Difference]: Start difference. First operand 8362 states and 13605 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-14 16:03:34,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:34,031 INFO L93 Difference]: Finished difference Result 13026 states and 20958 transitions. [2022-07-14 16:03:34,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:34,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13026 states and 20958 transitions. [2022-07-14 16:03:34,069 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 5899 [2022-07-14 16:03:34,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13026 states to 13026 states and 20958 transitions. [2022-07-14 16:03:34,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6028 [2022-07-14 16:03:34,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6028 [2022-07-14 16:03:34,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13026 states and 20958 transitions. [2022-07-14 16:03:34,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:34,112 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13026 states and 20958 transitions. [2022-07-14 16:03:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13026 states and 20958 transitions. [2022-07-14 16:03:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13026 to 13026. [2022-07-14 16:03:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13026 states, 13026 states have (on average 1.6089359742054352) internal successors, (20958), 13025 states have internal predecessors, (20958), 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-14 16:03:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13026 states to 13026 states and 20958 transitions. [2022-07-14 16:03:34,307 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13026 states and 20958 transitions. [2022-07-14 16:03:34,308 INFO L374 stractBuchiCegarLoop]: Abstraction has 13026 states and 20958 transitions. [2022-07-14 16:03:34,308 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-14 16:03:34,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13026 states and 20958 transitions. [2022-07-14 16:03:34,376 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 5899 [2022-07-14 16:03:34,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:34,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:34,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-14 16:03:34,377 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:34,377 INFO L752 eck$LassoCheckResult]: Stem: 62993#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(11, 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; 62856#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; 62857#L404 assume !(1 == ~c_req_up~0); 62921#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 62792#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 62793#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 62956#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 62957#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 63003#L435-1 assume !(0 == ~e_f~0); 63004#L440-1 assume !(0 == ~e_g~0); 62860#L445-1 assume !(0 == ~e_e~0); 62861#L450-1 assume !(0 == ~e_c~0); 62790#L455-1 assume !(0 == ~e_wl~0); 62791#L460-1 assume !(1 == ~wl_pc~0); 63034#L472 assume !(2 == ~wl_pc~0); 62997#L473 assume !(1 == ~c1_pc~0); 62972#L483 assume !(1 == ~c2_pc~0); 62760#L492 assume !(1 == ~wb_pc~0); 62859#L501 assume !(1 == ~e_c~0); 62889#L510-1 assume !(1 == ~e_e~0); 63017#L515-1 assume !(1 == ~e_f~0); 62757#L520-1 assume !(1 == ~e_g~0); 62758#L525-1 assume !(1 == ~e_c~0); 62862#L530-1 assume !(1 == ~e_wl~0); 64804#L672-1 assume !false; 64805#L542 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; 71626#L377 [2022-07-14 16:03:34,377 INFO L754 eck$LassoCheckResult]: Loop: 71626#L377 assume !false; 71623#L295 assume 0 == ~wl_st~0; 71620#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 71614#L321 assume !(0 != eval_~tmp~0#1); 71613#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 71345#L336 assume !(0 != eval_~tmp___0~0#1); 71610#L332 assume !(0 == ~c2_st~0); 73069#L347 assume !(0 == ~wb_st~0); 71633#L362 assume !(0 == ~r_st~0); 71626#L377 [2022-07-14 16:03:34,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2022-07-14 16:03:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:34,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200274454] [2022-07-14 16:03:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:34,383 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:34,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:34,393 INFO L85 PathProgramCache]: Analyzing trace with hash 910089250, now seen corresponding path program 1 times [2022-07-14 16:03:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:34,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76505464] [2022-07-14 16:03:34,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:34,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:34,396 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:34,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1807696598, now seen corresponding path program 1 times [2022-07-14 16:03:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:34,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592330604] [2022-07-14 16:03:34,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:34,417 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-14 16:03:34,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:34,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592330604] [2022-07-14 16:03:34,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592330604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:34,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:34,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:34,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983475124] [2022-07-14 16:03:34,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:34,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:34,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:34,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:34,448 INFO L87 Difference]: Start difference. First operand 13026 states and 20958 transitions. cyclomatic complexity: 7950 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-14 16:03:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:34,518 INFO L93 Difference]: Finished difference Result 20176 states and 31971 transitions. [2022-07-14 16:03:34,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:34,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20176 states and 31971 transitions. [2022-07-14 16:03:34,611 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-14 16:03:34,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20176 states to 20176 states and 31971 transitions. [2022-07-14 16:03:34,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9426 [2022-07-14 16:03:34,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9426 [2022-07-14 16:03:34,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20176 states and 31971 transitions. [2022-07-14 16:03:34,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:34,714 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20176 states and 31971 transitions. [2022-07-14 16:03:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20176 states and 31971 transitions. [2022-07-14 16:03:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20176 to 20176. [2022-07-14 16:03:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20176 states, 20176 states have (on average 1.5846054718477398) internal successors, (31971), 20175 states have internal predecessors, (31971), 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-14 16:03:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20176 states to 20176 states and 31971 transitions. [2022-07-14 16:03:35,058 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20176 states and 31971 transitions. [2022-07-14 16:03:35,059 INFO L374 stractBuchiCegarLoop]: Abstraction has 20176 states and 31971 transitions. [2022-07-14 16:03:35,059 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-14 16:03:35,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20176 states and 31971 transitions. [2022-07-14 16:03:35,173 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-14 16:03:35,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:35,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:35,177 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-14 16:03:35,177 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:35,178 INFO L752 eck$LassoCheckResult]: Stem: 96218#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(11, 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; 96066#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; 96067#L404 assume !(1 == ~c_req_up~0); 96130#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 96000#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 96001#L420-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 96280#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 98656#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 98655#L435-1 assume !(0 == ~e_f~0); 98654#L440-1 assume !(0 == ~e_g~0); 98653#L445-1 assume !(0 == ~e_e~0); 98652#L450-1 assume !(0 == ~e_c~0); 98651#L455-1 assume !(0 == ~e_wl~0); 98650#L460-1 assume !(1 == ~wl_pc~0); 98647#L472 assume !(2 == ~wl_pc~0); 98646#L473 assume !(1 == ~c1_pc~0); 98643#L483 assume !(1 == ~c2_pc~0); 96209#L492 assume !(1 == ~wb_pc~0); 96069#L501 assume !(1 == ~e_c~0); 96250#L510-1 assume !(1 == ~e_e~0); 96247#L515-1 assume !(1 == ~e_f~0); 95965#L520-1 assume !(1 == ~e_g~0); 95966#L525-1 assume !(1 == ~e_c~0); 96072#L530-1 assume !(1 == ~e_wl~0); 98634#L672-1 assume !false; 98635#L542 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; 108486#L377 [2022-07-14 16:03:35,178 INFO L754 eck$LassoCheckResult]: Loop: 108486#L377 assume !false; 108483#L295 assume 0 == ~wl_st~0; 108478#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 108475#L321 assume !(0 != eval_~tmp~0#1); 108473#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 108461#L336 assume !(0 != eval_~tmp___0~0#1); 108472#L332 assume !(0 == ~c2_st~0); 109228#L347 assume !(0 == ~wb_st~0); 108491#L362 assume !(0 == ~r_st~0); 108486#L377 [2022-07-14 16:03:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2022-07-14 16:03:35,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:35,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127708297] [2022-07-14 16:03:35,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:35,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:35,191 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-14 16:03:35,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:35,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127708297] [2022-07-14 16:03:35,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127708297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:35,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:35,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:35,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140988336] [2022-07-14 16:03:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:35,193 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:03:35,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash 910089250, now seen corresponding path program 2 times [2022-07-14 16:03:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:35,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194402016] [2022-07-14 16:03:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:35,197 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:35,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:35,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:35,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:35,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:35,227 INFO L87 Difference]: Start difference. First operand 20176 states and 31971 transitions. cyclomatic complexity: 11813 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-14 16:03:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:35,278 INFO L93 Difference]: Finished difference Result 20104 states and 31852 transitions. [2022-07-14 16:03:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:35,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20104 states and 31852 transitions. [2022-07-14 16:03:35,389 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-14 16:03:35,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20104 states to 20104 states and 31852 transitions. [2022-07-14 16:03:35,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9357 [2022-07-14 16:03:35,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9357 [2022-07-14 16:03:35,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20104 states and 31852 transitions. [2022-07-14 16:03:35,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:35,448 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20104 states and 31852 transitions. [2022-07-14 16:03:35,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20104 states and 31852 transitions. [2022-07-14 16:03:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20104 to 20104. [2022-07-14 16:03:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20104 states, 20104 states have (on average 1.5843613211301233) internal successors, (31852), 20103 states have internal predecessors, (31852), 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-14 16:03:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20104 states to 20104 states and 31852 transitions. [2022-07-14 16:03:35,712 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20104 states and 31852 transitions. [2022-07-14 16:03:35,712 INFO L374 stractBuchiCegarLoop]: Abstraction has 20104 states and 31852 transitions. [2022-07-14 16:03:35,712 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-14 16:03:35,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20104 states and 31852 transitions. [2022-07-14 16:03:35,756 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-14 16:03:35,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:35,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:35,757 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-14 16:03:35,757 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:35,757 INFO L752 eck$LassoCheckResult]: Stem: 136495#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(11, 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; 136346#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; 136347#L404 assume !(1 == ~c_req_up~0); 136416#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 136289#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 136290#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 136451#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 136452#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 136499#L435-1 assume !(0 == ~e_f~0); 136500#L440-1 assume !(0 == ~e_g~0); 136350#L445-1 assume !(0 == ~e_e~0); 136351#L450-1 assume !(0 == ~e_c~0); 136283#L455-1 assume !(0 == ~e_wl~0); 136284#L460-1 assume !(1 == ~wl_pc~0); 136532#L472 assume !(2 == ~wl_pc~0); 136497#L473 assume !(1 == ~c1_pc~0); 136476#L483 assume !(1 == ~c2_pc~0); 136253#L492 assume !(1 == ~wb_pc~0); 136349#L501 assume !(1 == ~e_c~0); 136380#L510-1 assume !(1 == ~e_e~0); 136515#L515-1 assume !(1 == ~e_f~0); 136250#L520-1 assume !(1 == ~e_g~0); 136251#L525-1 assume !(1 == ~e_c~0); 136352#L530-1 assume !(1 == ~e_wl~0); 138595#L672-1 assume !false; 138596#L542 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; 148552#L377 [2022-07-14 16:03:35,757 INFO L754 eck$LassoCheckResult]: Loop: 148552#L377 assume !false; 148550#L295 assume 0 == ~wl_st~0; 148548#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 148545#L321 assume !(0 != eval_~tmp~0#1); 148546#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 147594#L336 assume !(0 != eval_~tmp___0~0#1); 147609#L332 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 148567#L351 assume !(0 != eval_~tmp___1~0#1); 148566#L347 assume !(0 == ~wb_st~0); 148559#L362 assume !(0 == ~r_st~0); 148552#L377 [2022-07-14 16:03:35,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:35,758 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2022-07-14 16:03:35,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:35,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159690096] [2022-07-14 16:03:35,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:35,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:35,764 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:35,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:35,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:35,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1853655075, now seen corresponding path program 1 times [2022-07-14 16:03:35,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:35,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029939381] [2022-07-14 16:03:35,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:35,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:35,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:35,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:35,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:35,776 INFO L85 PathProgramCache]: Analyzing trace with hash -205670443, now seen corresponding path program 1 times [2022-07-14 16:03:35,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:35,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315151661] [2022-07-14 16:03:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:03:35,791 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-14 16:03:35,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:03:35,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315151661] [2022-07-14 16:03:35,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315151661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:03:35,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:03:35,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:03:35,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126722236] [2022-07-14 16:03:35,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:03:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:03:35,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:03:35,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:03:35,831 INFO L87 Difference]: Start difference. First operand 20104 states and 31852 transitions. cyclomatic complexity: 11766 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-14 16:03:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:03:35,929 INFO L93 Difference]: Finished difference Result 33433 states and 51943 transitions. [2022-07-14 16:03:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:03:35,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33433 states and 51943 transitions. [2022-07-14 16:03:36,148 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 15444 [2022-07-14 16:03:36,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33433 states to 33433 states and 51943 transitions. [2022-07-14 16:03:36,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15625 [2022-07-14 16:03:36,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15625 [2022-07-14 16:03:36,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33433 states and 51943 transitions. [2022-07-14 16:03:36,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 16:03:36,265 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33433 states and 51943 transitions. [2022-07-14 16:03:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33433 states and 51943 transitions. [2022-07-14 16:03:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33433 to 33433. [2022-07-14 16:03:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33433 states, 33433 states have (on average 1.553644602638112) internal successors, (51943), 33432 states have internal predecessors, (51943), 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-14 16:03:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33433 states to 33433 states and 51943 transitions. [2022-07-14 16:03:36,721 INFO L392 hiAutomatonCegarLoop]: Abstraction has 33433 states and 51943 transitions. [2022-07-14 16:03:36,721 INFO L374 stractBuchiCegarLoop]: Abstraction has 33433 states and 51943 transitions. [2022-07-14 16:03:36,721 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-14 16:03:36,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33433 states and 51943 transitions. [2022-07-14 16:03:36,792 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 15444 [2022-07-14 16:03:36,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:03:36,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:03:36,793 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-14 16:03:36,793 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:03:36,793 INFO L752 eck$LassoCheckResult]: Stem: 190048#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(11, 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; 189894#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; 189895#L404 assume !(1 == ~c_req_up~0); 189961#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 189829#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 189830#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 189997#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 189998#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 190055#L435-1 assume !(0 == ~e_f~0); 190056#L440-1 assume !(0 == ~e_g~0); 189898#L445-1 assume !(0 == ~e_e~0); 189899#L450-1 assume !(0 == ~e_c~0); 189827#L455-1 assume !(0 == ~e_wl~0); 189828#L460-1 assume !(1 == ~wl_pc~0); 190091#L472 assume !(2 == ~wl_pc~0); 190050#L473 assume !(1 == ~c1_pc~0); 190017#L483 assume !(1 == ~c2_pc~0); 189797#L492 assume !(1 == ~wb_pc~0); 189897#L501 assume !(1 == ~e_c~0); 189928#L510-1 assume !(1 == ~e_e~0); 190074#L515-1 assume !(1 == ~e_f~0); 189794#L520-1 assume !(1 == ~e_g~0); 189795#L525-1 assume !(1 == ~e_c~0); 189900#L530-1 assume !(1 == ~e_wl~0); 196797#L672-1 assume !false; 196798#L542 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; 207344#L377 [2022-07-14 16:03:36,793 INFO L754 eck$LassoCheckResult]: Loop: 207344#L377 assume !false; 209577#L295 assume 0 == ~wl_st~0; 209575#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 209573#L321 assume !(0 != eval_~tmp~0#1); 208610#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 208608#L336 assume !(0 != eval_~tmp___0~0#1); 208606#L332 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 208594#L351 assume !(0 != eval_~tmp___1~0#1); 208603#L347 assume 0 == ~wb_st~0;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 208706#L366 assume !(0 != eval_~tmp___2~0#1); 208716#L362 assume !(0 == ~r_st~0); 207344#L377 [2022-07-14 16:03:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:36,794 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2022-07-14 16:03:36,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:36,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567812733] [2022-07-14 16:03:36,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:36,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:36,800 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:36,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:36,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1628767882, now seen corresponding path program 1 times [2022-07-14 16:03:36,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:36,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741957693] [2022-07-14 16:03:36,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:36,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:36,810 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:36,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:36,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:03:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2080851842, now seen corresponding path program 1 times [2022-07-14 16:03:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:03:36,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605160567] [2022-07-14 16:03:36,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:03:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:03:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:36,816 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:03:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:03:36,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:03:37,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 04:03:37 BoogieIcfgContainer [2022-07-14 16:03:37,564 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 16:03:37,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 16:03:37,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 16:03:37,564 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 16:03:37,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:03:27" (3/4) ... [2022-07-14 16:03:37,566 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-14 16:03:37,595 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 16:03:37,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 16:03:37,596 INFO L158 Benchmark]: Toolchain (without parser) took 11011.73ms. Allocated memory was 94.4MB in the beginning and 729.8MB in the end (delta: 635.4MB). Free memory was 61.0MB in the beginning and 338.0MB in the end (delta: -276.9MB). Peak memory consumption was 359.1MB. Max. memory is 16.1GB. [2022-07-14 16:03:37,597 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 48.9MB in the beginning and 48.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:03:37,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.69ms. Allocated memory is still 94.4MB. Free memory was 60.9MB in the beginning and 66.2MB in the end (delta: -5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 16:03:37,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.77ms. Allocated memory is still 94.4MB. Free memory was 66.2MB in the beginning and 63.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:03:37,598 INFO L158 Benchmark]: Boogie Preprocessor took 22.96ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 62.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:03:37,598 INFO L158 Benchmark]: RCFGBuilder took 365.10ms. Allocated memory is still 94.4MB. Free memory was 61.6MB in the beginning and 42.6MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-14 16:03:37,598 INFO L158 Benchmark]: BuchiAutomizer took 10339.38ms. Allocated memory was 94.4MB in the beginning and 729.8MB in the end (delta: 635.4MB). Free memory was 42.6MB in the beginning and 341.1MB in the end (delta: -298.5MB). Peak memory consumption was 464.4MB. Max. memory is 16.1GB. [2022-07-14 16:03:37,598 INFO L158 Benchmark]: Witness Printer took 31.77ms. Allocated memory is still 729.8MB. Free memory was 341.1MB in the beginning and 338.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 16:03:37,600 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.15ms. Allocated memory is still 94.4MB. Free memory was 48.9MB in the beginning and 48.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.69ms. Allocated memory is still 94.4MB. Free memory was 60.9MB in the beginning and 66.2MB in the end (delta: -5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.77ms. Allocated memory is still 94.4MB. Free memory was 66.2MB in the beginning and 63.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.96ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 62.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 365.10ms. Allocated memory is still 94.4MB. Free memory was 61.6MB in the beginning and 42.6MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 10339.38ms. Allocated memory was 94.4MB in the beginning and 729.8MB in the end (delta: 635.4MB). Free memory was 42.6MB in the beginning and 341.1MB in the end (delta: -298.5MB). Peak memory consumption was 464.4MB. Max. memory is 16.1GB. * Witness Printer took 31.77ms. Allocated memory is still 729.8MB. Free memory was 341.1MB in the beginning and 338.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 19 terminating modules (16 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_wl + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_g + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 16 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 33433 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 17 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 10. Automata minimization 1.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 1573 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.9s 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: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4286 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4283 mSDsluCounter, 7691 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3114 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 4577 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc2 concLT2 SILN1 SILU0 SILI8 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital82 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf100 smp100 dnf211 smp54 tf110 neg94 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 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: 294]: 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@74cae5e3=0, e_p_in=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6479acf1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65e0a7bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f9ab93d=0, t_b=0, p_in=0, wb_pc=0, data=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e23f916=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: 294]: 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 ; [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 [L404] COND FALSE !((int )c_req_up == 1) [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 [L440] COND FALSE !((int )e_f == 0) [L445] COND FALSE !((int )e_g == 0) [L450] COND FALSE !((int )e_e == 0) [L455] COND FALSE !((int )e_c == 0) [L460] COND FALSE !((int )e_wl == 0) [L465] COND FALSE !((int )wl_pc == 1) [L473] COND FALSE !((int )wl_pc == 2) [L483] COND FALSE !((int )c1_pc == 1) [L492] COND FALSE !((int )c2_pc == 1) [L501] COND FALSE !((int )wb_pc == 1) [L510] COND FALSE !((int )e_c == 1) [L515] COND FALSE !((int )e_e == 1) [L520] COND FALSE !((int )e_f == 1) [L525] COND FALSE !((int )e_g == 1) [L530] COND FALSE !((int )e_c == 1) [L535] COND FALSE !((int )e_wl == 1) [L541] COND TRUE 1 [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-14 16:03:37,644 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)