./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy2.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f721563b23ef637d292551ef1a662f821e744b5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-15 19:27:34,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-15 19:27:34,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-15 19:27:34,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-15 19:27:34,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-15 19:27:34,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-15 19:27:34,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-15 19:27:34,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-15 19:27:34,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-15 19:27:34,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-15 19:27:34,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-15 19:27:34,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-15 19:27:34,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-15 19:27:34,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-15 19:27:34,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-15 19:27:34,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-15 19:27:34,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-15 19:27:34,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-15 19:27:34,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-15 19:27:34,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-15 19:27:34,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-15 19:27:34,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-15 19:27:34,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-15 19:27:34,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-15 19:27:34,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-15 19:27:34,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-15 19:27:34,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-15 19:27:34,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-15 19:27:34,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-15 19:27:34,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-15 19:27:34,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-15 19:27:34,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-15 19:27:34,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-15 19:27:34,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-15 19:27:34,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-15 19:27:34,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-15 19:27:34,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-15 19:27:34,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-15 19:27:34,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-15 19:27:34,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-15 19:27:34,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-15 19:27:34,502 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-15 19:27:34,548 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-15 19:27:34,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-15 19:27:34,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-15 19:27:34,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-15 19:27:34,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-15 19:27:34,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-15 19:27:34,559 INFO L138 SettingsManager]: * Use SBE=true [2021-10-15 19:27:34,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-15 19:27:34,559 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-15 19:27:34,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-15 19:27:34,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-15 19:27:34,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-15 19:27:34,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-15 19:27:34,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-15 19:27:34,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-15 19:27:34,562 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-15 19:27:34,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-15 19:27:34,563 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-15 19:27:34,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-15 19:27:34,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-15 19:27:34,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-15 19:27:34,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-15 19:27:34,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 19:27:34,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-15 19:27:34,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-15 19:27:34,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-15 19:27:34,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-15 19:27:34,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-15 19:27:34,566 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-15 19:27:34,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-15 19:27:34,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-15 19:27:34,566 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-15 19:27:34,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3 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(G ! call(reach_error())) ) 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 -> 0f721563b23ef637d292551ef1a662f821e744b5 [2021-10-15 19:27:34,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-15 19:27:34,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-15 19:27:34,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-15 19:27:34,923 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-15 19:27:34,924 INFO L275 PluginConnector]: CDTParser initialized [2021-10-15 19:27:34,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/../../sv-benchmarks/c/systemc/toy2.cil.c [2021-10-15 19:27:35,004 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/data/470e7c8d7/ef0426efef924f0487db63846a743d32/FLAG2189b7ffb [2021-10-15 19:27:35,586 INFO L306 CDTParser]: Found 1 translation units. [2021-10-15 19:27:35,589 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/sv-benchmarks/c/systemc/toy2.cil.c [2021-10-15 19:27:35,612 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/data/470e7c8d7/ef0426efef924f0487db63846a743d32/FLAG2189b7ffb [2021-10-15 19:27:35,855 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/data/470e7c8d7/ef0426efef924f0487db63846a743d32 [2021-10-15 19:27:35,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-15 19:27:35,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-15 19:27:35,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-15 19:27:35,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-15 19:27:35,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-15 19:27:35,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 07:27:35" (1/1) ... [2021-10-15 19:27:35,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f66361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:35, skipping insertion in model container [2021-10-15 19:27:35,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 07:27:35" (1/1) ... [2021-10-15 19:27:35,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-15 19:27:35,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-15 19:27:36,175 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/sv-benchmarks/c/systemc/toy2.cil.c[393,406] [2021-10-15 19:27:36,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 19:27:36,347 INFO L203 MainTranslator]: Completed pre-run [2021-10-15 19:27:36,365 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/sv-benchmarks/c/systemc/toy2.cil.c[393,406] [2021-10-15 19:27:36,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 19:27:36,472 INFO L208 MainTranslator]: Completed translation [2021-10-15 19:27:36,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36 WrapperNode [2021-10-15 19:27:36,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-15 19:27:36,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-15 19:27:36,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-15 19:27:36,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-15 19:27:36,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36" (1/1) ... [2021-10-15 19:27:36,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36" (1/1) ... [2021-10-15 19:27:36,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-15 19:27:36,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-15 19:27:36,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-15 19:27:36,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-15 19:27:36,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36" (1/1) ... [2021-10-15 19:27:36,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36" (1/1) ... [2021-10-15 19:27:36,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36" (1/1) ... [2021-10-15 19:27:36,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36" (1/1) ... [2021-10-15 19:27:36,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36" (1/1) ... [2021-10-15 19:27:36,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36" (1/1) ... [2021-10-15 19:27:36,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36" (1/1) ... [2021-10-15 19:27:36,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-15 19:27:36,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-15 19:27:36,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-15 19:27:36,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-15 19:27:36,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36" (1/1) ... [2021-10-15 19:27:36,656 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 19:27:36,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 19:27:36,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-15 19:27:36,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-15 19:27:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-15 19:27:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-15 19:27:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-15 19:27:36,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-15 19:27:37,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-15 19:27:37,255 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-10-15 19:27:37,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:27:37 BoogieIcfgContainer [2021-10-15 19:27:37,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-15 19:27:37,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-15 19:27:37,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-15 19:27:37,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-15 19:27:37,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 07:27:35" (1/3) ... [2021-10-15 19:27:37,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49430618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 07:27:37, skipping insertion in model container [2021-10-15 19:27:37,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 07:27:36" (2/3) ... [2021-10-15 19:27:37,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49430618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 07:27:37, skipping insertion in model container [2021-10-15 19:27:37,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:27:37" (3/3) ... [2021-10-15 19:27:37,278 INFO L111 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2021-10-15 19:27:37,289 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-15 19:27:37,290 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-15 19:27:37,359 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-15 19:27:37,371 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-15 19:27:37,371 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-15 19:27:37,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 231 transitions, 462 flow [2021-10-15 19:27:37,506 INFO L129 PetriNetUnfolder]: 107/231 cut-off events. [2021-10-15 19:27:37,507 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 19:27:37,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 231 events. 107/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 477 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2021-10-15 19:27:37,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 231 transitions, 462 flow [2021-10-15 19:27:37,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 225 transitions, 450 flow [2021-10-15 19:27:37,565 INFO L129 PetriNetUnfolder]: 68/154 cut-off events. [2021-10-15 19:27:37,568 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 19:27:37,569 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:37,570 INFO L254 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2021-10-15 19:27:37,570 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:37,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2040700943, now seen corresponding path program 1 times [2021-10-15 19:27:37,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:37,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516011123] [2021-10-15 19:27:37,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:37,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:37,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:37,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516011123] [2021-10-15 19:27:37,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516011123] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:37,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:37,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:27:37,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291729303] [2021-10-15 19:27:37,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:27:37,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:38,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:27:38,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:27:38,010 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 231 [2021-10-15 19:27:38,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 225 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:38,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:38,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 231 [2021-10-15 19:27:38,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:38,092 INFO L129 PetriNetUnfolder]: 86/206 cut-off events. [2021-10-15 19:27:38,093 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 19:27:38,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 206 events. 86/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 402 event pairs, 0 based on Foata normal form. 6/126 useless extension candidates. Maximal degree in co-relation 100. Up to 10 conditions per place. [2021-10-15 19:27:38,103 INFO L132 encePairwiseOnDemand]: 209/231 looper letters, 13 selfloop transitions, 3 changer transitions 0/206 dead transitions. [2021-10-15 19:27:38,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 206 transitions, 444 flow [2021-10-15 19:27:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:27:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:27:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2021-10-15 19:27:38,136 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8903318903318903 [2021-10-15 19:27:38,137 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 617 transitions. [2021-10-15 19:27:38,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 617 transitions. [2021-10-15 19:27:38,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:38,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 617 transitions. [2021-10-15 19:27:38,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:38,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:38,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:38,166 INFO L186 Difference]: Start difference. First operand has 121 places, 225 transitions, 450 flow. Second operand 3 states and 617 transitions. [2021-10-15 19:27:38,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 206 transitions, 444 flow [2021-10-15 19:27:38,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 206 transitions, 444 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-15 19:27:38,179 INFO L242 Difference]: Finished difference. Result has 123 places, 206 transitions, 418 flow [2021-10-15 19:27:38,182 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=123, PETRI_TRANSITIONS=206} [2021-10-15 19:27:38,183 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 2 predicate places. [2021-10-15 19:27:38,183 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 206 transitions, 418 flow [2021-10-15 19:27:38,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:38,185 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:38,185 INFO L254 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2021-10-15 19:27:38,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-15 19:27:38,186 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:38,187 INFO L82 PathProgramCache]: Analyzing trace with hash -589833643, now seen corresponding path program 1 times [2021-10-15 19:27:38,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:38,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62632838] [2021-10-15 19:27:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:38,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:38,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:38,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62632838] [2021-10-15 19:27:38,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62632838] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:38,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:38,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:27:38,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968308461] [2021-10-15 19:27:38,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:27:38,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:38,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:27:38,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:27:38,335 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 231 [2021-10-15 19:27:38,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 206 transitions, 418 flow. Second operand has 4 states, 4 states have (on average 175.5) internal successors, (702), 4 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:38,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:38,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 231 [2021-10-15 19:27:38,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:38,533 INFO L129 PetriNetUnfolder]: 138/339 cut-off events. [2021-10-15 19:27:38,533 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-15 19:27:38,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 339 events. 138/339 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 992 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 363. Up to 28 conditions per place. [2021-10-15 19:27:38,538 INFO L132 encePairwiseOnDemand]: 222/231 looper letters, 39 selfloop transitions, 7 changer transitions 0/216 dead transitions. [2021-10-15 19:27:38,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 216 transitions, 532 flow [2021-10-15 19:27:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:27:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 19:27:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 919 transitions. [2021-10-15 19:27:38,543 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7956709956709956 [2021-10-15 19:27:38,544 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 919 transitions. [2021-10-15 19:27:38,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 919 transitions. [2021-10-15 19:27:38,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:38,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 919 transitions. [2021-10-15 19:27:38,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:38,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:38,557 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:38,557 INFO L186 Difference]: Start difference. First operand has 123 places, 206 transitions, 418 flow. Second operand 5 states and 919 transitions. [2021-10-15 19:27:38,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 216 transitions, 532 flow [2021-10-15 19:27:38,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 216 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:27:38,569 INFO L242 Difference]: Finished difference. Result has 126 places, 208 transitions, 444 flow [2021-10-15 19:27:38,569 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=444, PETRI_PLACES=126, PETRI_TRANSITIONS=208} [2021-10-15 19:27:38,570 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 5 predicate places. [2021-10-15 19:27:38,571 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 208 transitions, 444 flow [2021-10-15 19:27:38,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 175.5) internal successors, (702), 4 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:38,572 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:38,572 INFO L254 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2021-10-15 19:27:38,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-15 19:27:38,573 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash -527794029, now seen corresponding path program 1 times [2021-10-15 19:27:38,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:38,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552285128] [2021-10-15 19:27:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:38,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:38,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:38,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552285128] [2021-10-15 19:27:38,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552285128] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:38,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:38,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:27:38,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631635330] [2021-10-15 19:27:38,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:27:38,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:38,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:27:38,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:27:38,697 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 231 [2021-10-15 19:27:38,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 208 transitions, 444 flow. Second operand has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:38,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:38,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 231 [2021-10-15 19:27:38,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:39,006 INFO L129 PetriNetUnfolder]: 319/807 cut-off events. [2021-10-15 19:27:39,007 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-10-15 19:27:39,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 807 events. 319/807 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3824 event pairs, 0 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 459. Up to 41 conditions per place. [2021-10-15 19:27:39,022 INFO L132 encePairwiseOnDemand]: 221/231 looper letters, 46 selfloop transitions, 11 changer transitions 0/233 dead transitions. [2021-10-15 19:27:39,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 233 transitions, 618 flow [2021-10-15 19:27:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:27:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 19:27:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 952 transitions. [2021-10-15 19:27:39,029 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8242424242424242 [2021-10-15 19:27:39,029 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 952 transitions. [2021-10-15 19:27:39,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 952 transitions. [2021-10-15 19:27:39,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:39,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 952 transitions. [2021-10-15 19:27:39,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 190.4) internal successors, (952), 5 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:39,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:39,044 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:39,045 INFO L186 Difference]: Start difference. First operand has 126 places, 208 transitions, 444 flow. Second operand 5 states and 952 transitions. [2021-10-15 19:27:39,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 233 transitions, 618 flow [2021-10-15 19:27:39,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 233 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:27:39,063 INFO L242 Difference]: Finished difference. Result has 130 places, 214 transitions, 504 flow [2021-10-15 19:27:39,064 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=130, PETRI_TRANSITIONS=214} [2021-10-15 19:27:39,064 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 9 predicate places. [2021-10-15 19:27:39,064 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 214 transitions, 504 flow [2021-10-15 19:27:39,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:39,066 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:39,066 INFO L254 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2021-10-15 19:27:39,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-15 19:27:39,067 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:39,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1322115113, now seen corresponding path program 1 times [2021-10-15 19:27:39,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:39,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976218105] [2021-10-15 19:27:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:39,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:39,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:39,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976218105] [2021-10-15 19:27:39,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976218105] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:39,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:39,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:27:39,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378209404] [2021-10-15 19:27:39,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:27:39,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:39,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:27:39,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:27:39,198 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 231 [2021-10-15 19:27:39,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 214 transitions, 504 flow. Second operand has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:39,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:39,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 231 [2021-10-15 19:27:39,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:39,511 INFO L129 PetriNetUnfolder]: 639/1662 cut-off events. [2021-10-15 19:27:39,512 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-10-15 19:27:39,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 1662 events. 639/1662 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10005 event pairs, 0 based on Foata normal form. 0/1089 useless extension candidates. Maximal degree in co-relation 1040. Up to 106 conditions per place. [2021-10-15 19:27:39,525 INFO L132 encePairwiseOnDemand]: 209/231 looper letters, 44 selfloop transitions, 19 changer transitions 0/245 dead transitions. [2021-10-15 19:27:39,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 245 transitions, 692 flow [2021-10-15 19:27:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-15 19:27:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-15 19:27:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 819 transitions. [2021-10-15 19:27:39,530 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2021-10-15 19:27:39,531 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 819 transitions. [2021-10-15 19:27:39,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 819 transitions. [2021-10-15 19:27:39,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:39,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 819 transitions. [2021-10-15 19:27:39,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 204.75) internal successors, (819), 4 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:39,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:39,543 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:39,544 INFO L186 Difference]: Start difference. First operand has 130 places, 214 transitions, 504 flow. Second operand 4 states and 819 transitions. [2021-10-15 19:27:39,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 245 transitions, 692 flow [2021-10-15 19:27:39,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 245 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:27:39,561 INFO L242 Difference]: Finished difference. Result has 135 places, 225 transitions, 632 flow [2021-10-15 19:27:39,562 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=632, PETRI_PLACES=135, PETRI_TRANSITIONS=225} [2021-10-15 19:27:39,562 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 14 predicate places. [2021-10-15 19:27:39,563 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 225 transitions, 632 flow [2021-10-15 19:27:39,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:39,564 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:39,565 INFO L254 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2021-10-15 19:27:39,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-15 19:27:39,565 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:39,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1106812377, now seen corresponding path program 1 times [2021-10-15 19:27:39,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:39,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533651990] [2021-10-15 19:27:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:39,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:39,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:39,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533651990] [2021-10-15 19:27:39,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533651990] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:39,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:39,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:27:39,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510229573] [2021-10-15 19:27:39,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:27:39,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:39,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:27:39,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:27:39,704 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 231 [2021-10-15 19:27:39,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 225 transitions, 632 flow. Second operand has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:39,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:39,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 231 [2021-10-15 19:27:39,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:40,064 INFO L129 PetriNetUnfolder]: 948/2550 cut-off events. [2021-10-15 19:27:40,064 INFO L130 PetriNetUnfolder]: For 273/273 co-relation queries the response was YES. [2021-10-15 19:27:40,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3409 conditions, 2550 events. 948/2550 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 15942 event pairs, 4 based on Foata normal form. 27/1804 useless extension candidates. Maximal degree in co-relation 1660. Up to 170 conditions per place. [2021-10-15 19:27:40,087 INFO L132 encePairwiseOnDemand]: 212/231 looper letters, 38 selfloop transitions, 20 changer transitions 0/243 dead transitions. [2021-10-15 19:27:40,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 243 transitions, 800 flow [2021-10-15 19:27:40,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-15 19:27:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-15 19:27:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 789 transitions. [2021-10-15 19:27:40,091 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8538961038961039 [2021-10-15 19:27:40,091 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 789 transitions. [2021-10-15 19:27:40,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 789 transitions. [2021-10-15 19:27:40,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:40,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 789 transitions. [2021-10-15 19:27:40,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.25) internal successors, (789), 4 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:40,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:40,135 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:40,136 INFO L186 Difference]: Start difference. First operand has 135 places, 225 transitions, 632 flow. Second operand 4 states and 789 transitions. [2021-10-15 19:27:40,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 243 transitions, 800 flow [2021-10-15 19:27:40,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 243 transitions, 800 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-15 19:27:40,153 INFO L242 Difference]: Finished difference. Result has 140 places, 231 transitions, 747 flow [2021-10-15 19:27:40,153 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=747, PETRI_PLACES=140, PETRI_TRANSITIONS=231} [2021-10-15 19:27:40,154 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 19 predicate places. [2021-10-15 19:27:40,154 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 231 transitions, 747 flow [2021-10-15 19:27:40,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:40,155 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:40,155 INFO L254 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2021-10-15 19:27:40,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-15 19:27:40,155 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:40,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:40,156 INFO L82 PathProgramCache]: Analyzing trace with hash 95695127, now seen corresponding path program 1 times [2021-10-15 19:27:40,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:40,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705156828] [2021-10-15 19:27:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:40,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:40,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:40,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705156828] [2021-10-15 19:27:40,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705156828] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:40,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:40,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:27:40,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367126522] [2021-10-15 19:27:40,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:27:40,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:40,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:27:40,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:27:40,261 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 231 [2021-10-15 19:27:40,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 231 transitions, 747 flow. Second operand has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:40,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:40,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 231 [2021-10-15 19:27:40,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:40,692 INFO L129 PetriNetUnfolder]: 1242/3478 cut-off events. [2021-10-15 19:27:40,692 INFO L130 PetriNetUnfolder]: For 695/695 co-relation queries the response was YES. [2021-10-15 19:27:40,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4856 conditions, 3478 events. 1242/3478 cut-off events. For 695/695 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 22333 event pairs, 5 based on Foata normal form. 40/2494 useless extension candidates. Maximal degree in co-relation 3092. Up to 251 conditions per place. [2021-10-15 19:27:40,715 INFO L132 encePairwiseOnDemand]: 215/231 looper letters, 49 selfloop transitions, 18 changer transitions 0/255 dead transitions. [2021-10-15 19:27:40,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 255 transitions, 979 flow [2021-10-15 19:27:40,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-15 19:27:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-15 19:27:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 810 transitions. [2021-10-15 19:27:40,720 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8766233766233766 [2021-10-15 19:27:40,720 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 810 transitions. [2021-10-15 19:27:40,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 810 transitions. [2021-10-15 19:27:40,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:40,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 810 transitions. [2021-10-15 19:27:40,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:40,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:40,729 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:40,730 INFO L186 Difference]: Start difference. First operand has 140 places, 231 transitions, 747 flow. Second operand 4 states and 810 transitions. [2021-10-15 19:27:40,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 255 transitions, 979 flow [2021-10-15 19:27:40,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 255 transitions, 979 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-15 19:27:40,742 INFO L242 Difference]: Finished difference. Result has 146 places, 238 transitions, 905 flow [2021-10-15 19:27:40,743 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=905, PETRI_PLACES=146, PETRI_TRANSITIONS=238} [2021-10-15 19:27:40,743 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 25 predicate places. [2021-10-15 19:27:40,743 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 238 transitions, 905 flow [2021-10-15 19:27:40,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:40,744 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:40,744 INFO L254 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2021-10-15 19:27:40,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-15 19:27:40,745 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:40,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:40,746 INFO L82 PathProgramCache]: Analyzing trace with hash 353860565, now seen corresponding path program 1 times [2021-10-15 19:27:40,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:40,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038584777] [2021-10-15 19:27:40,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:40,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:40,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:40,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038584777] [2021-10-15 19:27:40,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038584777] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:40,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:40,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:27:40,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361204281] [2021-10-15 19:27:40,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:27:40,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:40,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:27:40,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:27:40,826 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 231 [2021-10-15 19:27:40,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 238 transitions, 905 flow. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:40,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:40,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 231 [2021-10-15 19:27:40,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:41,167 INFO L129 PetriNetUnfolder]: 973/2755 cut-off events. [2021-10-15 19:27:41,167 INFO L130 PetriNetUnfolder]: For 684/684 co-relation queries the response was YES. [2021-10-15 19:27:41,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 2755 events. 973/2755 cut-off events. For 684/684 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 16307 event pairs, 5 based on Foata normal form. 0/1988 useless extension candidates. Maximal degree in co-relation 2560. Up to 233 conditions per place. [2021-10-15 19:27:41,186 INFO L132 encePairwiseOnDemand]: 221/231 looper letters, 24 selfloop transitions, 6 changer transitions 0/236 dead transitions. [2021-10-15 19:27:41,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 236 transitions, 940 flow [2021-10-15 19:27:41,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:27:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:27:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 621 transitions. [2021-10-15 19:27:41,190 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8961038961038961 [2021-10-15 19:27:41,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 621 transitions. [2021-10-15 19:27:41,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 621 transitions. [2021-10-15 19:27:41,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:41,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 621 transitions. [2021-10-15 19:27:41,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:41,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:41,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:41,196 INFO L186 Difference]: Start difference. First operand has 146 places, 238 transitions, 905 flow. Second operand 3 states and 621 transitions. [2021-10-15 19:27:41,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 236 transitions, 940 flow [2021-10-15 19:27:41,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 236 transitions, 929 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-10-15 19:27:41,209 INFO L242 Difference]: Finished difference. Result has 147 places, 232 transitions, 901 flow [2021-10-15 19:27:41,210 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=147, PETRI_TRANSITIONS=232} [2021-10-15 19:27:41,210 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 26 predicate places. [2021-10-15 19:27:41,210 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 232 transitions, 901 flow [2021-10-15 19:27:41,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:41,211 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:41,211 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2021-10-15 19:27:41,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-15 19:27:41,212 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:41,212 INFO L82 PathProgramCache]: Analyzing trace with hash -209495903, now seen corresponding path program 1 times [2021-10-15 19:27:41,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:41,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412107894] [2021-10-15 19:27:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:41,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:41,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:41,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412107894] [2021-10-15 19:27:41,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412107894] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:41,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:41,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:27:41,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311048150] [2021-10-15 19:27:41,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:27:41,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:41,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:27:41,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:27:41,264 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 231 [2021-10-15 19:27:41,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 232 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:41,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:41,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 231 [2021-10-15 19:27:41,266 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:41,640 INFO L129 PetriNetUnfolder]: 1394/4008 cut-off events. [2021-10-15 19:27:41,640 INFO L130 PetriNetUnfolder]: For 959/959 co-relation queries the response was YES. [2021-10-15 19:27:41,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5797 conditions, 4008 events. 1394/4008 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 26470 event pairs, 6 based on Foata normal form. 0/3003 useless extension candidates. Maximal degree in co-relation 3642. Up to 173 conditions per place. [2021-10-15 19:27:41,673 INFO L132 encePairwiseOnDemand]: 222/231 looper letters, 8 selfloop transitions, 7 changer transitions 0/235 dead transitions. [2021-10-15 19:27:41,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 235 transitions, 937 flow [2021-10-15 19:27:41,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:27:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:27:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2021-10-15 19:27:41,677 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9076479076479076 [2021-10-15 19:27:41,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 629 transitions. [2021-10-15 19:27:41,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 629 transitions. [2021-10-15 19:27:41,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:41,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 629 transitions. [2021-10-15 19:27:41,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:41,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:41,685 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:41,686 INFO L186 Difference]: Start difference. First operand has 147 places, 232 transitions, 901 flow. Second operand 3 states and 629 transitions. [2021-10-15 19:27:41,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 235 transitions, 937 flow [2021-10-15 19:27:41,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 235 transitions, 925 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:27:41,706 INFO L242 Difference]: Finished difference. Result has 149 places, 235 transitions, 933 flow [2021-10-15 19:27:41,707 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=149, PETRI_TRANSITIONS=235} [2021-10-15 19:27:41,707 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 28 predicate places. [2021-10-15 19:27:41,707 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 235 transitions, 933 flow [2021-10-15 19:27:41,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:41,708 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:41,709 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2021-10-15 19:27:41,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-15 19:27:41,709 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash 214150819, now seen corresponding path program 1 times [2021-10-15 19:27:41,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:41,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336983394] [2021-10-15 19:27:41,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:41,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-15 19:27:41,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:41,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336983394] [2021-10-15 19:27:41,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336983394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:41,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:41,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:27:41,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077184916] [2021-10-15 19:27:41,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:27:41,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:41,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:27:41,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:27:41,758 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2021-10-15 19:27:41,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 235 transitions, 933 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:41,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:41,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2021-10-15 19:27:41,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:42,129 INFO L129 PetriNetUnfolder]: 1363/3905 cut-off events. [2021-10-15 19:27:42,129 INFO L130 PetriNetUnfolder]: For 932/932 co-relation queries the response was YES. [2021-10-15 19:27:42,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5640 conditions, 3905 events. 1363/3905 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 25906 event pairs, 10 based on Foata normal form. 2/2949 useless extension candidates. Maximal degree in co-relation 5569. Up to 173 conditions per place. [2021-10-15 19:27:42,158 INFO L132 encePairwiseOnDemand]: 229/231 looper letters, 2 selfloop transitions, 1 changer transitions 0/234 dead transitions. [2021-10-15 19:27:42,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 234 transitions, 933 flow [2021-10-15 19:27:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:27:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:27:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2021-10-15 19:27:42,162 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9321789321789322 [2021-10-15 19:27:42,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2021-10-15 19:27:42,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2021-10-15 19:27:42,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:42,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2021-10-15 19:27:42,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:42,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:42,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:42,169 INFO L186 Difference]: Start difference. First operand has 149 places, 235 transitions, 933 flow. Second operand 3 states and 646 transitions. [2021-10-15 19:27:42,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 234 transitions, 933 flow [2021-10-15 19:27:42,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 234 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:27:42,185 INFO L242 Difference]: Finished difference. Result has 149 places, 234 transitions, 917 flow [2021-10-15 19:27:42,186 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=917, PETRI_PLACES=149, PETRI_TRANSITIONS=234} [2021-10-15 19:27:42,186 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 28 predicate places. [2021-10-15 19:27:42,187 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 234 transitions, 917 flow [2021-10-15 19:27:42,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:42,187 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:42,188 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1] [2021-10-15 19:27:42,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-15 19:27:42,188 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:42,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:42,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1700232685, now seen corresponding path program 1 times [2021-10-15 19:27:42,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:42,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021196378] [2021-10-15 19:27:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:42,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:42,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:42,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021196378] [2021-10-15 19:27:42,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021196378] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:42,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:42,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:27:42,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093392964] [2021-10-15 19:27:42,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:27:42,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:42,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:27:42,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:27:42,270 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 231 [2021-10-15 19:27:42,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 234 transitions, 917 flow. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:42,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:42,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 231 [2021-10-15 19:27:42,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:42,864 INFO L129 PetriNetUnfolder]: 2080/6064 cut-off events. [2021-10-15 19:27:42,864 INFO L130 PetriNetUnfolder]: For 1228/1228 co-relation queries the response was YES. [2021-10-15 19:27:42,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8822 conditions, 6064 events. 2080/6064 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 45455 event pairs, 18 based on Foata normal form. 0/4553 useless extension candidates. Maximal degree in co-relation 8792. Up to 328 conditions per place. [2021-10-15 19:27:42,909 INFO L132 encePairwiseOnDemand]: 222/231 looper letters, 8 selfloop transitions, 7 changer transitions 0/237 dead transitions. [2021-10-15 19:27:42,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 237 transitions, 953 flow [2021-10-15 19:27:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:27:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:27:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2021-10-15 19:27:42,912 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9076479076479076 [2021-10-15 19:27:42,913 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 629 transitions. [2021-10-15 19:27:42,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 629 transitions. [2021-10-15 19:27:42,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:42,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 629 transitions. [2021-10-15 19:27:42,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:42,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:42,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:42,919 INFO L186 Difference]: Start difference. First operand has 149 places, 234 transitions, 917 flow. Second operand 3 states and 629 transitions. [2021-10-15 19:27:42,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 237 transitions, 953 flow [2021-10-15 19:27:42,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 237 transitions, 952 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:27:42,933 INFO L242 Difference]: Finished difference. Result has 152 places, 237 transitions, 960 flow [2021-10-15 19:27:42,934 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=960, PETRI_PLACES=152, PETRI_TRANSITIONS=237} [2021-10-15 19:27:42,935 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 31 predicate places. [2021-10-15 19:27:42,935 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 237 transitions, 960 flow [2021-10-15 19:27:42,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:42,935 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:42,936 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1] [2021-10-15 19:27:42,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-15 19:27:42,936 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:42,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:42,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2123879407, now seen corresponding path program 1 times [2021-10-15 19:27:42,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:42,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789044019] [2021-10-15 19:27:42,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:42,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-15 19:27:42,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:42,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789044019] [2021-10-15 19:27:42,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789044019] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:42,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:42,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:27:42,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002533760] [2021-10-15 19:27:42,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:27:42,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:42,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:27:42,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:27:42,986 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2021-10-15 19:27:42,987 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 237 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:42,987 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:42,987 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2021-10-15 19:27:42,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:43,549 INFO L129 PetriNetUnfolder]: 2051/5965 cut-off events. [2021-10-15 19:27:43,549 INFO L130 PetriNetUnfolder]: For 1300/1300 co-relation queries the response was YES. [2021-10-15 19:27:43,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8766 conditions, 5965 events. 2051/5965 cut-off events. For 1300/1300 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 44760 event pairs, 21 based on Foata normal form. 2/4549 useless extension candidates. Maximal degree in co-relation 8732. Up to 328 conditions per place. [2021-10-15 19:27:43,598 INFO L132 encePairwiseOnDemand]: 229/231 looper letters, 2 selfloop transitions, 1 changer transitions 0/236 dead transitions. [2021-10-15 19:27:43,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 236 transitions, 960 flow [2021-10-15 19:27:43,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:27:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:27:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2021-10-15 19:27:43,685 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9321789321789322 [2021-10-15 19:27:43,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2021-10-15 19:27:43,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2021-10-15 19:27:43,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:43,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2021-10-15 19:27:43,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:43,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:43,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:43,692 INFO L186 Difference]: Start difference. First operand has 152 places, 237 transitions, 960 flow. Second operand 3 states and 646 transitions. [2021-10-15 19:27:43,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 236 transitions, 960 flow [2021-10-15 19:27:43,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 236 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:27:43,709 INFO L242 Difference]: Finished difference. Result has 152 places, 236 transitions, 944 flow [2021-10-15 19:27:43,710 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=944, PETRI_PLACES=152, PETRI_TRANSITIONS=236} [2021-10-15 19:27:43,710 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 31 predicate places. [2021-10-15 19:27:43,710 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 236 transitions, 944 flow [2021-10-15 19:27:43,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:43,711 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:43,712 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1] [2021-10-15 19:27:43,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-15 19:27:43,712 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:43,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:43,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1601371510, now seen corresponding path program 1 times [2021-10-15 19:27:43,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:43,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117597444] [2021-10-15 19:27:43,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:43,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:43,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:43,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117597444] [2021-10-15 19:27:43,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117597444] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:43,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:43,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:27:43,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369743188] [2021-10-15 19:27:43,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:27:43,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:43,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:27:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:27:43,768 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 231 [2021-10-15 19:27:43,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 236 transitions, 944 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:43,770 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:43,770 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 231 [2021-10-15 19:27:43,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:44,760 INFO L129 PetriNetUnfolder]: 3384/9914 cut-off events. [2021-10-15 19:27:44,760 INFO L130 PetriNetUnfolder]: For 2028/2028 co-relation queries the response was YES. [2021-10-15 19:27:44,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15104 conditions, 9914 events. 3384/9914 cut-off events. For 2028/2028 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 84240 event pairs, 38 based on Foata normal form. 0/7564 useless extension candidates. Maximal degree in co-relation 15071. Up to 656 conditions per place. [2021-10-15 19:27:44,832 INFO L132 encePairwiseOnDemand]: 221/231 looper letters, 9 selfloop transitions, 8 changer transitions 0/240 dead transitions. [2021-10-15 19:27:44,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 240 transitions, 986 flow [2021-10-15 19:27:44,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:27:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:27:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2021-10-15 19:27:44,836 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9062049062049062 [2021-10-15 19:27:44,836 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 628 transitions. [2021-10-15 19:27:44,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 628 transitions. [2021-10-15 19:27:44,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:44,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 628 transitions. [2021-10-15 19:27:44,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:44,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:44,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:44,844 INFO L186 Difference]: Start difference. First operand has 152 places, 236 transitions, 944 flow. Second operand 3 states and 628 transitions. [2021-10-15 19:27:44,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 240 transitions, 986 flow [2021-10-15 19:27:44,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 240 transitions, 985 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:27:44,869 INFO L242 Difference]: Finished difference. Result has 155 places, 240 transitions, 995 flow [2021-10-15 19:27:44,870 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=995, PETRI_PLACES=155, PETRI_TRANSITIONS=240} [2021-10-15 19:27:44,870 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 34 predicate places. [2021-10-15 19:27:44,871 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 240 transitions, 995 flow [2021-10-15 19:27:44,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:44,871 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:44,872 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1] [2021-10-15 19:27:44,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-15 19:27:44,872 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:44,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2025018232, now seen corresponding path program 1 times [2021-10-15 19:27:44,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:44,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669931621] [2021-10-15 19:27:44,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:44,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-15 19:27:44,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:44,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669931621] [2021-10-15 19:27:44,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669931621] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:44,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:44,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:27:44,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200123935] [2021-10-15 19:27:44,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:27:44,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:44,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:27:44,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:27:44,912 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2021-10-15 19:27:44,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 240 transitions, 995 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:44,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:44,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2021-10-15 19:27:44,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:45,737 INFO L129 PetriNetUnfolder]: 3357/9813 cut-off events. [2021-10-15 19:27:45,738 INFO L130 PetriNetUnfolder]: For 2152/2152 co-relation queries the response was YES. [2021-10-15 19:27:45,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15098 conditions, 9813 events. 3357/9813 cut-off events. For 2152/2152 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 83573 event pairs, 41 based on Foata normal form. 2/7596 useless extension candidates. Maximal degree in co-relation 15061. Up to 656 conditions per place. [2021-10-15 19:27:45,817 INFO L132 encePairwiseOnDemand]: 229/231 looper letters, 2 selfloop transitions, 1 changer transitions 0/239 dead transitions. [2021-10-15 19:27:45,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 239 transitions, 995 flow [2021-10-15 19:27:45,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:27:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:27:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2021-10-15 19:27:45,820 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9321789321789322 [2021-10-15 19:27:45,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2021-10-15 19:27:45,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2021-10-15 19:27:45,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:45,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2021-10-15 19:27:45,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:45,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:45,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:45,828 INFO L186 Difference]: Start difference. First operand has 155 places, 240 transitions, 995 flow. Second operand 3 states and 646 transitions. [2021-10-15 19:27:45,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 239 transitions, 995 flow [2021-10-15 19:27:45,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 239 transitions, 981 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:27:45,859 INFO L242 Difference]: Finished difference. Result has 155 places, 239 transitions, 977 flow [2021-10-15 19:27:45,860 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=977, PETRI_PLACES=155, PETRI_TRANSITIONS=239} [2021-10-15 19:27:45,860 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 34 predicate places. [2021-10-15 19:27:45,860 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 239 transitions, 977 flow [2021-10-15 19:27:45,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:45,861 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:45,861 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2021-10-15 19:27:45,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-15 19:27:45,862 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:45,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:45,862 INFO L82 PathProgramCache]: Analyzing trace with hash -2129316584, now seen corresponding path program 1 times [2021-10-15 19:27:45,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:45,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941042813] [2021-10-15 19:27:45,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:45,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:45,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:45,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941042813] [2021-10-15 19:27:45,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941042813] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:45,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:45,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:27:45,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990026163] [2021-10-15 19:27:45,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:27:45,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:45,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:27:45,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:27:45,983 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 231 [2021-10-15 19:27:45,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 239 transitions, 977 flow. Second operand has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:45,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:45,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 231 [2021-10-15 19:27:45,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:47,567 INFO L129 PetriNetUnfolder]: 4533/13446 cut-off events. [2021-10-15 19:27:47,568 INFO L130 PetriNetUnfolder]: For 3410/3410 co-relation queries the response was YES. [2021-10-15 19:27:47,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22232 conditions, 13446 events. 4533/13446 cut-off events. For 3410/3410 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 120387 event pairs, 7 based on Foata normal form. 0/10751 useless extension candidates. Maximal degree in co-relation 22195. Up to 1078 conditions per place. [2021-10-15 19:27:47,657 INFO L132 encePairwiseOnDemand]: 217/231 looper letters, 32 selfloop transitions, 11 changer transitions 13/250 dead transitions. [2021-10-15 19:27:47,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 250 transitions, 1095 flow [2021-10-15 19:27:47,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:27:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 19:27:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 933 transitions. [2021-10-15 19:27:47,662 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8077922077922078 [2021-10-15 19:27:47,662 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 933 transitions. [2021-10-15 19:27:47,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 933 transitions. [2021-10-15 19:27:47,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:47,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 933 transitions. [2021-10-15 19:27:47,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.6) internal successors, (933), 5 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:47,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:47,673 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:47,673 INFO L186 Difference]: Start difference. First operand has 155 places, 239 transitions, 977 flow. Second operand 5 states and 933 transitions. [2021-10-15 19:27:47,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 250 transitions, 1095 flow [2021-10-15 19:27:47,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 250 transitions, 1094 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:27:47,716 INFO L242 Difference]: Finished difference. Result has 160 places, 234 transitions, 944 flow [2021-10-15 19:27:47,717 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=944, PETRI_PLACES=160, PETRI_TRANSITIONS=234} [2021-10-15 19:27:47,717 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 39 predicate places. [2021-10-15 19:27:47,717 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 234 transitions, 944 flow [2021-10-15 19:27:47,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:47,718 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:47,718 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:27:47,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-15 19:27:47,719 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:47,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:47,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1211370450, now seen corresponding path program 1 times [2021-10-15 19:27:47,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:47,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510908676] [2021-10-15 19:27:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:47,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:27:47,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:47,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510908676] [2021-10-15 19:27:47,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510908676] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:47,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:47,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-15 19:27:47,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743760058] [2021-10-15 19:27:47,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-15 19:27:47,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:47,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-15 19:27:47,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-15 19:27:47,816 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 231 [2021-10-15 19:27:47,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 234 transitions, 944 flow. Second operand has 5 states, 5 states have (on average 183.6) internal successors, (918), 5 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:47,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:47,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 231 [2021-10-15 19:27:47,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:50,037 INFO L129 PetriNetUnfolder]: 8203/25494 cut-off events. [2021-10-15 19:27:50,038 INFO L130 PetriNetUnfolder]: For 6231/6231 co-relation queries the response was YES. [2021-10-15 19:27:50,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43811 conditions, 25494 events. 8203/25494 cut-off events. For 6231/6231 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 273832 event pairs, 17 based on Foata normal form. 24/20761 useless extension candidates. Maximal degree in co-relation 43771. Up to 1591 conditions per place. [2021-10-15 19:27:50,212 INFO L132 encePairwiseOnDemand]: 217/231 looper letters, 38 selfloop transitions, 20 changer transitions 0/260 dead transitions. [2021-10-15 19:27:50,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 260 transitions, 1155 flow [2021-10-15 19:27:50,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-15 19:27:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-15 19:27:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1329 transitions. [2021-10-15 19:27:50,219 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8218923933209648 [2021-10-15 19:27:50,219 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1329 transitions. [2021-10-15 19:27:50,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1329 transitions. [2021-10-15 19:27:50,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:50,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1329 transitions. [2021-10-15 19:27:50,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 189.85714285714286) internal successors, (1329), 7 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:50,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:50,233 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:50,233 INFO L186 Difference]: Start difference. First operand has 160 places, 234 transitions, 944 flow. Second operand 7 states and 1329 transitions. [2021-10-15 19:27:50,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 260 transitions, 1155 flow [2021-10-15 19:27:50,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 260 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:27:50,343 INFO L242 Difference]: Finished difference. Result has 167 places, 243 transitions, 1075 flow [2021-10-15 19:27:50,344 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1075, PETRI_PLACES=167, PETRI_TRANSITIONS=243} [2021-10-15 19:27:50,344 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 46 predicate places. [2021-10-15 19:27:50,345 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 243 transitions, 1075 flow [2021-10-15 19:27:50,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 183.6) internal successors, (918), 5 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:50,357 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:50,357 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:27:50,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-15 19:27:50,358 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:50,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:50,358 INFO L82 PathProgramCache]: Analyzing trace with hash -615511442, now seen corresponding path program 1 times [2021-10-15 19:27:50,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:50,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044250677] [2021-10-15 19:27:50,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:50,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-15 19:27:50,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:50,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044250677] [2021-10-15 19:27:50,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044250677] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:50,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:50,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:27:50,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102099990] [2021-10-15 19:27:50,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:27:50,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:50,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:27:50,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:27:50,426 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 231 [2021-10-15 19:27:50,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 243 transitions, 1075 flow. Second operand has 4 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:50,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:50,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 231 [2021-10-15 19:27:50,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:53,614 INFO L129 PetriNetUnfolder]: 9491/29614 cut-off events. [2021-10-15 19:27:53,614 INFO L130 PetriNetUnfolder]: For 10358/10358 co-relation queries the response was YES. [2021-10-15 19:27:53,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52405 conditions, 29614 events. 9491/29614 cut-off events. For 10358/10358 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 326383 event pairs, 16 based on Foata normal form. 58/24369 useless extension candidates. Maximal degree in co-relation 52360. Up to 1801 conditions per place. [2021-10-15 19:27:53,820 INFO L132 encePairwiseOnDemand]: 221/231 looper letters, 50 selfloop transitions, 21 changer transitions 0/266 dead transitions. [2021-10-15 19:27:53,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 266 transitions, 1312 flow [2021-10-15 19:27:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:27:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 19:27:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 953 transitions. [2021-10-15 19:27:53,826 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8251082251082251 [2021-10-15 19:27:53,826 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 953 transitions. [2021-10-15 19:27:53,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 953 transitions. [2021-10-15 19:27:53,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:53,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 953 transitions. [2021-10-15 19:27:53,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 190.6) internal successors, (953), 5 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:53,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:53,836 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:53,836 INFO L186 Difference]: Start difference. First operand has 167 places, 243 transitions, 1075 flow. Second operand 5 states and 953 transitions. [2021-10-15 19:27:53,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 266 transitions, 1312 flow [2021-10-15 19:27:53,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 266 transitions, 1310 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:27:53,992 INFO L242 Difference]: Finished difference. Result has 172 places, 250 transitions, 1200 flow [2021-10-15 19:27:53,993 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1200, PETRI_PLACES=172, PETRI_TRANSITIONS=250} [2021-10-15 19:27:53,993 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 51 predicate places. [2021-10-15 19:27:53,994 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 250 transitions, 1200 flow [2021-10-15 19:27:53,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:53,994 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:53,995 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:27:53,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-15 19:27:53,995 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1155324144, now seen corresponding path program 1 times [2021-10-15 19:27:53,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:53,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533501024] [2021-10-15 19:27:53,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:53,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-15 19:27:54,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:54,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533501024] [2021-10-15 19:27:54,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533501024] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:54,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:54,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:27:54,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169391556] [2021-10-15 19:27:54,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:27:54,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:54,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:27:54,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:27:54,036 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 231 [2021-10-15 19:27:54,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 250 transitions, 1200 flow. Second operand has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:54,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:54,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 231 [2021-10-15 19:27:54,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:57,198 INFO L129 PetriNetUnfolder]: 10185/31876 cut-off events. [2021-10-15 19:27:57,198 INFO L130 PetriNetUnfolder]: For 10179/10179 co-relation queries the response was YES. [2021-10-15 19:27:57,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55721 conditions, 31876 events. 10185/31876 cut-off events. For 10179/10179 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 358339 event pairs, 26 based on Foata normal form. 1/26014 useless extension candidates. Maximal degree in co-relation 55672. Up to 1803 conditions per place. [2021-10-15 19:27:57,409 INFO L132 encePairwiseOnDemand]: 226/231 looper letters, 8 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2021-10-15 19:27:57,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 238 transitions, 1123 flow [2021-10-15 19:27:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-15 19:27:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-15 19:27:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 841 transitions. [2021-10-15 19:27:57,413 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9101731601731602 [2021-10-15 19:27:57,413 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 841 transitions. [2021-10-15 19:27:57,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 841 transitions. [2021-10-15 19:27:57,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:57,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 841 transitions. [2021-10-15 19:27:57,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 210.25) internal successors, (841), 4 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:57,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:57,420 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:57,421 INFO L186 Difference]: Start difference. First operand has 172 places, 250 transitions, 1200 flow. Second operand 4 states and 841 transitions. [2021-10-15 19:27:57,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 238 transitions, 1123 flow [2021-10-15 19:27:57,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 238 transitions, 1107 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-10-15 19:27:57,554 INFO L242 Difference]: Finished difference. Result has 172 places, 237 transitions, 1095 flow [2021-10-15 19:27:57,554 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1095, PETRI_PLACES=172, PETRI_TRANSITIONS=237} [2021-10-15 19:27:57,555 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 51 predicate places. [2021-10-15 19:27:57,555 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 237 transitions, 1095 flow [2021-10-15 19:27:57,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:57,555 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:27:57,556 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:27:57,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-15 19:27:57,556 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:27:57,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:27:57,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1475083469, now seen corresponding path program 1 times [2021-10-15 19:27:57,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:27:57,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826923757] [2021-10-15 19:27:57,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:27:57,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:27:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:27:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-15 19:27:57,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:27:57,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826923757] [2021-10-15 19:27:57,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826923757] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:27:57,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:27:57,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:27:57,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490140698] [2021-10-15 19:27:57,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:27:57,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:27:57,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:27:57,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:27:57,601 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 231 [2021-10-15 19:27:57,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 237 transitions, 1095 flow. Second operand has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:27:57,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:27:57,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 231 [2021-10-15 19:27:57,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:27:59,874 INFO L129 PetriNetUnfolder]: 6214/19670 cut-off events. [2021-10-15 19:27:59,874 INFO L130 PetriNetUnfolder]: For 7461/7461 co-relation queries the response was YES. [2021-10-15 19:27:59,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34932 conditions, 19670 events. 6214/19670 cut-off events. For 7461/7461 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 197308 event pairs, 34 based on Foata normal form. 49/15992 useless extension candidates. Maximal degree in co-relation 34882. Up to 1177 conditions per place. [2021-10-15 19:27:59,991 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 40 selfloop transitions, 11 changer transitions 0/236 dead transitions. [2021-10-15 19:27:59,992 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 236 transitions, 1162 flow [2021-10-15 19:27:59,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:27:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 19:27:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 927 transitions. [2021-10-15 19:27:59,996 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8025974025974026 [2021-10-15 19:27:59,996 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 927 transitions. [2021-10-15 19:27:59,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 927 transitions. [2021-10-15 19:27:59,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:27:59,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 927 transitions. [2021-10-15 19:28:00,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 185.4) internal successors, (927), 5 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:00,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:00,005 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:00,005 INFO L186 Difference]: Start difference. First operand has 172 places, 237 transitions, 1095 flow. Second operand 5 states and 927 transitions. [2021-10-15 19:28:00,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 236 transitions, 1162 flow [2021-10-15 19:28:00,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 236 transitions, 1127 flow, removed 9 selfloop flow, removed 3 redundant places. [2021-10-15 19:28:00,078 INFO L242 Difference]: Finished difference. Result has 174 places, 229 transitions, 1057 flow [2021-10-15 19:28:00,079 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1057, PETRI_PLACES=174, PETRI_TRANSITIONS=229} [2021-10-15 19:28:00,079 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 53 predicate places. [2021-10-15 19:28:00,079 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 229 transitions, 1057 flow [2021-10-15 19:28:00,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:00,080 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:00,080 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:00,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-15 19:28:00,081 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:00,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:00,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1413043855, now seen corresponding path program 1 times [2021-10-15 19:28:00,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:00,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425984002] [2021-10-15 19:28:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:00,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:28:00,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:00,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425984002] [2021-10-15 19:28:00,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425984002] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:00,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:00,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:00,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320899476] [2021-10-15 19:28:00,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:00,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:00,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:00,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:00,121 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 231 [2021-10-15 19:28:00,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 229 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:00,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:00,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 231 [2021-10-15 19:28:00,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:02,072 INFO L129 PetriNetUnfolder]: 6052/20512 cut-off events. [2021-10-15 19:28:02,072 INFO L130 PetriNetUnfolder]: For 5931/5931 co-relation queries the response was YES. [2021-10-15 19:28:02,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36617 conditions, 20512 events. 6052/20512 cut-off events. For 5931/5931 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 210802 event pairs, 34 based on Foata normal form. 0/17127 useless extension candidates. Maximal degree in co-relation 36565. Up to 1289 conditions per place. [2021-10-15 19:28:02,214 INFO L132 encePairwiseOnDemand]: 224/231 looper letters, 11 selfloop transitions, 3 changer transitions 0/230 dead transitions. [2021-10-15 19:28:02,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 230 transitions, 1087 flow [2021-10-15 19:28:02,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2021-10-15 19:28:02,217 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9134199134199135 [2021-10-15 19:28:02,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 633 transitions. [2021-10-15 19:28:02,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 633 transitions. [2021-10-15 19:28:02,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:02,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 633 transitions. [2021-10-15 19:28:02,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:02,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:02,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:02,224 INFO L186 Difference]: Start difference. First operand has 174 places, 229 transitions, 1057 flow. Second operand 3 states and 633 transitions. [2021-10-15 19:28:02,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 230 transitions, 1087 flow [2021-10-15 19:28:02,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 230 transitions, 1084 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:28:02,301 INFO L242 Difference]: Finished difference. Result has 176 places, 229 transitions, 1074 flow [2021-10-15 19:28:02,302 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=176, PETRI_TRANSITIONS=229} [2021-10-15 19:28:02,302 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 55 predicate places. [2021-10-15 19:28:02,302 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 229 transitions, 1074 flow [2021-10-15 19:28:02,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:02,303 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:02,303 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:02,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-15 19:28:02,304 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:02,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:02,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1020690453, now seen corresponding path program 1 times [2021-10-15 19:28:02,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:02,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964267371] [2021-10-15 19:28:02,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:02,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:28:02,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:02,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964267371] [2021-10-15 19:28:02,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964267371] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:02,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:02,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:02,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130706609] [2021-10-15 19:28:02,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:02,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:02,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:02,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:02,347 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 231 [2021-10-15 19:28:02,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 229 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:02,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:02,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 231 [2021-10-15 19:28:02,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:05,037 INFO L129 PetriNetUnfolder]: 5918/21666 cut-off events. [2021-10-15 19:28:05,037 INFO L130 PetriNetUnfolder]: For 6204/6204 co-relation queries the response was YES. [2021-10-15 19:28:05,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39832 conditions, 21666 events. 5918/21666 cut-off events. For 6204/6204 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 230018 event pairs, 26 based on Foata normal form. 0/18758 useless extension candidates. Maximal degree in co-relation 39780. Up to 1429 conditions per place. [2021-10-15 19:28:05,208 INFO L132 encePairwiseOnDemand]: 224/231 looper letters, 11 selfloop transitions, 3 changer transitions 0/230 dead transitions. [2021-10-15 19:28:05,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 230 transitions, 1104 flow [2021-10-15 19:28:05,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2021-10-15 19:28:05,211 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9134199134199135 [2021-10-15 19:28:05,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 633 transitions. [2021-10-15 19:28:05,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 633 transitions. [2021-10-15 19:28:05,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:05,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 633 transitions. [2021-10-15 19:28:05,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:05,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:05,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:05,217 INFO L186 Difference]: Start difference. First operand has 176 places, 229 transitions, 1074 flow. Second operand 3 states and 633 transitions. [2021-10-15 19:28:05,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 230 transitions, 1104 flow [2021-10-15 19:28:05,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 230 transitions, 1101 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:28:05,308 INFO L242 Difference]: Finished difference. Result has 179 places, 229 transitions, 1091 flow [2021-10-15 19:28:05,308 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1091, PETRI_PLACES=179, PETRI_TRANSITIONS=229} [2021-10-15 19:28:05,309 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 58 predicate places. [2021-10-15 19:28:05,309 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 229 transitions, 1091 flow [2021-10-15 19:28:05,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:05,310 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:05,310 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 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, 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] [2021-10-15 19:28:05,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-15 19:28:05,311 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:05,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:05,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1838711059, now seen corresponding path program 1 times [2021-10-15 19:28:05,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:05,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177403600] [2021-10-15 19:28:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:05,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 19:28:05,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:05,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177403600] [2021-10-15 19:28:05,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177403600] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:05,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:05,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:05,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407896307] [2021-10-15 19:28:05,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:05,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:05,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:05,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:05,356 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 231 [2021-10-15 19:28:05,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 229 transitions, 1091 flow. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:05,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:05,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 231 [2021-10-15 19:28:05,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:08,078 INFO L129 PetriNetUnfolder]: 5434/22043 cut-off events. [2021-10-15 19:28:08,078 INFO L130 PetriNetUnfolder]: For 6411/6411 co-relation queries the response was YES. [2021-10-15 19:28:08,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42180 conditions, 22043 events. 5434/22043 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 241705 event pairs, 2 based on Foata normal form. 0/19930 useless extension candidates. Maximal degree in co-relation 42127. Up to 1548 conditions per place. [2021-10-15 19:28:08,233 INFO L132 encePairwiseOnDemand]: 221/231 looper letters, 14 selfloop transitions, 5 changer transitions 0/233 dead transitions. [2021-10-15 19:28:08,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 233 transitions, 1137 flow [2021-10-15 19:28:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2021-10-15 19:28:08,237 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9134199134199135 [2021-10-15 19:28:08,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 633 transitions. [2021-10-15 19:28:08,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 633 transitions. [2021-10-15 19:28:08,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:08,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 633 transitions. [2021-10-15 19:28:08,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:08,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:08,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:08,242 INFO L186 Difference]: Start difference. First operand has 179 places, 229 transitions, 1091 flow. Second operand 3 states and 633 transitions. [2021-10-15 19:28:08,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 233 transitions, 1137 flow [2021-10-15 19:28:08,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 233 transitions, 1134 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:28:08,329 INFO L242 Difference]: Finished difference. Result has 182 places, 232 transitions, 1130 flow [2021-10-15 19:28:08,329 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=182, PETRI_TRANSITIONS=232} [2021-10-15 19:28:08,329 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 61 predicate places. [2021-10-15 19:28:08,329 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 232 transitions, 1130 flow [2021-10-15 19:28:08,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:08,330 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:08,330 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 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, 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, 1] [2021-10-15 19:28:08,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-15 19:28:08,330 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:08,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:08,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1648298057, now seen corresponding path program 1 times [2021-10-15 19:28:08,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:08,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801412237] [2021-10-15 19:28:08,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:08,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-15 19:28:08,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:08,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801412237] [2021-10-15 19:28:08,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801412237] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:08,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:08,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:08,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795736126] [2021-10-15 19:28:08,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:08,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:08,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:08,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:08,373 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 231 [2021-10-15 19:28:08,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 232 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:08,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:08,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 231 [2021-10-15 19:28:08,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:11,431 INFO L129 PetriNetUnfolder]: 5390/21999 cut-off events. [2021-10-15 19:28:11,432 INFO L130 PetriNetUnfolder]: For 7814/7814 co-relation queries the response was YES. [2021-10-15 19:28:11,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42330 conditions, 21999 events. 5390/21999 cut-off events. For 7814/7814 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 241666 event pairs, 2 based on Foata normal form. 12/19979 useless extension candidates. Maximal degree in co-relation 42276. Up to 1548 conditions per place. [2021-10-15 19:28:11,606 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 15 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2021-10-15 19:28:11,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 230 transitions, 1152 flow [2021-10-15 19:28:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2021-10-15 19:28:11,608 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8903318903318903 [2021-10-15 19:28:11,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 617 transitions. [2021-10-15 19:28:11,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 617 transitions. [2021-10-15 19:28:11,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:11,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 617 transitions. [2021-10-15 19:28:11,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:11,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:11,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:11,613 INFO L186 Difference]: Start difference. First operand has 182 places, 232 transitions, 1130 flow. Second operand 3 states and 617 transitions. [2021-10-15 19:28:11,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 230 transitions, 1152 flow [2021-10-15 19:28:11,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 230 transitions, 1147 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 19:28:11,689 INFO L242 Difference]: Finished difference. Result has 183 places, 230 transitions, 1117 flow [2021-10-15 19:28:11,690 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1117, PETRI_PLACES=183, PETRI_TRANSITIONS=230} [2021-10-15 19:28:11,690 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 62 predicate places. [2021-10-15 19:28:11,690 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 230 transitions, 1117 flow [2021-10-15 19:28:11,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:11,691 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:11,691 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 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, 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, 1] [2021-10-15 19:28:11,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-15 19:28:11,692 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2059863225, now seen corresponding path program 1 times [2021-10-15 19:28:11,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:11,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685971977] [2021-10-15 19:28:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:11,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-15 19:28:11,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:11,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685971977] [2021-10-15 19:28:11,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685971977] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:11,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:11,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:28:11,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839694051] [2021-10-15 19:28:11,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:28:11,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:28:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:28:11,768 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 231 [2021-10-15 19:28:11,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 230 transitions, 1117 flow. Second operand has 4 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:11,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:11,770 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 231 [2021-10-15 19:28:11,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:16,517 INFO L129 PetriNetUnfolder]: 8055/33358 cut-off events. [2021-10-15 19:28:16,517 INFO L130 PetriNetUnfolder]: For 11880/11880 co-relation queries the response was YES. [2021-10-15 19:28:16,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66798 conditions, 33358 events. 8055/33358 cut-off events. For 11880/11880 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 399162 event pairs, 0 based on Foata normal form. 96/30613 useless extension candidates. Maximal degree in co-relation 66744. Up to 2390 conditions per place. [2021-10-15 19:28:16,799 INFO L132 encePairwiseOnDemand]: 216/231 looper letters, 65 selfloop transitions, 18 changer transitions 17/284 dead transitions. [2021-10-15 19:28:16,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 284 transitions, 1537 flow [2021-10-15 19:28:16,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:28:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 19:28:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1001 transitions. [2021-10-15 19:28:16,804 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2021-10-15 19:28:16,804 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1001 transitions. [2021-10-15 19:28:16,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1001 transitions. [2021-10-15 19:28:16,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:16,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1001 transitions. [2021-10-15 19:28:16,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 200.2) internal successors, (1001), 5 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:16,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:16,812 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:16,812 INFO L186 Difference]: Start difference. First operand has 183 places, 230 transitions, 1117 flow. Second operand 5 states and 1001 transitions. [2021-10-15 19:28:16,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 284 transitions, 1537 flow [2021-10-15 19:28:17,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 284 transitions, 1506 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-10-15 19:28:17,019 INFO L242 Difference]: Finished difference. Result has 188 places, 233 transitions, 1234 flow [2021-10-15 19:28:17,020 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1234, PETRI_PLACES=188, PETRI_TRANSITIONS=233} [2021-10-15 19:28:17,020 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 67 predicate places. [2021-10-15 19:28:17,020 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 233 transitions, 1234 flow [2021-10-15 19:28:17,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:17,020 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:17,021 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:17,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-15 19:28:17,021 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:17,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1061949686, now seen corresponding path program 1 times [2021-10-15 19:28:17,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:17,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516667979] [2021-10-15 19:28:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:17,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-15 19:28:17,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:17,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516667979] [2021-10-15 19:28:17,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516667979] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:17,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:17,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:17,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168856720] [2021-10-15 19:28:17,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:17,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:17,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:17,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:17,063 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 231 [2021-10-15 19:28:17,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 233 transitions, 1234 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:17,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:17,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 231 [2021-10-15 19:28:17,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:21,329 INFO L129 PetriNetUnfolder]: 7475/31003 cut-off events. [2021-10-15 19:28:21,329 INFO L130 PetriNetUnfolder]: For 12327/12327 co-relation queries the response was YES. [2021-10-15 19:28:21,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62896 conditions, 31003 events. 7475/31003 cut-off events. For 12327/12327 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 364262 event pairs, 8 based on Foata normal form. 55/28742 useless extension candidates. Maximal degree in co-relation 62836. Up to 2266 conditions per place. [2021-10-15 19:28:21,622 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 11 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2021-10-15 19:28:21,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 227 transitions, 1234 flow [2021-10-15 19:28:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2021-10-15 19:28:21,625 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9033189033189033 [2021-10-15 19:28:21,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2021-10-15 19:28:21,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2021-10-15 19:28:21,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:21,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2021-10-15 19:28:21,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:21,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:21,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:21,630 INFO L186 Difference]: Start difference. First operand has 188 places, 233 transitions, 1234 flow. Second operand 3 states and 626 transitions. [2021-10-15 19:28:21,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 227 transitions, 1234 flow [2021-10-15 19:28:21,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 227 transitions, 1218 flow, removed 8 selfloop flow, removed 0 redundant places. [2021-10-15 19:28:21,872 INFO L242 Difference]: Finished difference. Result has 190 places, 227 transitions, 1200 flow [2021-10-15 19:28:21,873 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1200, PETRI_PLACES=190, PETRI_TRANSITIONS=227} [2021-10-15 19:28:21,873 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 69 predicate places. [2021-10-15 19:28:21,874 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 227 transitions, 1200 flow [2021-10-15 19:28:21,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:21,874 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:21,875 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:21,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-15 19:28:21,875 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:21,876 INFO L82 PathProgramCache]: Analyzing trace with hash 974466413, now seen corresponding path program 1 times [2021-10-15 19:28:21,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:21,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117427669] [2021-10-15 19:28:21,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:21,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-15 19:28:21,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:21,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117427669] [2021-10-15 19:28:21,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117427669] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:21,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:21,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:28:21,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835830696] [2021-10-15 19:28:21,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:28:21,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:21,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:28:21,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:28:21,941 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 231 [2021-10-15 19:28:21,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 227 transitions, 1200 flow. Second operand has 4 states, 4 states have (on average 185.25) internal successors, (741), 4 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:21,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:21,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 231 [2021-10-15 19:28:21,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:25,190 INFO L129 PetriNetUnfolder]: 4280/18917 cut-off events. [2021-10-15 19:28:25,190 INFO L130 PetriNetUnfolder]: For 8743/8743 co-relation queries the response was YES. [2021-10-15 19:28:25,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39436 conditions, 18917 events. 4280/18917 cut-off events. For 8743/8743 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 193097 event pairs, 4 based on Foata normal form. 9/17884 useless extension candidates. Maximal degree in co-relation 39373. Up to 1340 conditions per place. [2021-10-15 19:28:25,352 INFO L132 encePairwiseOnDemand]: 222/231 looper letters, 31 selfloop transitions, 29 changer transitions 0/232 dead transitions. [2021-10-15 19:28:25,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 232 transitions, 1343 flow [2021-10-15 19:28:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:28:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 19:28:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 937 transitions. [2021-10-15 19:28:25,356 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8112554112554112 [2021-10-15 19:28:25,356 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 937 transitions. [2021-10-15 19:28:25,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 937 transitions. [2021-10-15 19:28:25,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:25,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 937 transitions. [2021-10-15 19:28:25,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 187.4) internal successors, (937), 5 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:25,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:25,362 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:25,362 INFO L186 Difference]: Start difference. First operand has 190 places, 227 transitions, 1200 flow. Second operand 5 states and 937 transitions. [2021-10-15 19:28:25,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 232 transitions, 1343 flow [2021-10-15 19:28:25,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 232 transitions, 1332 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-10-15 19:28:25,459 INFO L242 Difference]: Finished difference. Result has 192 places, 226 transitions, 1250 flow [2021-10-15 19:28:25,460 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1250, PETRI_PLACES=192, PETRI_TRANSITIONS=226} [2021-10-15 19:28:25,460 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 71 predicate places. [2021-10-15 19:28:25,460 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 226 transitions, 1250 flow [2021-10-15 19:28:25,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 185.25) internal successors, (741), 4 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:25,461 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:25,461 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:25,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-15 19:28:25,462 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1837726559, now seen corresponding path program 1 times [2021-10-15 19:28:25,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:25,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929646491] [2021-10-15 19:28:25,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:25,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-15 19:28:25,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:25,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929646491] [2021-10-15 19:28:25,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929646491] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:25,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:25,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:25,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470906694] [2021-10-15 19:28:25,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:25,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:25,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:25,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:25,507 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 231 [2021-10-15 19:28:25,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 226 transitions, 1250 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:25,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:25,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 231 [2021-10-15 19:28:25,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:27,789 INFO L129 PetriNetUnfolder]: 4182/18750 cut-off events. [2021-10-15 19:28:27,790 INFO L130 PetriNetUnfolder]: For 8073/8073 co-relation queries the response was YES. [2021-10-15 19:28:27,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38451 conditions, 18750 events. 4182/18750 cut-off events. For 8073/8073 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 192447 event pairs, 4 based on Foata normal form. 49/17805 useless extension candidates. Maximal degree in co-relation 38388. Up to 1340 conditions per place. [2021-10-15 19:28:27,953 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 8 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2021-10-15 19:28:27,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 222 transitions, 1254 flow [2021-10-15 19:28:27,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2021-10-15 19:28:27,955 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-10-15 19:28:27,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2021-10-15 19:28:27,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2021-10-15 19:28:27,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:27,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2021-10-15 19:28:27,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:27,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:27,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:27,960 INFO L186 Difference]: Start difference. First operand has 192 places, 226 transitions, 1250 flow. Second operand 3 states and 627 transitions. [2021-10-15 19:28:27,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 222 transitions, 1254 flow [2021-10-15 19:28:28,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 222 transitions, 1252 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-10-15 19:28:28,035 INFO L242 Difference]: Finished difference. Result has 194 places, 222 transitions, 1240 flow [2021-10-15 19:28:28,035 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1240, PETRI_PLACES=194, PETRI_TRANSITIONS=222} [2021-10-15 19:28:28,036 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 73 predicate places. [2021-10-15 19:28:28,036 INFO L470 AbstractCegarLoop]: Abstraction has has 194 places, 222 transitions, 1240 flow [2021-10-15 19:28:28,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:28,036 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:28,037 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:28,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-15 19:28:28,037 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:28,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash 513383681, now seen corresponding path program 1 times [2021-10-15 19:28:28,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:28,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958738715] [2021-10-15 19:28:28,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:28,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-15 19:28:28,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:28,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958738715] [2021-10-15 19:28:28,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958738715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:28,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:28,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:28,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106543481] [2021-10-15 19:28:28,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:28,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:28,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:28,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:28,076 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 231 [2021-10-15 19:28:28,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 222 transitions, 1240 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:28,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:28,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 231 [2021-10-15 19:28:28,078 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:30,877 INFO L129 PetriNetUnfolder]: 4085/18595 cut-off events. [2021-10-15 19:28:30,877 INFO L130 PetriNetUnfolder]: For 8121/8121 co-relation queries the response was YES. [2021-10-15 19:28:30,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38249 conditions, 18595 events. 4085/18595 cut-off events. For 8121/8121 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 191967 event pairs, 6 based on Foata normal form. 49/17698 useless extension candidates. Maximal degree in co-relation 38183. Up to 1340 conditions per place. [2021-10-15 19:28:30,997 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 8 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2021-10-15 19:28:30,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 218 transitions, 1244 flow [2021-10-15 19:28:30,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2021-10-15 19:28:30,999 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-10-15 19:28:30,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2021-10-15 19:28:31,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2021-10-15 19:28:31,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:31,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2021-10-15 19:28:31,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:31,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:31,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:31,003 INFO L186 Difference]: Start difference. First operand has 194 places, 222 transitions, 1240 flow. Second operand 3 states and 627 transitions. [2021-10-15 19:28:31,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 218 transitions, 1244 flow [2021-10-15 19:28:31,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 218 transitions, 1240 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-10-15 19:28:31,094 INFO L242 Difference]: Finished difference. Result has 195 places, 218 transitions, 1228 flow [2021-10-15 19:28:31,094 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=195, PETRI_TRANSITIONS=218} [2021-10-15 19:28:31,094 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 74 predicate places. [2021-10-15 19:28:31,094 INFO L470 AbstractCegarLoop]: Abstraction has has 195 places, 218 transitions, 1228 flow [2021-10-15 19:28:31,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:31,095 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:31,095 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:31,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-15 19:28:31,096 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:31,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:31,096 INFO L82 PathProgramCache]: Analyzing trace with hash -859584689, now seen corresponding path program 1 times [2021-10-15 19:28:31,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:31,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068981088] [2021-10-15 19:28:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:31,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-15 19:28:31,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:31,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068981088] [2021-10-15 19:28:31,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068981088] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:31,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:31,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:28:31,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298087587] [2021-10-15 19:28:31,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:28:31,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:31,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:28:31,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:28:31,154 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 231 [2021-10-15 19:28:31,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 218 transitions, 1228 flow. Second operand has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:31,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:31,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 231 [2021-10-15 19:28:31,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:32,470 INFO L129 PetriNetUnfolder]: 1959/10277 cut-off events. [2021-10-15 19:28:32,470 INFO L130 PetriNetUnfolder]: For 6179/6179 co-relation queries the response was YES. [2021-10-15 19:28:32,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21895 conditions, 10277 events. 1959/10277 cut-off events. For 6179/6179 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 95866 event pairs, 4 based on Foata normal form. 9/9940 useless extension candidates. Maximal degree in co-relation 21827. Up to 788 conditions per place. [2021-10-15 19:28:32,558 INFO L132 encePairwiseOnDemand]: 223/231 looper letters, 24 selfloop transitions, 40 changer transitions 0/229 dead transitions. [2021-10-15 19:28:32,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 229 transitions, 1492 flow [2021-10-15 19:28:32,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:28:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 19:28:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 951 transitions. [2021-10-15 19:28:32,560 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8233766233766234 [2021-10-15 19:28:32,560 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 951 transitions. [2021-10-15 19:28:32,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 951 transitions. [2021-10-15 19:28:32,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:32,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 951 transitions. [2021-10-15 19:28:32,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 190.2) internal successors, (951), 5 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:32,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:32,564 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:32,564 INFO L186 Difference]: Start difference. First operand has 195 places, 218 transitions, 1228 flow. Second operand 5 states and 951 transitions. [2021-10-15 19:28:32,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 229 transitions, 1492 flow [2021-10-15 19:28:32,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 229 transitions, 1484 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-10-15 19:28:32,605 INFO L242 Difference]: Finished difference. Result has 198 places, 225 transitions, 1424 flow [2021-10-15 19:28:32,606 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1424, PETRI_PLACES=198, PETRI_TRANSITIONS=225} [2021-10-15 19:28:32,606 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 77 predicate places. [2021-10-15 19:28:32,606 INFO L470 AbstractCegarLoop]: Abstraction has has 198 places, 225 transitions, 1424 flow [2021-10-15 19:28:32,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:32,607 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:32,607 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:32,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-15 19:28:32,608 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:32,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:32,608 INFO L82 PathProgramCache]: Analyzing trace with hash 942142116, now seen corresponding path program 1 times [2021-10-15 19:28:32,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:32,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327471445] [2021-10-15 19:28:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:32,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-15 19:28:32,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:32,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327471445] [2021-10-15 19:28:32,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327471445] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:32,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:32,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 19:28:32,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428085543] [2021-10-15 19:28:32,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 19:28:32,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:32,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 19:28:32,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-15 19:28:32,892 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 231 [2021-10-15 19:28:32,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 225 transitions, 1424 flow. Second operand has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:32,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:32,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 231 [2021-10-15 19:28:32,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:33,548 INFO L129 PetriNetUnfolder]: 598/3873 cut-off events. [2021-10-15 19:28:33,548 INFO L130 PetriNetUnfolder]: For 3122/3122 co-relation queries the response was YES. [2021-10-15 19:28:33,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8362 conditions, 3873 events. 598/3873 cut-off events. For 3122/3122 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 26689 event pairs, 2 based on Foata normal form. 9/3843 useless extension candidates. Maximal degree in co-relation 8293. Up to 317 conditions per place. [2021-10-15 19:28:33,572 INFO L132 encePairwiseOnDemand]: 223/231 looper letters, 24 selfloop transitions, 45 changer transitions 0/227 dead transitions. [2021-10-15 19:28:33,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 227 transitions, 1573 flow [2021-10-15 19:28:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 19:28:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 19:28:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 951 transitions. [2021-10-15 19:28:33,574 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8233766233766234 [2021-10-15 19:28:33,574 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 951 transitions. [2021-10-15 19:28:33,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 951 transitions. [2021-10-15 19:28:33,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:33,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 951 transitions. [2021-10-15 19:28:33,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 190.2) internal successors, (951), 5 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:33,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:33,578 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:33,578 INFO L186 Difference]: Start difference. First operand has 198 places, 225 transitions, 1424 flow. Second operand 5 states and 951 transitions. [2021-10-15 19:28:33,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 227 transitions, 1573 flow [2021-10-15 19:28:33,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 227 transitions, 1548 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-10-15 19:28:33,607 INFO L242 Difference]: Finished difference. Result has 199 places, 223 transitions, 1486 flow [2021-10-15 19:28:33,608 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1486, PETRI_PLACES=199, PETRI_TRANSITIONS=223} [2021-10-15 19:28:33,608 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 78 predicate places. [2021-10-15 19:28:33,608 INFO L470 AbstractCegarLoop]: Abstraction has has 199 places, 223 transitions, 1486 flow [2021-10-15 19:28:33,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:33,609 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:33,609 INFO L254 CegarLoopForPetriNet]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:33,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-15 19:28:33,610 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash -296411263, now seen corresponding path program 1 times [2021-10-15 19:28:33,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:33,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135402095] [2021-10-15 19:28:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:33,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-15 19:28:33,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:33,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135402095] [2021-10-15 19:28:33,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135402095] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:33,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:33,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:33,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759434753] [2021-10-15 19:28:33,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:33,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:33,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:33,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:33,652 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 231 [2021-10-15 19:28:33,652 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 223 transitions, 1486 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:33,652 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:33,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 231 [2021-10-15 19:28:33,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:34,343 INFO L129 PetriNetUnfolder]: 529/3730 cut-off events. [2021-10-15 19:28:34,343 INFO L130 PetriNetUnfolder]: For 2187/2187 co-relation queries the response was YES. [2021-10-15 19:28:34,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7590 conditions, 3730 events. 529/3730 cut-off events. For 2187/2187 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 25840 event pairs, 2 based on Foata normal form. 50/3741 useless extension candidates. Maximal degree in co-relation 7521. Up to 277 conditions per place. [2021-10-15 19:28:34,369 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 12 selfloop transitions, 18 changer transitions 0/197 dead transitions. [2021-10-15 19:28:34,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 197 transitions, 1158 flow [2021-10-15 19:28:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:34,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 596 transitions. [2021-10-15 19:28:34,370 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.86002886002886 [2021-10-15 19:28:34,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 596 transitions. [2021-10-15 19:28:34,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 596 transitions. [2021-10-15 19:28:34,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:34,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 596 transitions. [2021-10-15 19:28:34,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:34,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:34,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:34,373 INFO L186 Difference]: Start difference. First operand has 199 places, 223 transitions, 1486 flow. Second operand 3 states and 596 transitions. [2021-10-15 19:28:34,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 197 transitions, 1158 flow [2021-10-15 19:28:34,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 197 transitions, 1088 flow, removed 19 selfloop flow, removed 5 redundant places. [2021-10-15 19:28:34,393 INFO L242 Difference]: Finished difference. Result has 196 places, 197 transitions, 1064 flow [2021-10-15 19:28:34,393 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=196, PETRI_TRANSITIONS=197} [2021-10-15 19:28:34,394 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 75 predicate places. [2021-10-15 19:28:34,394 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 197 transitions, 1064 flow [2021-10-15 19:28:34,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:34,394 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:34,395 INFO L254 CegarLoopForPetriNet]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:34,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-15 19:28:34,395 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:34,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1619025336, now seen corresponding path program 1 times [2021-10-15 19:28:34,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:34,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595925553] [2021-10-15 19:28:34,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:34,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-15 19:28:34,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:34,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595925553] [2021-10-15 19:28:34,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595925553] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:34,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:34,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:34,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320532440] [2021-10-15 19:28:34,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:34,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:34,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:34,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:34,442 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 231 [2021-10-15 19:28:34,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 197 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:34,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:34,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 231 [2021-10-15 19:28:34,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:35,503 INFO L129 PetriNetUnfolder]: 643/4921 cut-off events. [2021-10-15 19:28:35,504 INFO L130 PetriNetUnfolder]: For 2768/2768 co-relation queries the response was YES. [2021-10-15 19:28:35,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9889 conditions, 4921 events. 643/4921 cut-off events. For 2768/2768 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 37684 event pairs, 4 based on Foata normal form. 70/4930 useless extension candidates. Maximal degree in co-relation 9825. Up to 375 conditions per place. [2021-10-15 19:28:35,531 INFO L132 encePairwiseOnDemand]: 224/231 looper letters, 16 selfloop transitions, 10 changer transitions 0/204 dead transitions. [2021-10-15 19:28:35,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 204 transitions, 1204 flow [2021-10-15 19:28:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2021-10-15 19:28:35,532 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2021-10-15 19:28:35,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2021-10-15 19:28:35,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2021-10-15 19:28:35,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:35,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2021-10-15 19:28:35,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:35,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:35,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:35,535 INFO L186 Difference]: Start difference. First operand has 196 places, 197 transitions, 1064 flow. Second operand 3 states and 645 transitions. [2021-10-15 19:28:35,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 204 transitions, 1204 flow [2021-10-15 19:28:35,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 204 transitions, 1158 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:28:35,553 INFO L242 Difference]: Finished difference. Result has 198 places, 204 transitions, 1164 flow [2021-10-15 19:28:35,554 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1164, PETRI_PLACES=198, PETRI_TRANSITIONS=204} [2021-10-15 19:28:35,554 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 77 predicate places. [2021-10-15 19:28:35,554 INFO L470 AbstractCegarLoop]: Abstraction has has 198 places, 204 transitions, 1164 flow [2021-10-15 19:28:35,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:35,554 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:35,555 INFO L254 CegarLoopForPetriNet]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:35,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-15 19:28:35,555 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:35,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:35,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1389239494, now seen corresponding path program 1 times [2021-10-15 19:28:35,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:35,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361750743] [2021-10-15 19:28:35,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:35,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-10-15 19:28:35,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:35,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361750743] [2021-10-15 19:28:35,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361750743] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:35,601 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:35,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:35,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280975697] [2021-10-15 19:28:35,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:35,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:35,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:35,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:35,604 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 231 [2021-10-15 19:28:35,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 204 transitions, 1164 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:35,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:35,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 231 [2021-10-15 19:28:35,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:36,350 INFO L129 PetriNetUnfolder]: 411/3396 cut-off events. [2021-10-15 19:28:36,351 INFO L130 PetriNetUnfolder]: For 2253/2253 co-relation queries the response was YES. [2021-10-15 19:28:36,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7107 conditions, 3396 events. 411/3396 cut-off events. For 2253/2253 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 23245 event pairs, 2 based on Foata normal form. 70/3427 useless extension candidates. Maximal degree in co-relation 7039. Up to 269 conditions per place. [2021-10-15 19:28:36,373 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 11 selfloop transitions, 8 changer transitions 0/195 dead transitions. [2021-10-15 19:28:36,373 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 195 transitions, 1106 flow [2021-10-15 19:28:36,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 603 transitions. [2021-10-15 19:28:36,375 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8701298701298701 [2021-10-15 19:28:36,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 603 transitions. [2021-10-15 19:28:36,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 603 transitions. [2021-10-15 19:28:36,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:36,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 603 transitions. [2021-10-15 19:28:36,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:36,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:36,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:36,378 INFO L186 Difference]: Start difference. First operand has 198 places, 204 transitions, 1164 flow. Second operand 3 states and 603 transitions. [2021-10-15 19:28:36,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 195 transitions, 1106 flow [2021-10-15 19:28:36,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 195 transitions, 1068 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-10-15 19:28:36,398 INFO L242 Difference]: Finished difference. Result has 196 places, 195 transitions, 1046 flow [2021-10-15 19:28:36,398 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1046, PETRI_PLACES=196, PETRI_TRANSITIONS=195} [2021-10-15 19:28:36,399 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 75 predicate places. [2021-10-15 19:28:36,399 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 195 transitions, 1046 flow [2021-10-15 19:28:36,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:36,399 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:36,400 INFO L254 CegarLoopForPetriNet]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:36,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-15 19:28:36,400 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:36,401 INFO L82 PathProgramCache]: Analyzing trace with hash -487243324, now seen corresponding path program 1 times [2021-10-15 19:28:36,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:36,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063507449] [2021-10-15 19:28:36,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:36,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-10-15 19:28:36,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:36,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063507449] [2021-10-15 19:28:36,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063507449] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:36,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:36,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:36,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017361385] [2021-10-15 19:28:36,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:36,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:36,451 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 231 [2021-10-15 19:28:36,451 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 195 transitions, 1046 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:36,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:36,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 231 [2021-10-15 19:28:36,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:37,074 INFO L129 PetriNetUnfolder]: 405/3390 cut-off events. [2021-10-15 19:28:37,074 INFO L130 PetriNetUnfolder]: For 1695/1695 co-relation queries the response was YES. [2021-10-15 19:28:37,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6848 conditions, 3390 events. 405/3390 cut-off events. For 1695/1695 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 23216 event pairs, 2 based on Foata normal form. 0/3357 useless extension candidates. Maximal degree in co-relation 6783. Up to 269 conditions per place. [2021-10-15 19:28:37,096 INFO L132 encePairwiseOnDemand]: 226/231 looper letters, 10 selfloop transitions, 7 changer transitions 0/194 dead transitions. [2021-10-15 19:28:37,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 194 transitions, 1076 flow [2021-10-15 19:28:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2021-10-15 19:28:37,097 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8932178932178932 [2021-10-15 19:28:37,097 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 619 transitions. [2021-10-15 19:28:37,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 619 transitions. [2021-10-15 19:28:37,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:37,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 619 transitions. [2021-10-15 19:28:37,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:37,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:37,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:37,100 INFO L186 Difference]: Start difference. First operand has 196 places, 195 transitions, 1046 flow. Second operand 3 states and 619 transitions. [2021-10-15 19:28:37,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 194 transitions, 1076 flow [2021-10-15 19:28:37,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 194 transitions, 1060 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 19:28:37,116 INFO L242 Difference]: Finished difference. Result has 196 places, 194 transitions, 1040 flow [2021-10-15 19:28:37,116 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=196, PETRI_TRANSITIONS=194} [2021-10-15 19:28:37,116 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 75 predicate places. [2021-10-15 19:28:37,116 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 194 transitions, 1040 flow [2021-10-15 19:28:37,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:37,117 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:37,117 INFO L254 CegarLoopForPetriNet]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:37,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-15 19:28:37,118 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:37,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash -471724606, now seen corresponding path program 1 times [2021-10-15 19:28:37,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:37,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199467928] [2021-10-15 19:28:37,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:37,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 19:28:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-15 19:28:37,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 19:28:37,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199467928] [2021-10-15 19:28:37,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199467928] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 19:28:37,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 19:28:37,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 19:28:37,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105765211] [2021-10-15 19:28:37,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 19:28:37,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 19:28:37,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 19:28:37,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 19:28:37,171 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 231 [2021-10-15 19:28:37,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 194 transitions, 1040 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:37,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 19:28:37,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 231 [2021-10-15 19:28:37,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 19:28:37,611 INFO L129 PetriNetUnfolder]: 234/2124 cut-off events. [2021-10-15 19:28:37,611 INFO L130 PetriNetUnfolder]: For 948/948 co-relation queries the response was YES. [2021-10-15 19:28:37,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4224 conditions, 2124 events. 234/2124 cut-off events. For 948/948 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 11457 event pairs, 0 based on Foata normal form. 6/2113 useless extension candidates. Maximal degree in co-relation 4157. Up to 172 conditions per place. [2021-10-15 19:28:37,623 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 13 selfloop transitions, 3 changer transitions 0/188 dead transitions. [2021-10-15 19:28:37,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 188 transitions, 1004 flow [2021-10-15 19:28:37,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 19:28:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 19:28:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2021-10-15 19:28:37,625 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8946608946608947 [2021-10-15 19:28:37,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 620 transitions. [2021-10-15 19:28:37,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 620 transitions. [2021-10-15 19:28:37,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 19:28:37,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 620 transitions. [2021-10-15 19:28:37,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:37,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:37,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:37,629 INFO L186 Difference]: Start difference. First operand has 196 places, 194 transitions, 1040 flow. Second operand 3 states and 620 transitions. [2021-10-15 19:28:37,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 188 transitions, 1004 flow [2021-10-15 19:28:37,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 188 transitions, 976 flow, removed 11 selfloop flow, removed 1 redundant places. [2021-10-15 19:28:37,643 INFO L242 Difference]: Finished difference. Result has 198 places, 188 transitions, 957 flow [2021-10-15 19:28:37,643 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=957, PETRI_PLACES=198, PETRI_TRANSITIONS=188} [2021-10-15 19:28:37,643 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 77 predicate places. [2021-10-15 19:28:37,643 INFO L470 AbstractCegarLoop]: Abstraction has has 198 places, 188 transitions, 957 flow [2021-10-15 19:28:37,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-15 19:28:37,644 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 19:28:37,644 INFO L254 CegarLoopForPetriNet]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 19:28:37,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-15 19:28:37,644 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 19:28:37,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 19:28:37,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1772258692, now seen corresponding path program 1 times [2021-10-15 19:28:37,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 19:28:37,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58465784] [2021-10-15 19:28:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 19:28:37,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 19:28:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 19:28:37,670 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-15 19:28:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 19:28:37,786 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-15 19:28:37,786 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-15 19:28:37,787 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-15 19:28:37,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-15 19:28:37,797 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-15 19:28:38,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 07:28:38 BoogieIcfgContainer [2021-10-15 19:28:38,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-15 19:28:38,234 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-15 19:28:38,235 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-15 19:28:38,235 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-15 19:28:38,235 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 07:27:37" (3/4) ... [2021-10-15 19:28:38,238 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-15 19:28:38,509 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/witness.graphml [2021-10-15 19:28:38,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-15 19:28:38,512 INFO L168 Benchmark]: Toolchain (without parser) took 62650.28 ms. Allocated memory was 104.9 MB in the beginning and 13.7 GB in the end (delta: 13.6 GB). Free memory was 68.3 MB in the beginning and 11.2 GB in the end (delta: -11.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 16.1 GB. [2021-10-15 19:28:38,512 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 104.9 MB. Free memory was 85.1 MB in the beginning and 85.1 MB in the end (delta: 72.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-15 19:28:38,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.86 ms. Allocated memory is still 104.9 MB. Free memory was 68.1 MB in the beginning and 78.6 MB in the end (delta: -10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-15 19:28:38,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.18 ms. Allocated memory is still 104.9 MB. Free memory was 78.6 MB in the beginning and 76.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-15 19:28:38,514 INFO L168 Benchmark]: Boogie Preprocessor took 65.98 ms. Allocated memory is still 104.9 MB. Free memory was 76.1 MB in the beginning and 74.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-15 19:28:38,514 INFO L168 Benchmark]: RCFGBuilder took 615.70 ms. Allocated memory is still 104.9 MB. Free memory was 74.1 MB in the beginning and 54.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-15 19:28:38,520 INFO L168 Benchmark]: TraceAbstraction took 60971.86 ms. Allocated memory was 104.9 MB in the beginning and 13.7 GB in the end (delta: 13.6 GB). Free memory was 54.1 MB in the beginning and 11.3 GB in the end (delta: -11.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 16.1 GB. [2021-10-15 19:28:38,521 INFO L168 Benchmark]: Witness Printer took 274.59 ms. Allocated memory is still 13.7 GB. Free memory was 11.3 GB in the beginning and 11.2 GB in the end (delta: 36.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2021-10-15 19:28:38,523 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.27 ms. Allocated memory is still 104.9 MB. Free memory was 85.1 MB in the beginning and 85.1 MB in the end (delta: 72.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 612.86 ms. Allocated memory is still 104.9 MB. Free memory was 68.1 MB in the beginning and 78.6 MB in the end (delta: -10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 101.18 ms. Allocated memory is still 104.9 MB. Free memory was 78.6 MB in the beginning and 76.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 65.98 ms. Allocated memory is still 104.9 MB. Free memory was 76.1 MB in the beginning and 74.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 615.70 ms. Allocated memory is still 104.9 MB. Free memory was 74.1 MB in the beginning and 54.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 60971.86 ms. Allocated memory was 104.9 MB in the beginning and 13.7 GB in the end (delta: 13.6 GB). Free memory was 54.1 MB in the beginning and 11.3 GB in the end (delta: -11.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 16.1 GB. * Witness Printer took 274.59 ms. Allocated memory is still 13.7 GB. Free memory was 11.3 GB in the beginning and 11.2 GB in the end (delta: 36.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L396] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L475] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L484] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L493] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L502] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L507] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L512] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L517] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L129] COND TRUE (int )c1_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L174] COND TRUE (int )c2_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L219] COND TRUE (int )wb_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L540] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L551] kernel_st = 3 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L567] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L572] COND TRUE (int )e_wl == 0 [L573] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L578] COND TRUE (int )e_wl == 1 [L579] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L595] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L596] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L604] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L605] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L613] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L614] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L622] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L627] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L632] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L637] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L642] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L647] COND TRUE (int )e_wl == 1 [L648] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L85] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L129] COND FALSE !((int )c1_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L132] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L147] COND TRUE ! processed [L148] data += 1 [L149] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L150] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L151] COND TRUE (int )e_g == 1 [L152] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L159] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L174] COND FALSE !((int )c2_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L177] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L192] COND TRUE ! processed [L193] data += 1 [L194] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L195] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L196] COND TRUE (int )e_g == 1 [L197] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L204] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L219] COND FALSE !((int )wb_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L222] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L237] c_t = data [L238] c_req_up = 1 [L239] processed = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L540] COND TRUE (int )c_req_up == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L541] COND TRUE c != c_t [L542] c = c_t [L543] e_c = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L547] c_req_up = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L551] kernel_st = 3 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L567] COND TRUE (int )e_c == 0 [L568] e_c = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L572] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L585] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L586] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L595] COND TRUE (int )c1_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L596] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L604] COND TRUE (int )c2_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L613] COND TRUE (int )wb_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L614] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L622] COND TRUE (int )e_c == 1 [L623] r_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L627] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L632] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L637] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L642] COND TRUE (int )e_c == 1 [L643] e_c = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L647] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L655] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L658] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L661] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L533] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L339] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L354] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND TRUE (int )r_st == 0 [L371] tmp___3 = __VERIFIER_nondet_int() [L373] COND TRUE \read(tmp___3) [L375] r_st = 1 [L251] d = c [L252] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L253] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L261] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L262] COND TRUE (int )e_e == 1 [L263] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L271] e_e = 2 [L272] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L15] reach_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 38.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 60439.7ms, OverallIterations: 35, TraceHistogramMax: 6, EmptinessCheckTime: 0.0ms, AutomataDifference: 57194.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 159.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 370 SDtfs, 598 SDslu, 57 SDs, 0 SdLazy, 730 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 993.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 348.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1486occurred in iteration=29, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 159.3ms SsaConstructionTime, 510.9ms SatisfiabilityAnalysisTime, 1735.1ms InterpolantComputationTime, 3119 NumberOfCodeBlocks, 3119 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2901 ConstructedInterpolants, 0 QuantifiedInterpolants, 4596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 955/955 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-15 19:28:38,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1e1380e-bf4d-4010-905d-0522ce256f9e/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...