/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:26:25,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:26:25,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:26:25,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:26:25,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:26:25,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:26:25,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:26:25,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:26:25,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:26:25,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:26:25,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:26:25,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:26:25,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:26:25,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:26:25,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:26:25,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:26:25,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:26:25,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:26:25,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:26:25,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:26:25,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:26:25,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:26:25,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:26:25,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:26:25,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:26:25,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:26:25,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:26:25,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:26:25,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:26:25,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:26:25,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:26:25,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:26:25,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:26:25,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:26:25,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:26:25,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:26:25,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:26:25,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:26:25,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:26:25,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:26:25,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:26:25,693 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-RepeatedSemanticLbe.epf [2021-03-25 14:26:25,729 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:26:25,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:26:25,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:26:25,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:26:25,732 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:26:25,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:26:25,733 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:26:25,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:26:25,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:26:25,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:26:25,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:26:25,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:26:25,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:26:25,735 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:26:25,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:26:25,735 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:26:25,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:26:25,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:26:25,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:26:25,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:26:25,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:26:25,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:26:25,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:26:25,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:26:25,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:26:25,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:26:25,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:26:25,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:26:25,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:26:25,737 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 14:26:26,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:26:26,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:26:26,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:26:26,064 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:26:26,064 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:26:26,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i [2021-03-25 14:26:26,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8015aee4/194c579824134bebad588da6f3cc2b84/FLAG3398bb2e0 [2021-03-25 14:26:26,634 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:26:26,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i [2021-03-25 14:26:26,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8015aee4/194c579824134bebad588da6f3cc2b84/FLAG3398bb2e0 [2021-03-25 14:26:26,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8015aee4/194c579824134bebad588da6f3cc2b84 [2021-03-25 14:26:26,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:26:26,949 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:26:26,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:26:26,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:26:26,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:26:26,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:26:26" (1/1) ... [2021-03-25 14:26:26,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3dd8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:26, skipping insertion in model container [2021-03-25 14:26:26,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:26:26" (1/1) ... [2021-03-25 14:26:26,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:26:27,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:26:27,114 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/mix027_tso.opt.i[948,961] [2021-03-25 14:26:27,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:26:27,337 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:26:27,345 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/mix027_tso.opt.i[948,961] [2021-03-25 14:26:27,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:26:27,465 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:26:27,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27 WrapperNode [2021-03-25 14:26:27,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:26:27,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:26:27,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:26:27,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:26:27,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27" (1/1) ... [2021-03-25 14:26:27,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27" (1/1) ... [2021-03-25 14:26:27,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:26:27,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:26:27,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:26:27,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:26:27,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27" (1/1) ... [2021-03-25 14:26:27,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27" (1/1) ... [2021-03-25 14:26:27,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27" (1/1) ... [2021-03-25 14:26:27,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27" (1/1) ... [2021-03-25 14:26:27,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27" (1/1) ... [2021-03-25 14:26:27,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27" (1/1) ... [2021-03-25 14:26:27,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27" (1/1) ... [2021-03-25 14:26:27,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:26:27,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:26:27,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:26:27,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:26:27,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27" (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 14:26:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:26:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:26:27,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:26:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:26:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:26:27,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:26:27,626 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:26:27,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:26:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:26:27,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:26:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:26:27,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:26:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:26:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:26:27,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:26:27,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:26:27,630 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 14:26:29,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:26:29,503 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:26:29,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:26:29 BoogieIcfgContainer [2021-03-25 14:26:29,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:26:29,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:26:29,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:26:29,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:26:29,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:26:26" (1/3) ... [2021-03-25 14:26:29,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1263a717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:26:29, skipping insertion in model container [2021-03-25 14:26:29,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:27" (2/3) ... [2021-03-25 14:26:29,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1263a717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:26:29, skipping insertion in model container [2021-03-25 14:26:29,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:26:29" (3/3) ... [2021-03-25 14:26:29,512 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.opt.i [2021-03-25 14:26:29,518 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:26:29,522 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:26:29,522 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:26:29,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,564 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,564 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,564 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,565 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,570 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,570 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,571 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,571 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,571 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,571 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,572 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,572 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,575 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,575 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,576 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,576 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,581 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,581 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,581 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,581 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,581 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,582 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,582 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,582 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,582 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,582 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,583 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,583 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,586 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,586 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,587 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,587 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,593 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,594 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,594 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,594 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,594 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,594 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,595 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,598 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,598 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,599 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,599 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,599 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,599 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,599 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,599 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,599 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,600 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,603 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,603 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,604 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,605 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,605 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,608 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,608 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:29,609 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:26:29,625 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:26:29,651 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:26:29,652 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:26:29,652 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:26:29,652 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:26:29,652 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:26:29,652 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:26:29,652 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:26:29,652 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:26:29,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:26:29,718 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:26:29,718 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:26:29,727 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 92 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-25 14:26:29,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:26:29,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-25 14:26:29,735 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:29,746 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:26:29,748 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:26:29,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-25 14:26:29,770 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:26:29,770 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:26:29,771 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 93 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-25 14:26:29,775 INFO L142 LiptonReduction]: Number of co-enabled transitions 2766 [2021-03-25 14:26:30,802 WARN L205 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2021-03-25 14:26:31,102 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:26:32,642 WARN L205 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 314 DAG size of output: 269 [2021-03-25 14:26:33,257 WARN L205 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 14:26:34,387 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:26:34,735 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:26:34,858 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:26:36,323 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:26:36,583 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:26:37,174 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:26:37,809 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:26:38,334 INFO L154 LiptonReduction]: Checked pairs total: 5586 [2021-03-25 14:26:38,335 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-25 14:26:38,336 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8602 [2021-03-25 14:26:38,348 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 14:26:38,348 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:26:38,349 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:38,349 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:38,349 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:38,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2055766290, now seen corresponding path program 1 times [2021-03-25 14:26:38,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:38,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025071750] [2021-03-25 14:26:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:38,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:38,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:38,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:38,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:38,613 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 14:26:38,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025071750] [2021-03-25 14:26:38,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:38,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:26:38,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516039879] [2021-03-25 14:26:38,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:26:38,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:38,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:26:38,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:26:38,634 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 194 [2021-03-25 14:26:38,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 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 14:26:38,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:38,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 194 [2021-03-25 14:26:38,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:38,810 INFO L129 PetriNetUnfolder]: 185/433 cut-off events. [2021-03-25 14:26:38,810 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:26:38,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 433 events. 185/433 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2448 event pairs, 123 based on Foata normal form. 20/411 useless extension candidates. Maximal degree in co-relation 709. Up to 209 conditions per place. [2021-03-25 14:26:38,817 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 11 selfloop transitions, 2 changer transitions 5/48 dead transitions. [2021-03-25 14:26:38,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 138 flow [2021-03-25 14:26:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:26:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:26:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2021-03-25 14:26:38,838 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9072164948453608 [2021-03-25 14:26:38,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2021-03-25 14:26:38,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2021-03-25 14:26:38,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:38,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2021-03-25 14:26:38,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 14:26:38,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 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 14:26:38,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 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 14:26:38,860 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 528 transitions. [2021-03-25 14:26:38,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 138 flow [2021-03-25 14:26:38,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:26:38,865 INFO L241 Difference]: Finished difference. Result has 53 places, 38 transitions, 88 flow [2021-03-25 14:26:38,866 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2021-03-25 14:26:38,867 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-25 14:26:38,867 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:38,867 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 38 transitions, 88 flow [2021-03-25 14:26:38,868 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 88 flow [2021-03-25 14:26:38,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 38 transitions, 88 flow [2021-03-25 14:26:38,874 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-03-25 14:26:38,874 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:26:38,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:26:38,876 INFO L142 LiptonReduction]: Number of co-enabled transitions 482 [2021-03-25 14:26:39,362 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:26:39,675 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:26:40,326 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:26:40,928 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:26:41,714 INFO L154 LiptonReduction]: Checked pairs total: 1748 [2021-03-25 14:26:41,714 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 14:26:41,715 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2848 [2021-03-25 14:26:41,716 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-25 14:26:41,716 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 14:26:41,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:41,716 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] [2021-03-25 14:26:41,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:26:41,717 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2048186142, now seen corresponding path program 1 times [2021-03-25 14:26:41,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:41,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520076477] [2021-03-25 14:26:41,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:41,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:41,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:41,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:41,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:41,854 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:26:41,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:26:41,857 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 14:26:41,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520076477] [2021-03-25 14:26:41,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:41,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:26:41,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389206640] [2021-03-25 14:26:41,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:26:41,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:41,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:26:41,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:26:41,860 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 201 [2021-03-25 14:26:41,861 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 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 14:26:41,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:41,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 201 [2021-03-25 14:26:41,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:41,881 INFO L129 PetriNetUnfolder]: 7/53 cut-off events. [2021-03-25 14:26:41,881 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:26:41,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 53 events. 7/53 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 118 event pairs, 3 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 73. Up to 18 conditions per place. [2021-03-25 14:26:41,882 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 4 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2021-03-25 14:26:41,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 92 flow [2021-03-25 14:26:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:26:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:26:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2021-03-25 14:26:41,884 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8938640132669984 [2021-03-25 14:26:41,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2021-03-25 14:26:41,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2021-03-25 14:26:41,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:41,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2021-03-25 14:26:41,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 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 14:26:41,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 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 14:26:41,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 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 14:26:41,887 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 3 states and 539 transitions. [2021-03-25 14:26:41,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 92 flow [2021-03-25 14:26:41,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 33 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:26:41,888 INFO L241 Difference]: Finished difference. Result has 43 places, 33 transitions, 89 flow [2021-03-25 14:26:41,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2021-03-25 14:26:41,889 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -14 predicate places. [2021-03-25 14:26:41,889 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:41,890 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 89 flow [2021-03-25 14:26:41,890 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 89 flow [2021-03-25 14:26:41,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 89 flow [2021-03-25 14:26:41,895 INFO L129 PetriNetUnfolder]: 3/41 cut-off events. [2021-03-25 14:26:41,895 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:26:41,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 41 events. 3/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 90 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. [2021-03-25 14:26:41,896 INFO L142 LiptonReduction]: Number of co-enabled transitions 486 [2021-03-25 14:26:42,363 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:26:42,502 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:26:42,802 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:26:42,991 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:26:42,998 INFO L154 LiptonReduction]: Checked pairs total: 1590 [2021-03-25 14:26:42,998 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:26:42,998 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1109 [2021-03-25 14:26:42,999 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 85 flow [2021-03-25 14:26:43,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 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 14:26:43,000 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:43,000 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:43,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:26:43,000 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash 432543156, now seen corresponding path program 1 times [2021-03-25 14:26:43,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:43,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860730743] [2021-03-25 14:26:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:43,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:43,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:43,083 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 14:26:43,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860730743] [2021-03-25 14:26:43,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:43,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:26:43,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333606980] [2021-03-25 14:26:43,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:26:43,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:43,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:26:43,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:26:43,085 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 203 [2021-03-25 14:26:43,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 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 14:26:43,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:43,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 203 [2021-03-25 14:26:43,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:43,103 INFO L129 PetriNetUnfolder]: 2/37 cut-off events. [2021-03-25 14:26:43,103 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-25 14:26:43,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 37 events. 2/37 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 0 based on Foata normal form. 2/38 useless extension candidates. Maximal degree in co-relation 54. Up to 8 conditions per place. [2021-03-25 14:26:43,104 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 1 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2021-03-25 14:26:43,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 91 flow [2021-03-25 14:26:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:26:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:26:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-25 14:26:43,107 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8981937602627258 [2021-03-25 14:26:43,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-25 14:26:43,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-25 14:26:43,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:43,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-25 14:26:43,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 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 14:26:43,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 14:26:43,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 14:26:43,110 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 85 flow. Second operand 3 states and 547 transitions. [2021-03-25 14:26:43,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 91 flow [2021-03-25 14:26:43,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:26:43,112 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 90 flow [2021-03-25 14:26:43,112 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-25 14:26:43,112 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -14 predicate places. [2021-03-25 14:26:43,112 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:43,112 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 90 flow [2021-03-25 14:26:43,113 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 90 flow [2021-03-25 14:26:43,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 90 flow [2021-03-25 14:26:43,119 INFO L129 PetriNetUnfolder]: 2/37 cut-off events. [2021-03-25 14:26:43,119 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 14:26:43,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 37 events. 2/37 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 81 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 52. Up to 8 conditions per place. [2021-03-25 14:26:43,120 INFO L142 LiptonReduction]: Number of co-enabled transitions 484 [2021-03-25 14:26:43,295 INFO L154 LiptonReduction]: Checked pairs total: 512 [2021-03-25 14:26:43,296 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:43,296 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 184 [2021-03-25 14:26:43,299 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 90 flow [2021-03-25 14:26:43,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 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 14:26:43,299 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:43,299 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:43,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:26:43,300 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:43,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:43,300 INFO L82 PathProgramCache]: Analyzing trace with hash 619953064, now seen corresponding path program 1 times [2021-03-25 14:26:43,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:43,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645446770] [2021-03-25 14:26:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:43,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:43,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:26:43,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:43,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:26:43,449 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 14:26:43,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645446770] [2021-03-25 14:26:43,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:43,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:26:43,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714674886] [2021-03-25 14:26:43,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:26:43,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:43,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:26:43,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:26:43,452 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 203 [2021-03-25 14:26:43,453 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 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 14:26:43,453 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:43,453 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 203 [2021-03-25 14:26:43,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:43,591 INFO L129 PetriNetUnfolder]: 283/497 cut-off events. [2021-03-25 14:26:43,591 INFO L130 PetriNetUnfolder]: For 132/220 co-relation queries the response was YES. [2021-03-25 14:26:43,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 497 events. 283/497 cut-off events. For 132/220 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2535 event pairs, 216 based on Foata normal form. 6/450 useless extension candidates. Maximal degree in co-relation 1024. Up to 389 conditions per place. [2021-03-25 14:26:43,595 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 11 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2021-03-25 14:26:43,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 128 flow [2021-03-25 14:26:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:26:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:26:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2021-03-25 14:26:43,598 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2021-03-25 14:26:43,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2021-03-25 14:26:43,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2021-03-25 14:26:43,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:43,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2021-03-25 14:26:43,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 14:26:43,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 14:26:43,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 14:26:43,602 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 90 flow. Second operand 3 states and 504 transitions. [2021-03-25 14:26:43,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 128 flow [2021-03-25 14:26:43,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:26:43,605 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 105 flow [2021-03-25 14:26:43,606 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-03-25 14:26:43,606 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -13 predicate places. [2021-03-25 14:26:43,606 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:43,606 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 105 flow [2021-03-25 14:26:43,606 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 105 flow [2021-03-25 14:26:43,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 105 flow [2021-03-25 14:26:43,613 INFO L129 PetriNetUnfolder]: 6/52 cut-off events. [2021-03-25 14:26:43,613 INFO L130 PetriNetUnfolder]: For 21/24 co-relation queries the response was YES. [2021-03-25 14:26:43,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 52 events. 6/52 cut-off events. For 21/24 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 168 event pairs, 3 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 89. Up to 13 conditions per place. [2021-03-25 14:26:43,614 INFO L142 LiptonReduction]: Number of co-enabled transitions 550 [2021-03-25 14:26:43,619 INFO L154 LiptonReduction]: Checked pairs total: 463 [2021-03-25 14:26:43,619 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:43,619 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-25 14:26:43,621 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 105 flow [2021-03-25 14:26:43,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 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 14:26:43,622 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:43,622 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:43,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:26:43,622 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1206253667, now seen corresponding path program 1 times [2021-03-25 14:26:43,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:43,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471752453] [2021-03-25 14:26:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:43,731 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-25 14:26:43,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:26:43,743 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-25 14:26:43,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:26:43,757 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:26:43,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:26:43,784 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 14:26:43,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471752453] [2021-03-25 14:26:43,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:43,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:26:43,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327027519] [2021-03-25 14:26:43,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:26:43,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:43,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:26:43,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:26:43,790 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 203 [2021-03-25 14:26:43,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 105 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 14:26:43,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:43,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 203 [2021-03-25 14:26:43,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:43,954 INFO L129 PetriNetUnfolder]: 291/513 cut-off events. [2021-03-25 14:26:43,955 INFO L130 PetriNetUnfolder]: For 321/429 co-relation queries the response was YES. [2021-03-25 14:26:43,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 513 events. 291/513 cut-off events. For 321/429 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2624 event pairs, 192 based on Foata normal form. 9/473 useless extension candidates. Maximal degree in co-relation 1204. Up to 389 conditions per place. [2021-03-25 14:26:43,961 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 12 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2021-03-25 14:26:43,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 161 flow [2021-03-25 14:26:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:26:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:26:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 668 transitions. [2021-03-25 14:26:43,964 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8226600985221675 [2021-03-25 14:26:43,964 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 668 transitions. [2021-03-25 14:26:43,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 668 transitions. [2021-03-25 14:26:43,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:43,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 668 transitions. [2021-03-25 14:26:43,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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 14:26:43,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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 14:26:43,968 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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 14:26:43,968 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 105 flow. Second operand 4 states and 668 transitions. [2021-03-25 14:26:43,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 161 flow [2021-03-25 14:26:43,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:26:43,971 INFO L241 Difference]: Finished difference. Result has 47 places, 37 transitions, 141 flow [2021-03-25 14:26:43,971 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2021-03-25 14:26:43,971 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -10 predicate places. [2021-03-25 14:26:43,972 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:43,972 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 141 flow [2021-03-25 14:26:43,972 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 141 flow [2021-03-25 14:26:43,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 141 flow [2021-03-25 14:26:44,002 INFO L129 PetriNetUnfolder]: 78/200 cut-off events. [2021-03-25 14:26:44,002 INFO L130 PetriNetUnfolder]: For 198/234 co-relation queries the response was YES. [2021-03-25 14:26:44,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 200 events. 78/200 cut-off events. For 198/234 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 965 event pairs, 48 based on Foata normal form. 4/183 useless extension candidates. Maximal degree in co-relation 469. Up to 118 conditions per place. [2021-03-25 14:26:44,005 INFO L142 LiptonReduction]: Number of co-enabled transitions 634 [2021-03-25 14:26:44,052 INFO L154 LiptonReduction]: Checked pairs total: 377 [2021-03-25 14:26:44,052 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:44,053 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 81 [2021-03-25 14:26:44,055 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 141 flow [2021-03-25 14:26:44,055 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 14:26:44,055 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:44,055 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:44,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:26:44,056 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:44,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:44,056 INFO L82 PathProgramCache]: Analyzing trace with hash 365665065, now seen corresponding path program 1 times [2021-03-25 14:26:44,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:44,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708388783] [2021-03-25 14:26:44,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:44,148 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:26:44,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:26:44,173 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 14:26:44,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:26:44,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:44,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:26:44,211 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 14:26:44,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708388783] [2021-03-25 14:26:44,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:44,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:26:44,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21401002] [2021-03-25 14:26:44,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:26:44,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:44,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:26:44,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:26:44,214 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 203 [2021-03-25 14:26:44,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 141 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 14:26:44,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:44,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 203 [2021-03-25 14:26:44,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:44,370 INFO L129 PetriNetUnfolder]: 279/502 cut-off events. [2021-03-25 14:26:44,370 INFO L130 PetriNetUnfolder]: For 622/1166 co-relation queries the response was YES. [2021-03-25 14:26:44,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 502 events. 279/502 cut-off events. For 622/1166 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2508 event pairs, 118 based on Foata normal form. 26/481 useless extension candidates. Maximal degree in co-relation 1423. Up to 323 conditions per place. [2021-03-25 14:26:44,376 INFO L132 encePairwiseOnDemand]: 195/203 looper letters, 15 selfloop transitions, 9 changer transitions 0/46 dead transitions. [2021-03-25 14:26:44,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 217 flow [2021-03-25 14:26:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:26:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:26:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 669 transitions. [2021-03-25 14:26:44,378 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8238916256157636 [2021-03-25 14:26:44,378 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 669 transitions. [2021-03-25 14:26:44,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 669 transitions. [2021-03-25 14:26:44,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:44,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 669 transitions. [2021-03-25 14:26:44,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 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 14:26:44,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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 14:26:44,382 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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 14:26:44,382 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 141 flow. Second operand 4 states and 669 transitions. [2021-03-25 14:26:44,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 217 flow [2021-03-25 14:26:44,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:26:44,387 INFO L241 Difference]: Finished difference. Result has 50 places, 42 transitions, 190 flow [2021-03-25 14:26:44,387 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2021-03-25 14:26:44,387 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2021-03-25 14:26:44,387 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:44,387 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 190 flow [2021-03-25 14:26:44,388 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 190 flow [2021-03-25 14:26:44,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 190 flow [2021-03-25 14:26:44,483 INFO L129 PetriNetUnfolder]: 200/418 cut-off events. [2021-03-25 14:26:44,483 INFO L130 PetriNetUnfolder]: For 855/924 co-relation queries the response was YES. [2021-03-25 14:26:44,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 418 events. 200/418 cut-off events. For 855/924 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2374 event pairs, 91 based on Foata normal form. 3/368 useless extension candidates. Maximal degree in co-relation 1235. Up to 227 conditions per place. [2021-03-25 14:26:44,489 INFO L142 LiptonReduction]: Number of co-enabled transitions 720 [2021-03-25 14:26:44,523 INFO L154 LiptonReduction]: Checked pairs total: 256 [2021-03-25 14:26:44,523 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:44,523 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 136 [2021-03-25 14:26:44,526 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 190 flow [2021-03-25 14:26:44,527 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 14:26:44,527 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:44,527 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:44,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:26:44,527 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash -639836584, now seen corresponding path program 1 times [2021-03-25 14:26:44,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:44,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423021659] [2021-03-25 14:26:44,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:44,636 INFO L142 QuantifierPusher]: treesize reduction 30, result has 25.0 percent of original size [2021-03-25 14:26:44,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:26:44,645 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-25 14:26:44,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:26:44,656 INFO L142 QuantifierPusher]: treesize reduction 40, result has 54.0 percent of original size [2021-03-25 14:26:44,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 14:26:44,678 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:26:44,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:26:44,704 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 14:26:44,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423021659] [2021-03-25 14:26:44,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:44,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:26:44,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288481029] [2021-03-25 14:26:44,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:26:44,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:44,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:26:44,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:26:44,706 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 203 [2021-03-25 14:26:44,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 160.83333333333334) internal successors, (965), 6 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:44,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:44,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 203 [2021-03-25 14:26:44,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:44,884 INFO L129 PetriNetUnfolder]: 304/549 cut-off events. [2021-03-25 14:26:44,884 INFO L130 PetriNetUnfolder]: For 1091/2834 co-relation queries the response was YES. [2021-03-25 14:26:44,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 549 events. 304/549 cut-off events. For 1091/2834 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2807 event pairs, 90 based on Foata normal form. 38/538 useless extension candidates. Maximal degree in co-relation 1913. Up to 343 conditions per place. [2021-03-25 14:26:44,891 INFO L132 encePairwiseOnDemand]: 194/203 looper letters, 16 selfloop transitions, 13 changer transitions 0/51 dead transitions. [2021-03-25 14:26:44,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 292 flow [2021-03-25 14:26:44,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:26:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:26:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 825 transitions. [2021-03-25 14:26:44,894 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.812807881773399 [2021-03-25 14:26:44,894 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 825 transitions. [2021-03-25 14:26:44,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 825 transitions. [2021-03-25 14:26:44,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:44,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 825 transitions. [2021-03-25 14:26:44,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 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 14:26:44,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 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 14:26:44,898 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 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 14:26:44,898 INFO L185 Difference]: Start difference. First operand has 50 places, 42 transitions, 190 flow. Second operand 5 states and 825 transitions. [2021-03-25 14:26:44,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 292 flow [2021-03-25 14:26:44,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 282 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 14:26:44,902 INFO L241 Difference]: Finished difference. Result has 54 places, 46 transitions, 241 flow [2021-03-25 14:26:44,902 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2021-03-25 14:26:44,902 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2021-03-25 14:26:44,903 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:44,903 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 241 flow [2021-03-25 14:26:44,903 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 46 transitions, 241 flow [2021-03-25 14:26:44,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 241 flow [2021-03-25 14:26:44,964 INFO L129 PetriNetUnfolder]: 266/509 cut-off events. [2021-03-25 14:26:44,965 INFO L130 PetriNetUnfolder]: For 1376/1588 co-relation queries the response was YES. [2021-03-25 14:26:44,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 509 events. 266/509 cut-off events. For 1376/1588 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2755 event pairs, 104 based on Foata normal form. 3/437 useless extension candidates. Maximal degree in co-relation 1757. Up to 296 conditions per place. [2021-03-25 14:26:44,971 INFO L142 LiptonReduction]: Number of co-enabled transitions 812 [2021-03-25 14:26:45,023 INFO L154 LiptonReduction]: Checked pairs total: 339 [2021-03-25 14:26:45,023 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:45,023 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 120 [2021-03-25 14:26:45,024 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 241 flow [2021-03-25 14:26:45,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 160.83333333333334) internal successors, (965), 6 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:45,024 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:45,024 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:45,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:26:45,025 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:45,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash -497566534, now seen corresponding path program 2 times [2021-03-25 14:26:45,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:45,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188235642] [2021-03-25 14:26:45,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:45,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:45,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:26:45,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:45,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:26:45,123 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-03-25 14:26:45,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 14:26:45,158 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-03-25 14:26:45,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 14:26:45,193 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 14:26:45,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188235642] [2021-03-25 14:26:45,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:45,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:26:45,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961442488] [2021-03-25 14:26:45,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:26:45,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:45,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:26:45,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:26:45,195 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 203 [2021-03-25 14:26:45,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:45,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:45,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 203 [2021-03-25 14:26:45,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:45,445 INFO L129 PetriNetUnfolder]: 333/593 cut-off events. [2021-03-25 14:26:45,445 INFO L130 PetriNetUnfolder]: For 1923/4995 co-relation queries the response was YES. [2021-03-25 14:26:45,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 593 events. 333/593 cut-off events. For 1923/4995 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3017 event pairs, 67 based on Foata normal form. 51/593 useless extension candidates. Maximal degree in co-relation 2406. Up to 329 conditions per place. [2021-03-25 14:26:45,452 INFO L132 encePairwiseOnDemand]: 195/203 looper letters, 14 selfloop transitions, 23 changer transitions 0/59 dead transitions. [2021-03-25 14:26:45,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 403 flow [2021-03-25 14:26:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:26:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:26:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 816 transitions. [2021-03-25 14:26:45,455 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8039408866995074 [2021-03-25 14:26:45,455 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 816 transitions. [2021-03-25 14:26:45,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 816 transitions. [2021-03-25 14:26:45,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:45,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 816 transitions. [2021-03-25 14:26:45,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 163.2) internal successors, (816), 5 states have internal predecessors, (816), 0 states have call successors, (0), 0 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 14:26:45,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 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 14:26:45,459 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 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 14:26:45,460 INFO L185 Difference]: Start difference. First operand has 54 places, 46 transitions, 241 flow. Second operand 5 states and 816 transitions. [2021-03-25 14:26:45,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 403 flow [2021-03-25 14:26:45,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 374 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-25 14:26:45,465 INFO L241 Difference]: Finished difference. Result has 57 places, 54 transitions, 356 flow [2021-03-25 14:26:45,465 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2021-03-25 14:26:45,466 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2021-03-25 14:26:45,466 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:45,466 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 54 transitions, 356 flow [2021-03-25 14:26:45,466 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 54 transitions, 356 flow [2021-03-25 14:26:45,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 54 transitions, 356 flow [2021-03-25 14:26:45,595 INFO L129 PetriNetUnfolder]: 293/586 cut-off events. [2021-03-25 14:26:45,595 INFO L130 PetriNetUnfolder]: For 1957/3176 co-relation queries the response was YES. [2021-03-25 14:26:45,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 586 events. 293/586 cut-off events. For 1957/3176 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3442 event pairs, 57 based on Foata normal form. 8/541 useless extension candidates. Maximal degree in co-relation 2413. Up to 302 conditions per place. [2021-03-25 14:26:45,604 INFO L142 LiptonReduction]: Number of co-enabled transitions 956 [2021-03-25 14:26:45,711 INFO L154 LiptonReduction]: Checked pairs total: 431 [2021-03-25 14:26:45,711 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:45,711 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 245 [2021-03-25 14:26:45,715 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 356 flow [2021-03-25 14:26:45,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:45,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:45,716 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:45,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:26:45,716 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:45,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:45,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1574211486, now seen corresponding path program 1 times [2021-03-25 14:26:45,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:45,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253795101] [2021-03-25 14:26:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:45,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:45,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:45,780 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:26:45,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:26:45,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:45,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:45,791 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 14:26:45,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253795101] [2021-03-25 14:26:45,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:45,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:26:45,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385625283] [2021-03-25 14:26:45,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:26:45,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:45,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:26:45,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:26:45,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2021-03-25 14:26:45,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 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 14:26:45,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:45,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2021-03-25 14:26:45,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:46,016 INFO L129 PetriNetUnfolder]: 860/1580 cut-off events. [2021-03-25 14:26:46,016 INFO L130 PetriNetUnfolder]: For 3834/5042 co-relation queries the response was YES. [2021-03-25 14:26:46,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5234 conditions, 1580 events. 860/1580 cut-off events. For 3834/5042 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 10942 event pairs, 349 based on Foata normal form. 188/1495 useless extension candidates. Maximal degree in co-relation 5213. Up to 823 conditions per place. [2021-03-25 14:26:46,036 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 13 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2021-03-25 14:26:46,036 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 430 flow [2021-03-25 14:26:46,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:26:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:26:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 864 transitions. [2021-03-25 14:26:46,039 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8512315270935961 [2021-03-25 14:26:46,039 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 864 transitions. [2021-03-25 14:26:46,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 864 transitions. [2021-03-25 14:26:46,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:46,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 864 transitions. [2021-03-25 14:26:46,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 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 14:26:46,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 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 14:26:46,043 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 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 14:26:46,043 INFO L185 Difference]: Start difference. First operand has 57 places, 54 transitions, 356 flow. Second operand 5 states and 864 transitions. [2021-03-25 14:26:46,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 430 flow [2021-03-25 14:26:46,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 406 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-25 14:26:46,049 INFO L241 Difference]: Finished difference. Result has 63 places, 63 transitions, 411 flow [2021-03-25 14:26:46,050 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2021-03-25 14:26:46,050 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2021-03-25 14:26:46,050 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:46,050 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 63 transitions, 411 flow [2021-03-25 14:26:46,050 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 63 transitions, 411 flow [2021-03-25 14:26:46,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 63 transitions, 411 flow [2021-03-25 14:26:46,213 INFO L129 PetriNetUnfolder]: 769/1412 cut-off events. [2021-03-25 14:26:46,213 INFO L130 PetriNetUnfolder]: For 5023/6093 co-relation queries the response was YES. [2021-03-25 14:26:46,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5714 conditions, 1412 events. 769/1412 cut-off events. For 5023/6093 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 9424 event pairs, 247 based on Foata normal form. 64/1345 useless extension candidates. Maximal degree in co-relation 5691. Up to 612 conditions per place. [2021-03-25 14:26:46,238 INFO L142 LiptonReduction]: Number of co-enabled transitions 1276 [2021-03-25 14:26:46,461 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:26:46,869 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-25 14:26:47,006 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 14:26:47,064 INFO L154 LiptonReduction]: Checked pairs total: 874 [2021-03-25 14:26:47,064 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:26:47,064 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1014 [2021-03-25 14:26:47,065 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 414 flow [2021-03-25 14:26:47,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 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 14:26:47,065 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:47,066 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:47,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:26:47,066 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:47,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:47,066 INFO L82 PathProgramCache]: Analyzing trace with hash -253538573, now seen corresponding path program 1 times [2021-03-25 14:26:47,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:47,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282067670] [2021-03-25 14:26:47,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:47,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:47,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:47,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:47,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:47,114 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:26:47,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:26:47,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:47,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:47,122 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 14:26:47,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282067670] [2021-03-25 14:26:47,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:47,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:26:47,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789278773] [2021-03-25 14:26:47,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:26:47,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:47,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:26:47,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:26:47,124 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 204 [2021-03-25 14:26:47,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 0 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 14:26:47,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:47,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 204 [2021-03-25 14:26:47,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:47,320 INFO L129 PetriNetUnfolder]: 563/1158 cut-off events. [2021-03-25 14:26:47,320 INFO L130 PetriNetUnfolder]: For 3642/7041 co-relation queries the response was YES. [2021-03-25 14:26:47,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4700 conditions, 1158 events. 563/1158 cut-off events. For 3642/7041 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 8096 event pairs, 82 based on Foata normal form. 438/1441 useless extension candidates. Maximal degree in co-relation 4675. Up to 649 conditions per place. [2021-03-25 14:26:47,335 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 14 selfloop transitions, 19 changer transitions 0/76 dead transitions. [2021-03-25 14:26:47,336 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 546 flow [2021-03-25 14:26:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:26:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:26:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1217 transitions. [2021-03-25 14:26:47,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8522408963585434 [2021-03-25 14:26:47,339 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1217 transitions. [2021-03-25 14:26:47,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1217 transitions. [2021-03-25 14:26:47,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:47,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1217 transitions. [2021-03-25 14:26:47,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 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 14:26:47,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 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 14:26:47,345 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 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 14:26:47,345 INFO L185 Difference]: Start difference. First operand has 63 places, 63 transitions, 414 flow. Second operand 7 states and 1217 transitions. [2021-03-25 14:26:47,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 546 flow [2021-03-25 14:26:47,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 527 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-03-25 14:26:47,353 INFO L241 Difference]: Finished difference. Result has 71 places, 70 transitions, 519 flow [2021-03-25 14:26:47,354 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=519, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2021-03-25 14:26:47,354 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2021-03-25 14:26:47,354 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:47,354 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 70 transitions, 519 flow [2021-03-25 14:26:47,354 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 70 transitions, 519 flow [2021-03-25 14:26:47,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 70 transitions, 519 flow [2021-03-25 14:26:47,451 INFO L129 PetriNetUnfolder]: 432/945 cut-off events. [2021-03-25 14:26:47,452 INFO L130 PetriNetUnfolder]: For 4215/6051 co-relation queries the response was YES. [2021-03-25 14:26:47,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4327 conditions, 945 events. 432/945 cut-off events. For 4215/6051 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6594 event pairs, 81 based on Foata normal form. 70/926 useless extension candidates. Maximal degree in co-relation 4300. Up to 514 conditions per place. [2021-03-25 14:26:47,473 INFO L142 LiptonReduction]: Number of co-enabled transitions 1528 [2021-03-25 14:26:47,491 INFO L154 LiptonReduction]: Checked pairs total: 356 [2021-03-25 14:26:47,491 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:47,491 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 137 [2021-03-25 14:26:47,493 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 519 flow [2021-03-25 14:26:47,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 0 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 14:26:47,493 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:47,493 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] [2021-03-25 14:26:47,493 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:26:47,493 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:47,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:47,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1652740490, now seen corresponding path program 1 times [2021-03-25 14:26:47,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:47,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495859255] [2021-03-25 14:26:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:47,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:47,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:47,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:47,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:47,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:47,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:47,559 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:26:47,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:26:47,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:47,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:47,568 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 14:26:47,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495859255] [2021-03-25 14:26:47,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:47,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:26:47,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552851937] [2021-03-25 14:26:47,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:26:47,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:47,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:26:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:26:47,570 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 204 [2021-03-25 14:26:47,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 519 flow. Second operand has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 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 14:26:47,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:47,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 204 [2021-03-25 14:26:47,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:47,837 INFO L129 PetriNetUnfolder]: 449/975 cut-off events. [2021-03-25 14:26:47,838 INFO L130 PetriNetUnfolder]: For 5232/11798 co-relation queries the response was YES. [2021-03-25 14:26:47,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4732 conditions, 975 events. 449/975 cut-off events. For 5232/11798 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6818 event pairs, 26 based on Foata normal form. 573/1409 useless extension candidates. Maximal degree in co-relation 4703. Up to 620 conditions per place. [2021-03-25 14:26:47,854 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 10 selfloop transitions, 28 changer transitions 4/83 dead transitions. [2021-03-25 14:26:47,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 706 flow [2021-03-25 14:26:47,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:26:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:26:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1565 transitions. [2021-03-25 14:26:47,858 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8523965141612201 [2021-03-25 14:26:47,858 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1565 transitions. [2021-03-25 14:26:47,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1565 transitions. [2021-03-25 14:26:47,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:47,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1565 transitions. [2021-03-25 14:26:47,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 173.88888888888889) internal successors, (1565), 9 states have internal predecessors, (1565), 0 states have call successors, (0), 0 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 14:26:47,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 0 states have call successors, (0), 0 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 14:26:47,865 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 0 states have call successors, (0), 0 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 14:26:47,865 INFO L185 Difference]: Start difference. First operand has 71 places, 70 transitions, 519 flow. Second operand 9 states and 1565 transitions. [2021-03-25 14:26:47,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 706 flow [2021-03-25 14:26:47,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 628 flow, removed 24 selfloop flow, removed 6 redundant places. [2021-03-25 14:26:47,896 INFO L241 Difference]: Finished difference. Result has 76 places, 76 transitions, 590 flow [2021-03-25 14:26:47,896 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=590, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2021-03-25 14:26:47,896 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2021-03-25 14:26:47,897 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:47,897 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 76 transitions, 590 flow [2021-03-25 14:26:47,897 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 76 transitions, 590 flow [2021-03-25 14:26:47,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 76 transitions, 590 flow [2021-03-25 14:26:47,976 INFO L129 PetriNetUnfolder]: 277/678 cut-off events. [2021-03-25 14:26:47,977 INFO L130 PetriNetUnfolder]: For 3007/3640 co-relation queries the response was YES. [2021-03-25 14:26:47,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3008 conditions, 678 events. 277/678 cut-off events. For 3007/3640 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4859 event pairs, 27 based on Foata normal form. 22/632 useless extension candidates. Maximal degree in co-relation 2980. Up to 259 conditions per place. [2021-03-25 14:26:47,991 INFO L142 LiptonReduction]: Number of co-enabled transitions 1636 [2021-03-25 14:26:48,029 INFO L154 LiptonReduction]: Checked pairs total: 944 [2021-03-25 14:26:48,030 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:26:48,030 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 133 [2021-03-25 14:26:48,030 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 564 flow [2021-03-25 14:26:48,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 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 14:26:48,031 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:48,031 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 14:26:48,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:26:48,031 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash -539635771, now seen corresponding path program 1 times [2021-03-25 14:26:48,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:48,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119743592] [2021-03-25 14:26:48,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:48,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:48,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:48,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:48,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:48,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:48,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:48,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:48,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:48,151 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:26:48,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:26:48,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:48,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:48,160 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 14:26:48,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119743592] [2021-03-25 14:26:48,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:48,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:26:48,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114502256] [2021-03-25 14:26:48,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:26:48,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:48,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:26:48,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:26:48,164 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 204 [2021-03-25 14:26:48,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 564 flow. Second operand has 7 states, 7 states have (on average 169.85714285714286) internal successors, (1189), 7 states have internal predecessors, (1189), 0 states have call successors, (0), 0 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 14:26:48,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:48,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 204 [2021-03-25 14:26:48,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:48,318 INFO L129 PetriNetUnfolder]: 298/587 cut-off events. [2021-03-25 14:26:48,318 INFO L130 PetriNetUnfolder]: For 2004/2954 co-relation queries the response was YES. [2021-03-25 14:26:48,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2416 conditions, 587 events. 298/587 cut-off events. For 2004/2954 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3159 event pairs, 25 based on Foata normal form. 81/566 useless extension candidates. Maximal degree in co-relation 2386. Up to 220 conditions per place. [2021-03-25 14:26:48,327 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 6 selfloop transitions, 18 changer transitions 5/70 dead transitions. [2021-03-25 14:26:48,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 554 flow [2021-03-25 14:26:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:26:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:26:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1383 transitions. [2021-03-25 14:26:48,331 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8474264705882353 [2021-03-25 14:26:48,331 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1383 transitions. [2021-03-25 14:26:48,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1383 transitions. [2021-03-25 14:26:48,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:48,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1383 transitions. [2021-03-25 14:26:48,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 172.875) internal successors, (1383), 8 states have internal predecessors, (1383), 0 states have call successors, (0), 0 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 14:26:48,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 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 14:26:48,336 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 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 14:26:48,336 INFO L185 Difference]: Start difference. First operand has 76 places, 73 transitions, 564 flow. Second operand 8 states and 1383 transitions. [2021-03-25 14:26:48,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 554 flow [2021-03-25 14:26:48,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 455 flow, removed 39 selfloop flow, removed 9 redundant places. [2021-03-25 14:26:48,346 INFO L241 Difference]: Finished difference. Result has 69 places, 62 transitions, 401 flow [2021-03-25 14:26:48,346 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=401, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2021-03-25 14:26:48,346 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2021-03-25 14:26:48,346 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:48,347 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 62 transitions, 401 flow [2021-03-25 14:26:48,347 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 62 transitions, 401 flow [2021-03-25 14:26:48,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 62 transitions, 401 flow [2021-03-25 14:26:48,379 INFO L129 PetriNetUnfolder]: 146/332 cut-off events. [2021-03-25 14:26:48,379 INFO L130 PetriNetUnfolder]: For 624/983 co-relation queries the response was YES. [2021-03-25 14:26:48,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 332 events. 146/332 cut-off events. For 624/983 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1660 event pairs, 21 based on Foata normal form. 1/298 useless extension candidates. Maximal degree in co-relation 1167. Up to 113 conditions per place. [2021-03-25 14:26:48,384 INFO L142 LiptonReduction]: Number of co-enabled transitions 1044 [2021-03-25 14:26:48,719 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:26:48,858 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:26:49,466 WARN L205 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 196 [2021-03-25 14:26:49,727 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 14:26:51,065 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 350 DAG size of output: 272 [2021-03-25 14:26:51,543 WARN L205 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 14:26:51,553 INFO L154 LiptonReduction]: Checked pairs total: 1350 [2021-03-25 14:26:51,553 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:26:51,553 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3207 [2021-03-25 14:26:51,554 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 385 flow [2021-03-25 14:26:51,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 169.85714285714286) internal successors, (1189), 7 states have internal predecessors, (1189), 0 states have call successors, (0), 0 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 14:26:51,554 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:51,555 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, 1, 1] [2021-03-25 14:26:51,555 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:26:51,555 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:51,555 INFO L82 PathProgramCache]: Analyzing trace with hash -825934580, now seen corresponding path program 1 times [2021-03-25 14:26:51,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:51,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311551867] [2021-03-25 14:26:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:51,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:51,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:51,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:51,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:51,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:51,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:51,603 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 14:26:51,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311551867] [2021-03-25 14:26:51,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:51,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:26:51,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899557350] [2021-03-25 14:26:51,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:26:51,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:26:51,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:26:51,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 206 [2021-03-25 14:26:51,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 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 14:26:51,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:51,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 206 [2021-03-25 14:26:51,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:51,680 INFO L129 PetriNetUnfolder]: 253/557 cut-off events. [2021-03-25 14:26:51,680 INFO L130 PetriNetUnfolder]: For 1994/2530 co-relation queries the response was YES. [2021-03-25 14:26:51,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1989 conditions, 557 events. 253/557 cut-off events. For 1994/2530 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3201 event pairs, 31 based on Foata normal form. 61/563 useless extension candidates. Maximal degree in co-relation 1962. Up to 180 conditions per place. [2021-03-25 14:26:51,686 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 3 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2021-03-25 14:26:51,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 397 flow [2021-03-25 14:26:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:26:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:26:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 706 transitions. [2021-03-25 14:26:51,689 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8567961165048543 [2021-03-25 14:26:51,689 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 706 transitions. [2021-03-25 14:26:51,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 706 transitions. [2021-03-25 14:26:51,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:51,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 706 transitions. [2021-03-25 14:26:51,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 176.5) internal successors, (706), 4 states have internal predecessors, (706), 0 states have call successors, (0), 0 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 14:26:51,692 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 14:26:51,692 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 14:26:51,692 INFO L185 Difference]: Start difference. First operand has 65 places, 59 transitions, 385 flow. Second operand 4 states and 706 transitions. [2021-03-25 14:26:51,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 397 flow [2021-03-25 14:26:51,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 60 transitions, 328 flow, removed 19 selfloop flow, removed 8 redundant places. [2021-03-25 14:26:51,699 INFO L241 Difference]: Finished difference. Result has 62 places, 60 transitions, 329 flow [2021-03-25 14:26:51,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2021-03-25 14:26:51,699 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 5 predicate places. [2021-03-25 14:26:51,699 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:51,699 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 329 flow [2021-03-25 14:26:51,699 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 329 flow [2021-03-25 14:26:51,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 329 flow [2021-03-25 14:26:51,749 INFO L129 PetriNetUnfolder]: 241/517 cut-off events. [2021-03-25 14:26:51,749 INFO L130 PetriNetUnfolder]: For 808/1260 co-relation queries the response was YES. [2021-03-25 14:26:51,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 517 events. 241/517 cut-off events. For 808/1260 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2896 event pairs, 30 based on Foata normal form. 17/479 useless extension candidates. Maximal degree in co-relation 1579. Up to 180 conditions per place. [2021-03-25 14:26:51,757 INFO L142 LiptonReduction]: Number of co-enabled transitions 1054 [2021-03-25 14:26:51,762 INFO L154 LiptonReduction]: Checked pairs total: 236 [2021-03-25 14:26:51,762 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:51,762 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 63 [2021-03-25 14:26:51,763 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 329 flow [2021-03-25 14:26:51,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 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 14:26:51,763 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:51,763 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 14:26:51,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:26:51,763 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:51,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1250760256, now seen corresponding path program 1 times [2021-03-25 14:26:51,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:51,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339144318] [2021-03-25 14:26:51,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:51,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:51,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:51,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:51,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:51,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:51,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:51,863 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 14:26:51,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339144318] [2021-03-25 14:26:51,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:51,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:26:51,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918400337] [2021-03-25 14:26:51,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:26:51,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:51,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:26:51,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:26:51,865 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 206 [2021-03-25 14:26:51,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:51,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:51,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 206 [2021-03-25 14:26:51,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:51,988 INFO L129 PetriNetUnfolder]: 509/1095 cut-off events. [2021-03-25 14:26:51,988 INFO L130 PetriNetUnfolder]: For 2816/3701 co-relation queries the response was YES. [2021-03-25 14:26:51,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3407 conditions, 1095 events. 509/1095 cut-off events. For 2816/3701 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7451 event pairs, 62 based on Foata normal form. 69/1067 useless extension candidates. Maximal degree in co-relation 3383. Up to 363 conditions per place. [2021-03-25 14:26:51,997 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 3 selfloop transitions, 2 changer transitions 1/61 dead transitions. [2021-03-25 14:26:51,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 341 flow [2021-03-25 14:26:51,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:26:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:26:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 726 transitions. [2021-03-25 14:26:52,000 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8810679611650486 [2021-03-25 14:26:52,000 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 726 transitions. [2021-03-25 14:26:52,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 726 transitions. [2021-03-25 14:26:52,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:52,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 726 transitions. [2021-03-25 14:26:52,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.5) internal successors, (726), 4 states have internal predecessors, (726), 0 states have call successors, (0), 0 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 14:26:52,014 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 14:26:52,015 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 14:26:52,015 INFO L185 Difference]: Start difference. First operand has 62 places, 60 transitions, 329 flow. Second operand 4 states and 726 transitions. [2021-03-25 14:26:52,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 341 flow [2021-03-25 14:26:52,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:26:52,031 INFO L241 Difference]: Finished difference. Result has 66 places, 60 transitions, 336 flow [2021-03-25 14:26:52,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2021-03-25 14:26:52,031 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2021-03-25 14:26:52,032 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:52,032 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 60 transitions, 336 flow [2021-03-25 14:26:52,032 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 60 transitions, 336 flow [2021-03-25 14:26:52,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 60 transitions, 336 flow [2021-03-25 14:26:52,120 INFO L129 PetriNetUnfolder]: 481/1017 cut-off events. [2021-03-25 14:26:52,120 INFO L130 PetriNetUnfolder]: For 1449/2053 co-relation queries the response was YES. [2021-03-25 14:26:52,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3179 conditions, 1017 events. 481/1017 cut-off events. For 1449/2053 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6810 event pairs, 62 based on Foata normal form. 19/939 useless extension candidates. Maximal degree in co-relation 3155. Up to 356 conditions per place. [2021-03-25 14:26:52,137 INFO L142 LiptonReduction]: Number of co-enabled transitions 1066 [2021-03-25 14:26:52,146 INFO L154 LiptonReduction]: Checked pairs total: 99 [2021-03-25 14:26:52,147 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:52,147 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 115 [2021-03-25 14:26:52,147 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 336 flow [2021-03-25 14:26:52,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:52,147 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:52,147 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 14:26:52,148 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:26:52,148 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:52,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:52,148 INFO L82 PathProgramCache]: Analyzing trace with hash 808919482, now seen corresponding path program 2 times [2021-03-25 14:26:52,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:52,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430604187] [2021-03-25 14:26:52,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:52,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:52,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:52,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:52,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:52,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 14:26:52,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430604187] [2021-03-25 14:26:52,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:52,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:26:52,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011991956] [2021-03-25 14:26:52,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:26:52,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:52,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:26:52,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:26:52,199 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 206 [2021-03-25 14:26:52,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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 14:26:52,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:52,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 206 [2021-03-25 14:26:52,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:52,385 INFO L129 PetriNetUnfolder]: 811/1692 cut-off events. [2021-03-25 14:26:52,385 INFO L130 PetriNetUnfolder]: For 4948/5944 co-relation queries the response was YES. [2021-03-25 14:26:52,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5319 conditions, 1692 events. 811/1692 cut-off events. For 4948/5944 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 12587 event pairs, 108 based on Foata normal form. 105/1635 useless extension candidates. Maximal degree in co-relation 5293. Up to 548 conditions per place. [2021-03-25 14:26:52,400 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 3 selfloop transitions, 2 changer transitions 13/61 dead transitions. [2021-03-25 14:26:52,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 354 flow [2021-03-25 14:26:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:26:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:26:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2021-03-25 14:26:52,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.901294498381877 [2021-03-25 14:26:52,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 557 transitions. [2021-03-25 14:26:52,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 557 transitions. [2021-03-25 14:26:52,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:52,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 557 transitions. [2021-03-25 14:26:52,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 14:26:52,405 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 14:26:52,405 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 14:26:52,405 INFO L185 Difference]: Start difference. First operand has 66 places, 60 transitions, 336 flow. Second operand 3 states and 557 transitions. [2021-03-25 14:26:52,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 354 flow [2021-03-25 14:26:52,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:26:52,439 INFO L241 Difference]: Finished difference. Result has 68 places, 48 transitions, 272 flow [2021-03-25 14:26:52,439 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2021-03-25 14:26:52,439 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2021-03-25 14:26:52,439 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:52,439 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 48 transitions, 272 flow [2021-03-25 14:26:52,440 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 48 transitions, 272 flow [2021-03-25 14:26:52,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 48 transitions, 272 flow [2021-03-25 14:26:52,475 INFO L129 PetriNetUnfolder]: 182/408 cut-off events. [2021-03-25 14:26:52,476 INFO L130 PetriNetUnfolder]: For 931/1146 co-relation queries the response was YES. [2021-03-25 14:26:52,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 408 events. 182/408 cut-off events. For 931/1146 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2196 event pairs, 34 based on Foata normal form. 15/383 useless extension candidates. Maximal degree in co-relation 1271. Up to 136 conditions per place. [2021-03-25 14:26:52,481 INFO L142 LiptonReduction]: Number of co-enabled transitions 588 [2021-03-25 14:26:52,597 INFO L154 LiptonReduction]: Checked pairs total: 82 [2021-03-25 14:26:52,597 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:26:52,598 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 159 [2021-03-25 14:26:52,600 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 271 flow [2021-03-25 14:26:52,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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 14:26:52,600 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:52,600 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, 1] [2021-03-25 14:26:52,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:26:52,601 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:52,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1048355085, now seen corresponding path program 1 times [2021-03-25 14:26:52,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:52,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634312716] [2021-03-25 14:26:52,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:26:52,646 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:26:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:26:52,681 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:26:52,721 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:26:52,722 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:26:52,723 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:26:52,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:26:52 BasicIcfg [2021-03-25 14:26:52,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:26:52,843 INFO L168 Benchmark]: Toolchain (without parser) took 25894.61 ms. Allocated memory was 255.9 MB in the beginning and 725.6 MB in the end (delta: 469.8 MB). Free memory was 234.4 MB in the beginning and 297.5 MB in the end (delta: -63.1 MB). Peak memory consumption was 406.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:52,844 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:26:52,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.75 ms. Allocated memory was 255.9 MB in the beginning and 337.6 MB in the end (delta: 81.8 MB). Free memory was 234.4 MB in the beginning and 296.4 MB in the end (delta: -62.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:52,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.78 ms. Allocated memory is still 337.6 MB. Free memory was 296.4 MB in the beginning and 293.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:52,844 INFO L168 Benchmark]: Boogie Preprocessor took 35.59 ms. Allocated memory is still 337.6 MB. Free memory was 293.9 MB in the beginning and 291.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:52,844 INFO L168 Benchmark]: RCFGBuilder took 1950.60 ms. Allocated memory is still 337.6 MB. Free memory was 291.1 MB in the beginning and 162.7 MB in the end (delta: 128.4 MB). Peak memory consumption was 128.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:52,845 INFO L168 Benchmark]: TraceAbstraction took 23336.47 ms. Allocated memory was 337.6 MB in the beginning and 725.6 MB in the end (delta: 388.0 MB). Free memory was 162.7 MB in the beginning and 297.5 MB in the end (delta: -134.8 MB). Peak memory consumption was 254.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:52,846 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 513.75 ms. Allocated memory was 255.9 MB in the beginning and 337.6 MB in the end (delta: 81.8 MB). Free memory was 234.4 MB in the beginning and 296.4 MB in the end (delta: -62.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 51.78 ms. Allocated memory is still 337.6 MB. Free memory was 296.4 MB in the beginning and 293.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 35.59 ms. Allocated memory is still 337.6 MB. Free memory was 293.9 MB in the beginning and 291.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1950.60 ms. Allocated memory is still 337.6 MB. Free memory was 291.1 MB in the beginning and 162.7 MB in the end (delta: 128.4 MB). Peak memory consumption was 128.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 23336.47 ms. Allocated memory was 337.6 MB in the beginning and 725.6 MB in the end (delta: 388.0 MB). Free memory was 162.7 MB in the beginning and 297.5 MB in the end (delta: -134.8 MB). Peak memory consumption was 254.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8586.3ms, 124 PlacesBefore, 57 PlacesAfterwards, 113 TransitionsBefore, 45 TransitionsAfterwards, 2766 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5586 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2606, positive: 2475, positive conditional: 0, positive unconditional: 2475, negative: 131, negative conditional: 0, negative unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1741, positive: 1696, positive conditional: 0, positive unconditional: 1696, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1741, positive: 1696, positive conditional: 0, positive unconditional: 1696, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1741, positive: 1684, positive conditional: 0, positive unconditional: 1684, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 713, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 666, negative conditional: 0, negative unconditional: 666, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2606, positive: 779, positive conditional: 0, positive unconditional: 779, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 1741, unknown conditional: 0, unknown unconditional: 1741] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 221, Positive conditional cache size: 0, Positive unconditional cache size: 221, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2846.4ms, 53 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 31 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 1748 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 496, positive: 407, positive conditional: 0, positive unconditional: 407, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 228, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 496, positive: 377, positive conditional: 0, positive unconditional: 377, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 43, unknown conditional: 0, unknown unconditional: 43] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 229, Positive conditional cache size: 0, Positive unconditional cache size: 229, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1108.3ms, 43 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1590 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 476, positive: 398, positive conditional: 0, positive unconditional: 398, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 476, positive: 389, positive conditional: 0, positive unconditional: 389, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 238, Positive conditional cache size: 0, Positive unconditional cache size: 238, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 182.8ms, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 512 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 172, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 172, negative conditional: 0, negative unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 243, Positive conditional cache size: 0, Positive unconditional cache size: 243, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.8ms, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 463 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 22, negative conditional: 0, negative unconditional: 22, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 106, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 243, Positive conditional cache size: 0, Positive unconditional cache size: 243, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 80.3ms, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 377 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 160, positive: 144, positive conditional: 0, positive unconditional: 144, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, positive: 139, positive conditional: 0, positive unconditional: 139, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 248, Positive conditional cache size: 0, Positive unconditional cache size: 248, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 135.4ms, 50 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 720 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 256 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 97, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 254, Positive conditional cache size: 0, Positive unconditional cache size: 254, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 120.3ms, 54 PlacesBefore, 54 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 812 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 339 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 70, positive conditional: 0, positive unconditional: 70, 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: 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 82, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 254, Positive conditional cache size: 0, Positive unconditional cache size: 254, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 244.8ms, 57 PlacesBefore, 57 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 956 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 431 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 77, positive conditional: 0, positive unconditional: 77, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 90, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 257, Positive conditional cache size: 0, Positive unconditional cache size: 257, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1014.1ms, 63 PlacesBefore, 63 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 1276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 874 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 107, positive: 85, positive conditional: 0, positive unconditional: 85, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 107, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 265, Positive conditional cache size: 0, Positive unconditional cache size: 265, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 136.9ms, 71 PlacesBefore, 71 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 1528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 356 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 69, positive: 61, positive conditional: 0, positive unconditional: 61, 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: 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 69, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 267, Positive conditional cache size: 0, Positive unconditional cache size: 267, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 132.9ms, 76 PlacesBefore, 76 PlacesAfterwards, 76 TransitionsBefore, 73 TransitionsAfterwards, 1636 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 944 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 261, positive: 243, positive conditional: 0, positive unconditional: 243, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 261, positive: 234, positive conditional: 0, positive unconditional: 234, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 253, Positive conditional cache size: 0, Positive unconditional cache size: 253, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3206.6ms, 69 PlacesBefore, 65 PlacesAfterwards, 62 TransitionsBefore, 59 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1350 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 610, positive: 571, positive conditional: 0, positive unconditional: 571, 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: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 610, positive: 553, positive conditional: 0, positive unconditional: 553, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.7ms, 62 PlacesBefore, 62 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1054 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 50, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 7, negative conditional: 0, negative unconditional: 7, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 50, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 114.7ms, 66 PlacesBefore, 66 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1066 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 99 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 3, negative conditional: 0, negative unconditional: 3, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 42, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 157.9ms, 68 PlacesBefore, 62 PlacesAfterwards, 48 TransitionsBefore, 45 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 82 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 82, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - 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; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t741; [L852] FCALL, FORK 0 pthread_create(&t741, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t742; [L854] FCALL, FORK 0 pthread_create(&t742, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t743; [L856] FCALL, FORK 0 pthread_create(&t743, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 z = 1 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L857] 0 pthread_t t744; [L858] FCALL, FORK 0 pthread_create(&t744, ((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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 4 z = 2 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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$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=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23077.8ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2780.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8692.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 68 SDtfs, 37 SDslu, 24 SDs, 0 SdLazy, 408 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 489.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 473.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=590occurred in iteration=11, InterpolantAutomatonStates: 70, 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: 48.0ms SsaConstructionTime, 588.8ms SatisfiabilityAnalysisTime, 1066.6ms InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 1614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...