/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:45:36,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:45:36,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:45:36,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:45:36,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:45:36,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:45:36,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:45:36,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:45:36,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:45:36,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:45:36,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:45:36,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:45:36,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:45:36,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:45:36,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:45:36,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:45:36,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:45:36,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:45:36,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:45:36,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:45:36,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:45:36,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:45:36,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:45:36,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:45:36,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:45:36,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:45:36,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:45:36,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:45:36,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:45:36,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:45:36,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:45:36,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:45:36,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:45:36,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:45:36,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:45:36,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:45:36,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:45:36,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:45:36,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:45:36,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:45:36,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:45:36,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 04:45:36,615 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:45:36,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:45:36,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:45:36,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:45:36,619 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:45:36,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:45:36,619 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:45:36,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:45:36,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:45:36,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:45:36,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:45:36,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:45:36,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:45:36,621 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:45:36,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:45:36,621 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:45:36,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:45:36,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:45:36,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:45:36,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:45:36,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:45:36,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:45:36,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:45:36,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:45:36,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:45:36,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:45:36,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:45:36,623 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:45:36,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:45:36,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:45:36,623 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:45:36,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:45:36,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:45:36,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:45:36,943 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:45:36,944 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:45:36,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i [2021-03-25 04:45:37,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d7f54de/b6bc1c89e5844bf6986c2897c3dab494/FLAGaebb9d228 [2021-03-25 04:45:37,494 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:45:37,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i [2021-03-25 04:45:37,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d7f54de/b6bc1c89e5844bf6986c2897c3dab494/FLAGaebb9d228 [2021-03-25 04:45:38,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d7f54de/b6bc1c89e5844bf6986c2897c3dab494 [2021-03-25 04:45:38,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:45:38,023 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:45:38,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:45:38,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:45:38,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:45:38,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:45:38" (1/1) ... [2021-03-25 04:45:38,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743195e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38, skipping insertion in model container [2021-03-25 04:45:38,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:45:38" (1/1) ... [2021-03-25 04:45:38,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:45:38,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:45:38,239 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i[950,963] [2021-03-25 04:45:38,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:45:38,467 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:45:38,478 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i[950,963] [2021-03-25 04:45:38,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:45:38,609 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:45:38,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38 WrapperNode [2021-03-25 04:45:38,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:45:38,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:45:38,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:45:38,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:45:38,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38" (1/1) ... [2021-03-25 04:45:38,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38" (1/1) ... [2021-03-25 04:45:38,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:45:38,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:45:38,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:45:38,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:45:38,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38" (1/1) ... [2021-03-25 04:45:38,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38" (1/1) ... [2021-03-25 04:45:38,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38" (1/1) ... [2021-03-25 04:45:38,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38" (1/1) ... [2021-03-25 04:45:38,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38" (1/1) ... [2021-03-25 04:45:38,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38" (1/1) ... [2021-03-25 04:45:38,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38" (1/1) ... [2021-03-25 04:45:38,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:45:38,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:45:38,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:45:38,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:45:38,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:45:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:45:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:45:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:45:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:45:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:45:38,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:45:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:45:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:45:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:45:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:45:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:45:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:45:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:45:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:45:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:45:38,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:45:38,825 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:45:40,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:45:40,504 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:45:40,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:45:40 BoogieIcfgContainer [2021-03-25 04:45:40,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:45:40,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:45:40,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:45:40,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:45:40,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:45:38" (1/3) ... [2021-03-25 04:45:40,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3166571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:45:40, skipping insertion in model container [2021-03-25 04:45:40,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:38" (2/3) ... [2021-03-25 04:45:40,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3166571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:45:40, skipping insertion in model container [2021-03-25 04:45:40,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:45:40" (3/3) ... [2021-03-25 04:45:40,513 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_power.opt.i [2021-03-25 04:45:40,519 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:45:40,523 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:45:40,524 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:45:40,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,565 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,565 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,565 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,565 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,567 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,567 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,567 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,567 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,569 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,569 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,569 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,574 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,574 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,577 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,580 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,580 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,582 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,582 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,583 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,584 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,585 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,595 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,595 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,595 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,595 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,596 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:40,597 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:45:40,614 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:45:40,631 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:45:40,631 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:45:40,631 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:45:40,631 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:45:40,631 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:45:40,631 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:45:40,632 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:45:40,632 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:45:40,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 04:45:40,687 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 04:45:40,688 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:40,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 04:45:40,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 04:45:40,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-25 04:45:40,704 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:40,714 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 04:45:40,719 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 04:45:40,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-25 04:45:40,757 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 04:45:40,758 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:40,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 04:45:40,762 INFO L142 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-25 04:45:41,262 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2021-03-25 04:45:41,984 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:45:42,406 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-25 04:45:42,543 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 04:45:43,212 WARN L205 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-25 04:45:43,525 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:45:44,787 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-25 04:45:45,423 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:45:46,439 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:45:46,725 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:45:47,339 WARN L205 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:45:47,994 WARN L205 SmtUtils]: Spent 654.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:45:48,174 INFO L154 LiptonReduction]: Checked pairs total: 4166 [2021-03-25 04:45:48,174 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-25 04:45:48,176 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7473 [2021-03-25 04:45:48,184 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 04:45:48,184 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:48,184 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:48,185 INFO L263 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] [2021-03-25 04:45:48,185 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:48,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:48,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1459371111, now seen corresponding path program 1 times [2021-03-25 04:45:48,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:48,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611448843] [2021-03-25 04:45:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:48,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:48,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:48,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:48,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:48,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611448843] [2021-03-25 04:45:48,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:48,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:45:48,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481276889] [2021-03-25 04:45:48,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:45:48,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:45:48,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:45:48,498 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191 [2021-03-25 04:45:48,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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-03-25 04:45:48,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:48,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191 [2021-03-25 04:45:48,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:48,581 INFO L129 PetriNetUnfolder]: 23/111 cut-off events. [2021-03-25 04:45:48,581 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:48,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 111 events. 23/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 394 event pairs, 3 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 148. Up to 37 conditions per place. [2021-03-25 04:45:48,584 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 7 selfloop transitions, 2 changer transitions 5/49 dead transitions. [2021-03-25 04:45:48,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 132 flow [2021-03-25 04:45:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:45:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:45:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2021-03-25 04:45:48,601 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9144851657940664 [2021-03-25 04:45:48,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2021-03-25 04:45:48,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2021-03-25 04:45:48,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:48,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2021-03-25 04:45:48,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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-03-25 04:45:48,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 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-03-25 04:45:48,618 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 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-03-25 04:45:48,620 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 3 states and 524 transitions. [2021-03-25 04:45:48,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 132 flow [2021-03-25 04:45:48,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:45:48,624 INFO L241 Difference]: Finished difference. Result has 56 places, 41 transitions, 94 flow [2021-03-25 04:45:48,625 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2021-03-25 04:45:48,626 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-25 04:45:48,626 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:48,626 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-25 04:45:48,627 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-25 04:45:48,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2021-03-25 04:45:48,638 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-25 04:45:48,638 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:48,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:45:48,640 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-25 04:45:48,985 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-25 04:45:49,281 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-25 04:45:49,899 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 04:45:50,549 WARN L205 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 04:45:51,224 INFO L154 LiptonReduction]: Checked pairs total: 1348 [2021-03-25 04:45:51,224 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 04:45:51,224 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2598 [2021-03-25 04:45:51,225 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2021-03-25 04:45:51,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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-03-25 04:45:51,225 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:51,225 INFO L263 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] [2021-03-25 04:45:51,226 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:45:51,226 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:51,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1826671133, now seen corresponding path program 1 times [2021-03-25 04:45:51,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:51,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572313083] [2021-03-25 04:45:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:51,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:51,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:51,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:51,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:51,335 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:45:51,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:45:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:51,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572313083] [2021-03-25 04:45:51,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:51,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:51,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664554297] [2021-03-25 04:45:51,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:45:51,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:51,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:45:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:45:51,343 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 202 [2021-03-25 04:45:51,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 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-03-25 04:45:51,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:51,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 202 [2021-03-25 04:45:51,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:51,360 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-25 04:45:51,360 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:51,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:45:51,361 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 1 selfloop transitions, 2 changer transitions 1/30 dead transitions. [2021-03-25 04:45:51,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 78 flow [2021-03-25 04:45:51,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:45:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:45:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2021-03-25 04:45:51,363 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8927392739273927 [2021-03-25 04:45:51,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2021-03-25 04:45:51,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2021-03-25 04:45:51,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:51,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2021-03-25 04:45:51,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 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-03-25 04:45:51,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 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-03-25 04:45:51,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 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-03-25 04:45:51,367 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 3 states and 541 transitions. [2021-03-25 04:45:51,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 78 flow [2021-03-25 04:45:51,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:45:51,368 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 74 flow [2021-03-25 04:45:51,368 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2021-03-25 04:45:51,369 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -18 predicate places. [2021-03-25 04:45:51,369 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:51,369 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 74 flow [2021-03-25 04:45:51,369 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 29 transitions, 74 flow [2021-03-25 04:45:51,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 74 flow [2021-03-25 04:45:51,373 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-25 04:45:51,373 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:51,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:45:51,374 INFO L142 LiptonReduction]: Number of co-enabled transitions 328 [2021-03-25 04:45:52,365 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:45:52,514 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:45:52,853 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:45:53,004 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:45:53,012 INFO L154 LiptonReduction]: Checked pairs total: 1088 [2021-03-25 04:45:53,013 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:45:53,013 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1644 [2021-03-25 04:45:53,013 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2021-03-25 04:45:53,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 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-03-25 04:45:53,014 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:53,014 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:53,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:45:53,014 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:53,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:53,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1551181553, now seen corresponding path program 1 times [2021-03-25 04:45:53,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:53,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555343104] [2021-03-25 04:45:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:53,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:53,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:53,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555343104] [2021-03-25 04:45:53,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:53,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:45:53,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954744658] [2021-03-25 04:45:53,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:45:53,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:53,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:45:53,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:45:53,076 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 206 [2021-03-25 04:45:53,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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-03-25 04:45:53,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:53,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 206 [2021-03-25 04:45:53,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:53,110 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-25 04:45:53,110 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 04:45:53,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 35 events. 3/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-03-25 04:45:53,111 INFO L132 encePairwiseOnDemand]: 202/206 looper letters, 3 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2021-03-25 04:45:53,111 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 82 flow [2021-03-25 04:45:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:45:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:45:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2021-03-25 04:45:53,115 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9093851132686084 [2021-03-25 04:45:53,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2021-03-25 04:45:53,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2021-03-25 04:45:53,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:53,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2021-03-25 04:45:53,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 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-03-25 04:45:53,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-03-25 04:45:53,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-03-25 04:45:53,118 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 3 states and 562 transitions. [2021-03-25 04:45:53,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 82 flow [2021-03-25 04:45:53,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:45:53,120 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 81 flow [2021-03-25 04:45:53,120 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2021-03-25 04:45:53,120 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -22 predicate places. [2021-03-25 04:45:53,120 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:53,120 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 81 flow [2021-03-25 04:45:53,121 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 81 flow [2021-03-25 04:45:53,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 81 flow [2021-03-25 04:45:53,126 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-25 04:45:53,126 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 04:45:53,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 33 events. 3/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-25 04:45:53,127 INFO L142 LiptonReduction]: Number of co-enabled transitions 354 [2021-03-25 04:45:53,129 INFO L154 LiptonReduction]: Checked pairs total: 317 [2021-03-25 04:45:53,129 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:53,129 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 04:45:53,130 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 81 flow [2021-03-25 04:45:53,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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-03-25 04:45:53,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:53,131 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:53,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:45:53,131 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:53,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1719606090, now seen corresponding path program 1 times [2021-03-25 04:45:53,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:53,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682794022] [2021-03-25 04:45:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:53,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:53,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:45:53,222 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 04:45:53,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 04:45:53,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:53,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:45:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:53,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682794022] [2021-03-25 04:45:53,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:53,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:53,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655686965] [2021-03-25 04:45:53,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:45:53,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:53,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:45:53,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:45:53,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 206 [2021-03-25 04:45:53,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 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-03-25 04:45:53,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:53,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 206 [2021-03-25 04:45:53,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:53,335 INFO L129 PetriNetUnfolder]: 37/111 cut-off events. [2021-03-25 04:45:53,335 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-03-25 04:45:53,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 111 events. 37/111 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 373 event pairs, 22 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 225. Up to 55 conditions per place. [2021-03-25 04:45:53,337 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 8 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2021-03-25 04:45:53,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 120 flow [2021-03-25 04:45:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:45:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:45:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 662 transitions. [2021-03-25 04:45:53,340 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8033980582524272 [2021-03-25 04:45:53,340 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 662 transitions. [2021-03-25 04:45:53,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 662 transitions. [2021-03-25 04:45:53,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:53,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 662 transitions. [2021-03-25 04:45:53,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 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-03-25 04:45:53,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-03-25 04:45:53,344 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-03-25 04:45:53,344 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 81 flow. Second operand 4 states and 662 transitions. [2021-03-25 04:45:53,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 120 flow [2021-03-25 04:45:53,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:45:53,346 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 111 flow [2021-03-25 04:45:53,346 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-25 04:45:53,346 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -18 predicate places. [2021-03-25 04:45:53,347 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:53,347 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 111 flow [2021-03-25 04:45:53,347 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 111 flow [2021-03-25 04:45:53,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 111 flow [2021-03-25 04:45:53,357 INFO L129 PetriNetUnfolder]: 11/58 cut-off events. [2021-03-25 04:45:53,357 INFO L130 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2021-03-25 04:45:53,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 58 events. 11/58 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 153 event pairs, 5 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 114. Up to 20 conditions per place. [2021-03-25 04:45:53,358 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-25 04:45:53,361 INFO L154 LiptonReduction]: Checked pairs total: 342 [2021-03-25 04:45:53,361 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:53,361 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-25 04:45:53,362 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 111 flow [2021-03-25 04:45:53,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 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-03-25 04:45:53,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:53,363 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:53,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:45:53,363 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:53,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1467228976, now seen corresponding path program 1 times [2021-03-25 04:45:53,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:53,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869668538] [2021-03-25 04:45:53,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:53,475 INFO L142 QuantifierPusher]: treesize reduction 11, result has 78.4 percent of original size [2021-03-25 04:45:53,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 04:45:53,504 INFO L142 QuantifierPusher]: treesize reduction 11, result has 79.6 percent of original size [2021-03-25 04:45:53,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 04:45:53,533 INFO L142 QuantifierPusher]: treesize reduction 10, result has 52.4 percent of original size [2021-03-25 04:45:53,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:45:53,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:53,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:45:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:53,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869668538] [2021-03-25 04:45:53,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:53,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:45:53,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706371881] [2021-03-25 04:45:53,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:45:53,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:53,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:45:53,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:45:53,558 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 206 [2021-03-25 04:45:53,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 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-03-25 04:45:53,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:53,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 206 [2021-03-25 04:45:53,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:53,660 INFO L129 PetriNetUnfolder]: 40/117 cut-off events. [2021-03-25 04:45:53,660 INFO L130 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2021-03-25 04:45:53,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 117 events. 40/117 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 394 event pairs, 7 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 283. Up to 55 conditions per place. [2021-03-25 04:45:53,663 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 9 selfloop transitions, 9 changer transitions 0/38 dead transitions. [2021-03-25 04:45:53,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 166 flow [2021-03-25 04:45:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:45:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:45:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 826 transitions. [2021-03-25 04:45:53,666 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8019417475728156 [2021-03-25 04:45:53,666 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 826 transitions. [2021-03-25 04:45:53,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 826 transitions. [2021-03-25 04:45:53,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:53,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 826 transitions. [2021-03-25 04:45:53,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.2) internal successors, (826), 5 states have internal predecessors, (826), 0 states have call successors, (0), 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-03-25 04:45:53,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-03-25 04:45:53,671 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-03-25 04:45:53,671 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 111 flow. Second operand 5 states and 826 transitions. [2021-03-25 04:45:53,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 166 flow [2021-03-25 04:45:53,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:45:53,673 INFO L241 Difference]: Finished difference. Result has 47 places, 36 transitions, 156 flow [2021-03-25 04:45:53,673 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2021-03-25 04:45:53,673 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -13 predicate places. [2021-03-25 04:45:53,673 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:53,673 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 36 transitions, 156 flow [2021-03-25 04:45:53,673 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 36 transitions, 156 flow [2021-03-25 04:45:53,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 156 flow [2021-03-25 04:45:53,684 INFO L129 PetriNetUnfolder]: 20/78 cut-off events. [2021-03-25 04:45:53,684 INFO L130 PetriNetUnfolder]: For 54/59 co-relation queries the response was YES. [2021-03-25 04:45:53,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 78 events. 20/78 cut-off events. For 54/59 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 260 event pairs, 5 based on Foata normal form. 2/71 useless extension candidates. Maximal degree in co-relation 189. Up to 25 conditions per place. [2021-03-25 04:45:53,686 INFO L142 LiptonReduction]: Number of co-enabled transitions 518 [2021-03-25 04:45:53,689 INFO L154 LiptonReduction]: Checked pairs total: 393 [2021-03-25 04:45:53,689 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:53,689 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-25 04:45:53,690 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 156 flow [2021-03-25 04:45:53,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 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-03-25 04:45:53,690 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:53,690 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:53,690 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:45:53,690 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:53,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:53,691 INFO L82 PathProgramCache]: Analyzing trace with hash -639089472, now seen corresponding path program 2 times [2021-03-25 04:45:53,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:53,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024731533] [2021-03-25 04:45:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:53,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:53,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:45:53,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:53,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:45:53,778 INFO L142 QuantifierPusher]: treesize reduction 10, result has 64.3 percent of original size [2021-03-25 04:45:53,779 INFO L147 QuantifierPusher]: treesize reduction 4, result has 77.8 percent of original size 14 [2021-03-25 04:45:53,799 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-25 04:45:53,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:45:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:53,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024731533] [2021-03-25 04:45:53,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:53,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:45:53,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164850933] [2021-03-25 04:45:53,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:45:53,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:53,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:45:53,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:45:53,814 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 206 [2021-03-25 04:45:53,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 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-03-25 04:45:53,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:53,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 206 [2021-03-25 04:45:53,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:53,908 INFO L129 PetriNetUnfolder]: 41/119 cut-off events. [2021-03-25 04:45:53,908 INFO L130 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2021-03-25 04:45:53,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 119 events. 41/119 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 410 event pairs, 7 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 350. Up to 56 conditions per place. [2021-03-25 04:45:53,910 INFO L132 encePairwiseOnDemand]: 200/206 looper letters, 11 selfloop transitions, 10 changer transitions 0/41 dead transitions. [2021-03-25 04:45:53,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 220 flow [2021-03-25 04:45:53,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:45:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:45:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 996 transitions. [2021-03-25 04:45:53,914 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8058252427184466 [2021-03-25 04:45:53,914 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 996 transitions. [2021-03-25 04:45:53,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 996 transitions. [2021-03-25 04:45:53,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:53,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 996 transitions. [2021-03-25 04:45:53,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 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-03-25 04:45:53,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 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-03-25 04:45:53,919 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 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-03-25 04:45:53,919 INFO L185 Difference]: Start difference. First operand has 47 places, 36 transitions, 156 flow. Second operand 6 states and 996 transitions. [2021-03-25 04:45:53,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 220 flow [2021-03-25 04:45:53,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 216 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-25 04:45:53,922 INFO L241 Difference]: Finished difference. Result has 53 places, 38 transitions, 193 flow [2021-03-25 04:45:53,922 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2021-03-25 04:45:53,922 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2021-03-25 04:45:53,922 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:53,922 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 38 transitions, 193 flow [2021-03-25 04:45:53,923 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 193 flow [2021-03-25 04:45:53,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 38 transitions, 193 flow [2021-03-25 04:45:53,936 INFO L129 PetriNetUnfolder]: 33/103 cut-off events. [2021-03-25 04:45:53,937 INFO L130 PetriNetUnfolder]: For 157/161 co-relation queries the response was YES. [2021-03-25 04:45:53,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 103 events. 33/103 cut-off events. For 157/161 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 363 event pairs, 9 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 305. Up to 41 conditions per place. [2021-03-25 04:45:53,939 INFO L142 LiptonReduction]: Number of co-enabled transitions 548 [2021-03-25 04:45:53,943 INFO L154 LiptonReduction]: Checked pairs total: 483 [2021-03-25 04:45:53,943 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:53,943 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-25 04:45:53,943 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 193 flow [2021-03-25 04:45:53,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 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-03-25 04:45:53,944 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:53,944 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:53,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:45:53,944 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:53,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:53,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1457949328, now seen corresponding path program 3 times [2021-03-25 04:45:53,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:53,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799614027] [2021-03-25 04:45:53,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:53,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:53,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:53,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:53,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:53,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:53,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:45:54,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:54,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:45:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:54,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799614027] [2021-03-25 04:45:54,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:54,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:54,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176185781] [2021-03-25 04:45:54,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:45:54,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:45:54,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:45:54,019 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 04:45:54,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 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-03-25 04:45:54,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:54,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 04:45:54,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:54,080 INFO L129 PetriNetUnfolder]: 36/113 cut-off events. [2021-03-25 04:45:54,080 INFO L130 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2021-03-25 04:45:54,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 113 events. 36/113 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 401 event pairs, 12 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 373. Up to 50 conditions per place. [2021-03-25 04:45:54,082 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 10 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2021-03-25 04:45:54,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 253 flow [2021-03-25 04:45:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:45:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:45:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 696 transitions. [2021-03-25 04:45:54,084 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8446601941747572 [2021-03-25 04:45:54,084 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 696 transitions. [2021-03-25 04:45:54,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 696 transitions. [2021-03-25 04:45:54,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:54,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 696 transitions. [2021-03-25 04:45:54,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 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-03-25 04:45:54,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-03-25 04:45:54,088 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-03-25 04:45:54,088 INFO L185 Difference]: Start difference. First operand has 53 places, 38 transitions, 193 flow. Second operand 4 states and 696 transitions. [2021-03-25 04:45:54,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 253 flow [2021-03-25 04:45:54,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 228 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-03-25 04:45:54,093 INFO L241 Difference]: Finished difference. Result has 52 places, 40 transitions, 220 flow [2021-03-25 04:45:54,093 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2021-03-25 04:45:54,093 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2021-03-25 04:45:54,093 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:54,093 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 40 transitions, 220 flow [2021-03-25 04:45:54,094 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 40 transitions, 220 flow [2021-03-25 04:45:54,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 40 transitions, 220 flow [2021-03-25 04:45:54,105 INFO L129 PetriNetUnfolder]: 27/95 cut-off events. [2021-03-25 04:45:54,106 INFO L130 PetriNetUnfolder]: For 134/143 co-relation queries the response was YES. [2021-03-25 04:45:54,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 95 events. 27/95 cut-off events. For 134/143 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 342 event pairs, 8 based on Foata normal form. 7/93 useless extension candidates. Maximal degree in co-relation 299. Up to 34 conditions per place. [2021-03-25 04:45:54,108 INFO L142 LiptonReduction]: Number of co-enabled transitions 586 [2021-03-25 04:45:54,114 INFO L154 LiptonReduction]: Checked pairs total: 452 [2021-03-25 04:45:54,114 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:54,114 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-25 04:45:54,118 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 220 flow [2021-03-25 04:45:54,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 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-03-25 04:45:54,119 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:54,119 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:54,119 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:45:54,119 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:54,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:54,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1500213085, now seen corresponding path program 1 times [2021-03-25 04:45:54,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:54,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217792681] [2021-03-25 04:45:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:54,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:54,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:54,189 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:45:54,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:45:54,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:54,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:54,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217792681] [2021-03-25 04:45:54,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:54,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:54,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644247118] [2021-03-25 04:45:54,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:45:54,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:54,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:45:54,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:45:54,199 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 04:45:54,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 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-03-25 04:45:54,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:54,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 04:45:54,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:54,306 INFO L129 PetriNetUnfolder]: 294/558 cut-off events. [2021-03-25 04:45:54,307 INFO L130 PetriNetUnfolder]: For 803/989 co-relation queries the response was YES. [2021-03-25 04:45:54,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 558 events. 294/558 cut-off events. For 803/989 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 3330 event pairs, 131 based on Foata normal form. 45/511 useless extension candidates. Maximal degree in co-relation 1702. Up to 284 conditions per place. [2021-03-25 04:45:54,314 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 11 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2021-03-25 04:45:54,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 288 flow [2021-03-25 04:45:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:45:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:45:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 877 transitions. [2021-03-25 04:45:54,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8514563106796117 [2021-03-25 04:45:54,317 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 877 transitions. [2021-03-25 04:45:54,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 877 transitions. [2021-03-25 04:45:54,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:54,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 877 transitions. [2021-03-25 04:45:54,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 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-03-25 04:45:54,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-03-25 04:45:54,321 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-03-25 04:45:54,321 INFO L185 Difference]: Start difference. First operand has 52 places, 40 transitions, 220 flow. Second operand 5 states and 877 transitions. [2021-03-25 04:45:54,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 288 flow [2021-03-25 04:45:54,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 268 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-25 04:45:54,326 INFO L241 Difference]: Finished difference. Result has 57 places, 49 transitions, 279 flow [2021-03-25 04:45:54,326 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2021-03-25 04:45:54,327 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2021-03-25 04:45:54,327 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:54,327 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 49 transitions, 279 flow [2021-03-25 04:45:54,327 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 49 transitions, 279 flow [2021-03-25 04:45:54,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 49 transitions, 279 flow [2021-03-25 04:45:54,436 INFO L129 PetriNetUnfolder]: 302/568 cut-off events. [2021-03-25 04:45:54,436 INFO L130 PetriNetUnfolder]: For 840/1057 co-relation queries the response was YES. [2021-03-25 04:45:54,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1924 conditions, 568 events. 302/568 cut-off events. For 840/1057 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 3419 event pairs, 134 based on Foata normal form. 9/485 useless extension candidates. Maximal degree in co-relation 1904. Up to 311 conditions per place. [2021-03-25 04:45:54,445 INFO L142 LiptonReduction]: Number of co-enabled transitions 826 [2021-03-25 04:45:54,459 INFO L154 LiptonReduction]: Checked pairs total: 337 [2021-03-25 04:45:54,459 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:54,460 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 133 [2021-03-25 04:45:54,460 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 279 flow [2021-03-25 04:45:54,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 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-03-25 04:45:54,460 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:54,460 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:54,460 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:45:54,461 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:54,461 INFO L82 PathProgramCache]: Analyzing trace with hash 515732543, now seen corresponding path program 1 times [2021-03-25 04:45:54,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:54,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441715048] [2021-03-25 04:45:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:54,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:54,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:54,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:54,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:54,542 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:45:54,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:45:54,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:54,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:54,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441715048] [2021-03-25 04:45:54,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:54,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:45:54,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689638130] [2021-03-25 04:45:54,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:45:54,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:54,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:45:54,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:45:54,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 04:45:54,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 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-03-25 04:45:54,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:54,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 04:45:54,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:54,654 INFO L129 PetriNetUnfolder]: 200/420 cut-off events. [2021-03-25 04:45:54,655 INFO L130 PetriNetUnfolder]: For 800/1528 co-relation queries the response was YES. [2021-03-25 04:45:54,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 420 events. 200/420 cut-off events. For 800/1528 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2357 event pairs, 40 based on Foata normal form. 85/442 useless extension candidates. Maximal degree in co-relation 1644. Up to 258 conditions per place. [2021-03-25 04:45:54,659 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 11 selfloop transitions, 19 changer transitions 0/62 dead transitions. [2021-03-25 04:45:54,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 415 flow [2021-03-25 04:45:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:45:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:45:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1228 transitions. [2021-03-25 04:45:54,663 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8515950069348127 [2021-03-25 04:45:54,663 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1228 transitions. [2021-03-25 04:45:54,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1228 transitions. [2021-03-25 04:45:54,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:54,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1228 transitions. [2021-03-25 04:45:54,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 175.42857142857142) internal successors, (1228), 7 states have internal predecessors, (1228), 0 states have call successors, (0), 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-03-25 04:45:54,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 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-03-25 04:45:54,669 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 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-03-25 04:45:54,669 INFO L185 Difference]: Start difference. First operand has 57 places, 49 transitions, 279 flow. Second operand 7 states and 1228 transitions. [2021-03-25 04:45:54,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 415 flow [2021-03-25 04:45:54,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:45:54,672 INFO L241 Difference]: Finished difference. Result has 65 places, 58 transitions, 412 flow [2021-03-25 04:45:54,672 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=412, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2021-03-25 04:45:54,672 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2021-03-25 04:45:54,672 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:54,672 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 58 transitions, 412 flow [2021-03-25 04:45:54,673 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 58 transitions, 412 flow [2021-03-25 04:45:54,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 58 transitions, 412 flow [2021-03-25 04:45:54,715 INFO L129 PetriNetUnfolder]: 196/412 cut-off events. [2021-03-25 04:45:54,715 INFO L130 PetriNetUnfolder]: For 1205/1631 co-relation queries the response was YES. [2021-03-25 04:45:54,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 412 events. 196/412 cut-off events. For 1205/1631 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2481 event pairs, 44 based on Foata normal form. 8/357 useless extension candidates. Maximal degree in co-relation 1863. Up to 259 conditions per place. [2021-03-25 04:45:54,722 INFO L142 LiptonReduction]: Number of co-enabled transitions 1026 [2021-03-25 04:45:54,731 INFO L154 LiptonReduction]: Checked pairs total: 433 [2021-03-25 04:45:54,731 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:54,731 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-25 04:45:54,731 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 412 flow [2021-03-25 04:45:54,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 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-03-25 04:45:54,732 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:54,732 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:54,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:45:54,732 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:54,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:54,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1398739027, now seen corresponding path program 1 times [2021-03-25 04:45:54,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:54,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936905622] [2021-03-25 04:45:54,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:54,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:54,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:54,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:54,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:54,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936905622] [2021-03-25 04:45:54,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:54,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:45:54,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082223296] [2021-03-25 04:45:54,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:45:54,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:54,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:45:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:45:54,798 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 206 [2021-03-25 04:45:54,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 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-03-25 04:45:54,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:54,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 206 [2021-03-25 04:45:54,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:54,865 INFO L129 PetriNetUnfolder]: 285/573 cut-off events. [2021-03-25 04:45:54,865 INFO L130 PetriNetUnfolder]: For 2225/3192 co-relation queries the response was YES. [2021-03-25 04:45:54,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 573 events. 285/573 cut-off events. For 2225/3192 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 3415 event pairs, 56 based on Foata normal form. 35/511 useless extension candidates. Maximal degree in co-relation 2719. Up to 406 conditions per place. [2021-03-25 04:45:54,871 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 3 selfloop transitions, 3 changer transitions 2/58 dead transitions. [2021-03-25 04:45:54,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 424 flow [2021-03-25 04:45:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:45:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:45:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2021-03-25 04:45:54,873 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9077669902912622 [2021-03-25 04:45:54,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 561 transitions. [2021-03-25 04:45:54,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 561 transitions. [2021-03-25 04:45:54,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:54,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 561 transitions. [2021-03-25 04:45:54,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 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-03-25 04:45:54,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-03-25 04:45:54,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 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-03-25 04:45:54,877 INFO L185 Difference]: Start difference. First operand has 65 places, 58 transitions, 412 flow. Second operand 3 states and 561 transitions. [2021-03-25 04:45:54,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 424 flow [2021-03-25 04:45:54,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 374 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-25 04:45:54,884 INFO L241 Difference]: Finished difference. Result has 65 places, 56 transitions, 359 flow [2021-03-25 04:45:54,885 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2021-03-25 04:45:54,885 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2021-03-25 04:45:54,885 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:54,885 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 56 transitions, 359 flow [2021-03-25 04:45:54,885 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 56 transitions, 359 flow [2021-03-25 04:45:54,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 56 transitions, 359 flow [2021-03-25 04:45:54,935 INFO L129 PetriNetUnfolder]: 259/539 cut-off events. [2021-03-25 04:45:54,936 INFO L130 PetriNetUnfolder]: For 1923/2145 co-relation queries the response was YES. [2021-03-25 04:45:54,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2325 conditions, 539 events. 259/539 cut-off events. For 1923/2145 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 3513 event pairs, 54 based on Foata normal form. 10/458 useless extension candidates. Maximal degree in co-relation 2301. Up to 329 conditions per place. [2021-03-25 04:45:54,944 INFO L142 LiptonReduction]: Number of co-enabled transitions 990 [2021-03-25 04:45:54,957 INFO L154 LiptonReduction]: Checked pairs total: 497 [2021-03-25 04:45:54,957 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:54,957 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-03-25 04:45:54,959 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 359 flow [2021-03-25 04:45:54,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 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-03-25 04:45:54,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:54,959 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:54,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:45:54,959 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:54,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1474297599, now seen corresponding path program 1 times [2021-03-25 04:45:54,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:54,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535881265] [2021-03-25 04:45:54,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:55,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:55,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:55,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:55,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:55,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:55,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:55,029 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:45:55,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:45:55,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:55,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:55,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535881265] [2021-03-25 04:45:55,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:55,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:45:55,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259884228] [2021-03-25 04:45:55,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:45:55,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:55,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:45:55,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:45:55,039 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 04:45:55,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 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-03-25 04:45:55,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:55,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 04:45:55,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:55,166 INFO L129 PetriNetUnfolder]: 181/403 cut-off events. [2021-03-25 04:45:55,166 INFO L130 PetriNetUnfolder]: For 1888/3340 co-relation queries the response was YES. [2021-03-25 04:45:55,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1993 conditions, 403 events. 181/403 cut-off events. For 1888/3340 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 2304 event pairs, 7 based on Foata normal form. 116/439 useless extension candidates. Maximal degree in co-relation 1967. Up to 261 conditions per place. [2021-03-25 04:45:55,170 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 6 selfloop transitions, 25 changer transitions 5/66 dead transitions. [2021-03-25 04:45:55,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 528 flow [2021-03-25 04:45:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 04:45:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 04:45:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1577 transitions. [2021-03-25 04:45:55,174 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8505933117583603 [2021-03-25 04:45:55,174 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1577 transitions. [2021-03-25 04:45:55,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1577 transitions. [2021-03-25 04:45:55,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:55,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1577 transitions. [2021-03-25 04:45:55,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 175.22222222222223) internal successors, (1577), 9 states have internal predecessors, (1577), 0 states have call successors, (0), 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-03-25 04:45:55,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 0 states have call successors, (0), 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-03-25 04:45:55,182 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 0 states have call successors, (0), 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-03-25 04:45:55,182 INFO L185 Difference]: Start difference. First operand has 65 places, 56 transitions, 359 flow. Second operand 9 states and 1577 transitions. [2021-03-25 04:45:55,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 528 flow [2021-03-25 04:45:55,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 520 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:45:55,188 INFO L241 Difference]: Finished difference. Result has 74 places, 61 transitions, 483 flow [2021-03-25 04:45:55,188 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=483, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2021-03-25 04:45:55,188 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2021-03-25 04:45:55,188 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:55,189 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 61 transitions, 483 flow [2021-03-25 04:45:55,189 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 61 transitions, 483 flow [2021-03-25 04:45:55,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 61 transitions, 483 flow [2021-03-25 04:45:55,223 INFO L129 PetriNetUnfolder]: 151/367 cut-off events. [2021-03-25 04:45:55,224 INFO L130 PetriNetUnfolder]: For 2007/2309 co-relation queries the response was YES. [2021-03-25 04:45:55,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 367 events. 151/367 cut-off events. For 2007/2309 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 2304 event pairs, 7 based on Foata normal form. 4/292 useless extension candidates. Maximal degree in co-relation 1909. Up to 225 conditions per place. [2021-03-25 04:45:55,230 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-25 04:45:55,406 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 04:45:55,795 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2021-03-25 04:45:55,924 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-03-25 04:45:55,953 INFO L154 LiptonReduction]: Checked pairs total: 1124 [2021-03-25 04:45:55,954 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:45:55,954 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 766 [2021-03-25 04:45:55,954 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 458 flow [2021-03-25 04:45:55,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 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-03-25 04:45:55,955 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:55,955 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:55,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:45:55,955 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1587050703, now seen corresponding path program 1 times [2021-03-25 04:45:55,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:55,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670832540] [2021-03-25 04:45:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:56,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:56,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:56,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:56,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:56,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:56,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:56,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:56,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:56,042 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:45:56,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:45:56,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:56,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:56,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670832540] [2021-03-25 04:45:56,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:56,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:45:56,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297890756] [2021-03-25 04:45:56,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:45:56,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:56,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:45:56,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:45:56,056 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2021-03-25 04:45:56,057 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 458 flow. Second operand has 7 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 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-03-25 04:45:56,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:56,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2021-03-25 04:45:56,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:56,135 INFO L129 PetriNetUnfolder]: 60/149 cut-off events. [2021-03-25 04:45:56,136 INFO L130 PetriNetUnfolder]: For 969/1460 co-relation queries the response was YES. [2021-03-25 04:45:56,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 149 events. 60/149 cut-off events. For 969/1460 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 560 event pairs, 0 based on Foata normal form. 40/160 useless extension candidates. Maximal degree in co-relation 777. Up to 105 conditions per place. [2021-03-25 04:45:56,137 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 2 selfloop transitions, 18 changer transitions 4/54 dead transitions. [2021-03-25 04:45:56,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 54 transitions, 465 flow [2021-03-25 04:45:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:45:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:45:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1402 transitions. [2021-03-25 04:45:56,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8466183574879227 [2021-03-25 04:45:56,142 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1402 transitions. [2021-03-25 04:45:56,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1402 transitions. [2021-03-25 04:45:56,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:56,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1402 transitions. [2021-03-25 04:45:56,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 175.25) internal successors, (1402), 8 states have internal predecessors, (1402), 0 states have call successors, (0), 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-03-25 04:45:56,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 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-03-25 04:45:56,148 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 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-03-25 04:45:56,148 INFO L185 Difference]: Start difference. First operand has 74 places, 58 transitions, 458 flow. Second operand 8 states and 1402 transitions. [2021-03-25 04:45:56,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 54 transitions, 465 flow [2021-03-25 04:45:56,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 54 transitions, 374 flow, removed 37 selfloop flow, removed 8 redundant places. [2021-03-25 04:45:56,151 INFO L241 Difference]: Finished difference. Result has 68 places, 50 transitions, 338 flow [2021-03-25 04:45:56,151 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=338, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2021-03-25 04:45:56,151 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2021-03-25 04:45:56,152 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:56,152 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 50 transitions, 338 flow [2021-03-25 04:45:56,152 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 50 transitions, 338 flow [2021-03-25 04:45:56,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 50 transitions, 338 flow [2021-03-25 04:45:56,164 INFO L129 PetriNetUnfolder]: 54/141 cut-off events. [2021-03-25 04:45:56,164 INFO L130 PetriNetUnfolder]: For 330/416 co-relation queries the response was YES. [2021-03-25 04:45:56,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 141 events. 54/141 cut-off events. For 330/416 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 585 event pairs, 0 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 560. Up to 61 conditions per place. [2021-03-25 04:45:56,166 INFO L142 LiptonReduction]: Number of co-enabled transitions 642 [2021-03-25 04:45:56,507 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 04:45:56,643 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 04:45:57,244 WARN L205 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 196 [2021-03-25 04:45:57,465 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:45:59,435 WARN L205 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 350 DAG size of output: 276 [2021-03-25 04:46:00,029 WARN L205 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 04:46:00,038 INFO L154 LiptonReduction]: Checked pairs total: 1005 [2021-03-25 04:46:00,038 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:46:00,038 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3886 [2021-03-25 04:46:00,039 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 322 flow [2021-03-25 04:46:00,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 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-03-25 04:46:00,039 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:00,039 INFO L263 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] [2021-03-25 04:46:00,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:46:00,040 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:46:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:00,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2024655845, now seen corresponding path program 1 times [2021-03-25 04:46:00,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:00,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927379162] [2021-03-25 04:46:00,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:00,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:00,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:00,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:00,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:00,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:00,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:46:00,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927379162] [2021-03-25 04:46:00,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:00,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:46:00,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42364798] [2021-03-25 04:46:00,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:46:00,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:46:00,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:46:00,087 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 209 [2021-03-25 04:46:00,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 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-03-25 04:46:00,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:00,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 209 [2021-03-25 04:46:00,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:00,127 INFO L129 PetriNetUnfolder]: 109/250 cut-off events. [2021-03-25 04:46:00,127 INFO L130 PetriNetUnfolder]: For 1300/1559 co-relation queries the response was YES. [2021-03-25 04:46:00,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 250 events. 109/250 cut-off events. For 1300/1559 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1316 event pairs, 0 based on Foata normal form. 18/227 useless extension candidates. Maximal degree in co-relation 970. Up to 100 conditions per place. [2021-03-25 04:46:00,130 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 3 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2021-03-25 04:46:00,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 48 transitions, 334 flow [2021-03-25 04:46:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:46:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:46:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 742 transitions. [2021-03-25 04:46:00,132 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8875598086124402 [2021-03-25 04:46:00,132 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 742 transitions. [2021-03-25 04:46:00,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 742 transitions. [2021-03-25 04:46:00,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:00,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 742 transitions. [2021-03-25 04:46:00,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 0 states have call successors, (0), 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-03-25 04:46:00,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 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-03-25 04:46:00,135 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 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-03-25 04:46:00,135 INFO L185 Difference]: Start difference. First operand has 64 places, 47 transitions, 322 flow. Second operand 4 states and 742 transitions. [2021-03-25 04:46:00,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 48 transitions, 334 flow [2021-03-25 04:46:00,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 48 transitions, 265 flow, removed 19 selfloop flow, removed 8 redundant places. [2021-03-25 04:46:00,139 INFO L241 Difference]: Finished difference. Result has 61 places, 48 transitions, 266 flow [2021-03-25 04:46:00,140 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2021-03-25 04:46:00,140 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2021-03-25 04:46:00,140 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:00,140 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 48 transitions, 266 flow [2021-03-25 04:46:00,140 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 48 transitions, 266 flow [2021-03-25 04:46:00,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 48 transitions, 266 flow [2021-03-25 04:46:00,157 INFO L129 PetriNetUnfolder]: 109/250 cut-off events. [2021-03-25 04:46:00,157 INFO L130 PetriNetUnfolder]: For 265/294 co-relation queries the response was YES. [2021-03-25 04:46:00,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 250 events. 109/250 cut-off events. For 265/294 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1327 event pairs, 0 based on Foata normal form. 6/215 useless extension candidates. Maximal degree in co-relation 716. Up to 84 conditions per place. [2021-03-25 04:46:00,160 INFO L142 LiptonReduction]: Number of co-enabled transitions 638 [2021-03-25 04:46:00,165 INFO L154 LiptonReduction]: Checked pairs total: 212 [2021-03-25 04:46:00,165 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:00,166 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-25 04:46:00,166 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 266 flow [2021-03-25 04:46:00,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 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-03-25 04:46:00,166 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:00,166 INFO L263 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] [2021-03-25 04:46:00,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:46:00,166 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:46:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:00,167 INFO L82 PathProgramCache]: Analyzing trace with hash -21731438, now seen corresponding path program 1 times [2021-03-25 04:46:00,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:00,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781649186] [2021-03-25 04:46:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:00,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:00,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:00,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:00,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:00,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:00,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:46:00,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781649186] [2021-03-25 04:46:00,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:00,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:46:00,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160462415] [2021-03-25 04:46:00,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:46:00,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:00,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:46:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:46:00,205 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 209 [2021-03-25 04:46:00,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-03-25 04:46:00,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:00,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 209 [2021-03-25 04:46:00,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:00,268 INFO L129 PetriNetUnfolder]: 221/483 cut-off events. [2021-03-25 04:46:00,268 INFO L130 PetriNetUnfolder]: For 842/957 co-relation queries the response was YES. [2021-03-25 04:46:00,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 483 events. 221/483 cut-off events. For 842/957 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 2953 event pairs, 0 based on Foata normal form. 24/430 useless extension candidates. Maximal degree in co-relation 1422. Up to 158 conditions per place. [2021-03-25 04:46:00,271 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 3 selfloop transitions, 2 changer transitions 9/49 dead transitions. [2021-03-25 04:46:00,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 49 transitions, 278 flow [2021-03-25 04:46:00,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:46:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:46:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions. [2021-03-25 04:46:00,273 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8827751196172249 [2021-03-25 04:46:00,273 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 738 transitions. [2021-03-25 04:46:00,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions. [2021-03-25 04:46:00,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:00,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions. [2021-03-25 04:46:00,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 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-03-25 04:46:00,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 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-03-25 04:46:00,277 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 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-03-25 04:46:00,277 INFO L185 Difference]: Start difference. First operand has 61 places, 48 transitions, 266 flow. Second operand 4 states and 738 transitions. [2021-03-25 04:46:00,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 49 transitions, 278 flow [2021-03-25 04:46:00,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 49 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:46:00,284 INFO L241 Difference]: Finished difference. Result has 65 places, 40 transitions, 224 flow [2021-03-25 04:46:00,284 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2021-03-25 04:46:00,284 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2021-03-25 04:46:00,284 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:00,284 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 40 transitions, 224 flow [2021-03-25 04:46:00,285 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 40 transitions, 224 flow [2021-03-25 04:46:00,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 40 transitions, 224 flow [2021-03-25 04:46:00,297 INFO L129 PetriNetUnfolder]: 63/155 cut-off events. [2021-03-25 04:46:00,297 INFO L130 PetriNetUnfolder]: For 194/211 co-relation queries the response was YES. [2021-03-25 04:46:00,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 155 events. 63/155 cut-off events. For 194/211 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 691 event pairs, 0 based on Foata normal form. 4/140 useless extension candidates. Maximal degree in co-relation 453. Up to 52 conditions per place. [2021-03-25 04:46:00,299 INFO L142 LiptonReduction]: Number of co-enabled transitions 352 [2021-03-25 04:46:00,373 INFO L154 LiptonReduction]: Checked pairs total: 97 [2021-03-25 04:46:00,374 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:46:00,374 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 90 [2021-03-25 04:46:00,374 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 222 flow [2021-03-25 04:46:00,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-03-25 04:46:00,374 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:00,375 INFO L263 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] [2021-03-25 04:46:00,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:46:00,375 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:46:00,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash -46195949, now seen corresponding path program 1 times [2021-03-25 04:46:00,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:00,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996530276] [2021-03-25 04:46:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:46:00,402 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:46:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:46:00,436 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:46:00,476 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:46:00,476 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:46:00,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 04:46:00,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:46:00 BasicIcfg [2021-03-25 04:46:00,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:46:00,582 INFO L168 Benchmark]: Toolchain (without parser) took 22559.12 ms. Allocated memory was 337.6 MB in the beginning and 717.2 MB in the end (delta: 379.6 MB). Free memory was 300.6 MB in the beginning and 435.4 MB in the end (delta: -134.8 MB). Peak memory consumption was 246.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:00,583 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 337.6 MB. Free memory was 318.8 MB in the beginning and 318.6 MB in the end (delta: 134.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:46:00,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.81 ms. Allocated memory is still 337.6 MB. Free memory was 300.4 MB in the beginning and 295.3 MB in the end (delta: 5.1 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:00,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.30 ms. Allocated memory is still 337.6 MB. Free memory was 295.3 MB in the beginning and 293.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:00,583 INFO L168 Benchmark]: Boogie Preprocessor took 55.07 ms. Allocated memory is still 337.6 MB. Free memory was 293.2 MB in the beginning and 291.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:00,589 INFO L168 Benchmark]: RCFGBuilder took 1756.59 ms. Allocated memory is still 337.6 MB. Free memory was 290.1 MB in the beginning and 235.3 MB in the end (delta: 54.7 MB). Peak memory consumption was 133.4 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:00,589 INFO L168 Benchmark]: TraceAbstraction took 20073.31 ms. Allocated memory was 337.6 MB in the beginning and 717.2 MB in the end (delta: 379.6 MB). Free memory was 235.3 MB in the beginning and 435.4 MB in the end (delta: -200.0 MB). Peak memory consumption was 179.5 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:00,590 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.48 ms. Allocated memory is still 337.6 MB. Free memory was 318.8 MB in the beginning and 318.6 MB in the end (delta: 134.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 583.81 ms. Allocated memory is still 337.6 MB. Free memory was 300.4 MB in the beginning and 295.3 MB in the end (delta: 5.1 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 82.30 ms. Allocated memory is still 337.6 MB. Free memory was 295.3 MB in the beginning and 293.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 55.07 ms. Allocated memory is still 337.6 MB. Free memory was 293.2 MB in the beginning and 291.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1756.59 ms. Allocated memory is still 337.6 MB. Free memory was 290.1 MB in the beginning and 235.3 MB in the end (delta: 54.7 MB). Peak memory consumption was 133.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20073.31 ms. Allocated memory was 337.6 MB in the beginning and 717.2 MB in the end (delta: 379.6 MB). Free memory was 235.3 MB in the beginning and 435.4 MB in the end (delta: -200.0 MB). Peak memory consumption was 179.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7455.8ms, 124 PlacesBefore, 60 PlacesAfterwards, 113 TransitionsBefore, 48 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2152, positive: 2060, positive conditional: 0, positive unconditional: 2060, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1251, positive: 1224, positive conditional: 0, positive unconditional: 1224, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1251, positive: 1224, positive conditional: 0, positive unconditional: 1224, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2152, positive: 836, positive conditional: 0, positive unconditional: 836, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 1251, unknown conditional: 0, unknown unconditional: 1251] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2597.3ms, 56 PlacesBefore, 41 PlacesAfterwards, 41 TransitionsBefore, 30 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 3 FixpointIterations, 10 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1348 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 371, positive: 294, positive conditional: 0, positive unconditional: 294, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 41, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 371, positive: 261, positive conditional: 0, positive unconditional: 261, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 41, unknown conditional: 0, unknown unconditional: 41] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1643.2ms, 42 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 25 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 1088 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 339, positive: 272, positive conditional: 0, positive unconditional: 272, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 339, positive: 267, positive conditional: 0, positive unconditional: 267, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7ms, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 317 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 109, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.0ms, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 342 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 141, positive: 123, positive conditional: 0, positive unconditional: 123, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 141, positive: 121, positive conditional: 0, positive unconditional: 121, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.4ms, 47 PlacesBefore, 47 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 393 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 126, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.0ms, 53 PlacesBefore, 53 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 483 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 156, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 156, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.1ms, 52 PlacesBefore, 52 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 586 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 452 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 180, positive: 159, positive conditional: 0, positive unconditional: 159, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 180, positive: 159, positive conditional: 0, positive unconditional: 159, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 132.4ms, 57 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 337 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 189, positive: 177, positive conditional: 0, positive unconditional: 177, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 189, positive: 175, positive conditional: 0, positive unconditional: 175, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.0ms, 65 PlacesBefore, 65 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 1026 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 433 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 202, positive: 189, positive conditional: 0, positive unconditional: 189, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 202, positive: 188, positive conditional: 0, positive unconditional: 188, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.6ms, 65 PlacesBefore, 65 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 497 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 282, positive: 267, positive conditional: 0, positive unconditional: 267, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 282, positive: 267, positive conditional: 0, positive unconditional: 267, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 765.0ms, 74 PlacesBefore, 74 PlacesAfterwards, 61 TransitionsBefore, 58 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 1124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 670, positive: 642, positive conditional: 0, positive unconditional: 642, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 670, positive: 635, positive conditional: 0, positive unconditional: 635, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3886.3ms, 68 PlacesBefore, 64 PlacesAfterwards, 50 TransitionsBefore, 47 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1005 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 769, positive: 730, positive conditional: 0, positive unconditional: 730, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 769, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.3ms, 61 PlacesBefore, 61 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 638 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 196, positive: 188, positive conditional: 0, positive unconditional: 188, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 196, positive: 187, positive conditional: 0, positive unconditional: 187, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 89.0ms, 65 PlacesBefore, 59 PlacesAfterwards, 40 TransitionsBefore, 38 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 97 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 77, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19848.8ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1319.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7547.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49 SDtfs, 31 SDslu, 22 SDs, 0 SdLazy, 310 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 344.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 334.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=11, InterpolantAutomatonStates: 68, 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: 47.7ms SsaConstructionTime, 437.8ms SatisfiabilityAnalysisTime, 864.5ms InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 1149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 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! Received shutdown request...