/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:41:42,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:41:42,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:41:42,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:41:42,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:41:42,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:41:42,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:41:42,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:41:42,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:41:42,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:41:42,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:41:42,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:41:42,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:41:42,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:41:42,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:41:42,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:41:42,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:41:42,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:41:42,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:41:42,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:41:42,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:41:42,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:41:42,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:41:42,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:41:42,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:41:42,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:41:42,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:41:42,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:41:42,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:41:42,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:41:42,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:41:42,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:41:42,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:41:42,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:41:42,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:41:42,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:41:42,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:41:42,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:41:42,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:41:42,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:41:42,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:41:42,645 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 04:41:42,682 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:41:42,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:41:42,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:41:42,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:41:42,684 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:41:42,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:41:42,684 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:41:42,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:41:42,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:41:42,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:41:42,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:41:42,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:41:42,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:41:42,685 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:41:42,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:41:42,685 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:41:42,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:41:42,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:41:42,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:41:42,686 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:41:42,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:41:42,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:41:42,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:41:42,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:41:42,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:41:42,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:41:42,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:41:42,687 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:41:42,687 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:41:42,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:41:42,687 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:41:42,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:41:43,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:41:43,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:41:43,011 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:41:43,012 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:41:43,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_tso.opt.i [2021-03-25 04:41:43,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91c91eacd/82e49ac2046e4f95b56f2e1602826287/FLAG78fe6036e [2021-03-25 04:41:43,822 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:41:43,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_tso.opt.i [2021-03-25 04:41:43,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91c91eacd/82e49ac2046e4f95b56f2e1602826287/FLAG78fe6036e [2021-03-25 04:41:44,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91c91eacd/82e49ac2046e4f95b56f2e1602826287 [2021-03-25 04:41:44,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:41:44,069 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:41:44,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:41:44,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:41:44,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:41:44,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:41:44" (1/1) ... [2021-03-25 04:41:44,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6177cd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44, skipping insertion in model container [2021-03-25 04:41:44,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:41:44" (1/1) ... [2021-03-25 04:41:44,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:41:44,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:41:44,256 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/mix032_tso.opt.i[948,961] [2021-03-25 04:41:44,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:41:44,424 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:41:44,433 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/mix032_tso.opt.i[948,961] [2021-03-25 04:41:44,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:41:44,575 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:41:44,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44 WrapperNode [2021-03-25 04:41:44,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:41:44,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:41:44,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:41:44,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:41:44,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44" (1/1) ... [2021-03-25 04:41:44,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44" (1/1) ... [2021-03-25 04:41:44,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:41:44,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:41:44,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:41:44,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:41:44,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44" (1/1) ... [2021-03-25 04:41:44,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44" (1/1) ... [2021-03-25 04:41:44,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44" (1/1) ... [2021-03-25 04:41:44,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44" (1/1) ... [2021-03-25 04:41:44,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44" (1/1) ... [2021-03-25 04:41:44,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44" (1/1) ... [2021-03-25 04:41:44,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44" (1/1) ... [2021-03-25 04:41:44,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:41:44,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:41:44,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:41:44,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:41:44,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:41:44,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:41:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:41:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:41:44,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:41:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:41:44,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:41:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:41:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:41:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:41:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:41:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:41:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:41:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:41:44,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:41:44,797 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:41:46,316 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:41:46,317 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:41:46,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:41:46 BoogieIcfgContainer [2021-03-25 04:41:46,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:41:46,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:41:46,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:41:46,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:41:46,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:41:44" (1/3) ... [2021-03-25 04:41:46,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da9590e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:41:46, skipping insertion in model container [2021-03-25 04:41:46,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:41:44" (2/3) ... [2021-03-25 04:41:46,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da9590e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:41:46, skipping insertion in model container [2021-03-25 04:41:46,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:41:46" (3/3) ... [2021-03-25 04:41:46,326 INFO L111 eAbstractionObserver]: Analyzing ICFG mix032_tso.opt.i [2021-03-25 04:41:46,332 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:41:46,336 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:41:46,337 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:41:46,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,388 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,391 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,391 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,391 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,392 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,392 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,392 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,392 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,393 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,401 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,403 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,404 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,404 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,406 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,407 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:41:46,434 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:41:46,451 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 04:41:46,469 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:41:46,469 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:41:46,469 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:41:46,469 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:41:46,469 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:41:46,470 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:41:46,470 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:41:46,470 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:41:46,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-03-25 04:41:46,512 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-03-25 04:41:46,512 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:46,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-25 04:41:46,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2021-03-25 04:41:46,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2021-03-25 04:41:46,521 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:46,529 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2021-03-25 04:41:46,531 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2021-03-25 04:41:46,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2021-03-25 04:41:46,549 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-03-25 04:41:46,549 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:46,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-25 04:41:46,553 INFO L142 LiptonReduction]: Number of co-enabled transitions 1832 [2021-03-25 04:41:47,696 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:41:47,803 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-03-25 04:41:48,153 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:41:48,266 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:41:49,150 INFO L154 LiptonReduction]: Checked pairs total: 2848 [2021-03-25 04:41:49,150 INFO L156 LiptonReduction]: Total number of compositions: 71 [2021-03-25 04:41:49,152 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2632 [2021-03-25 04:41:49,167 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-25 04:41:49,168 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:49,168 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:49,168 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:49,169 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:41:49,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:49,175 INFO L82 PathProgramCache]: Analyzing trace with hash -81098595, now seen corresponding path program 1 times [2021-03-25 04:41:49,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:49,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241104097] [2021-03-25 04:41:49,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:49,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:49,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:49,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:49,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:41:49,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241104097] [2021-03-25 04:41:49,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:49,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:41:49,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71087142] [2021-03-25 04:41:49,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:41:49,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:49,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:41:49,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:41:49,482 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 176 [2021-03-25 04:41:49,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:49,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:49,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 176 [2021-03-25 04:41:49,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:49,526 INFO L129 PetriNetUnfolder]: 9/78 cut-off events. [2021-03-25 04:41:49,527 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:49,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 78 events. 9/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 213 event pairs, 3 based on Foata normal form. 6/76 useless extension candidates. Maximal degree in co-relation 88. Up to 17 conditions per place. [2021-03-25 04:41:49,529 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 5 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2021-03-25 04:41:49,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 103 flow [2021-03-25 04:41:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:41:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:41:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2021-03-25 04:41:49,546 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9109848484848485 [2021-03-25 04:41:49,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2021-03-25 04:41:49,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2021-03-25 04:41:49,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:49,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2021-03-25 04:41:49,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:49,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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 04:41:49,565 INFO L81 ComplementDD]: Finished complementDD. Result 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 04:41:49,567 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 3 states and 481 transitions. [2021-03-25 04:41:49,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 103 flow [2021-03-25 04:41:49,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 04:41:49,571 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 86 flow [2021-03-25 04:41:49,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-25 04:41:49,573 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-25 04:41:49,574 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:49,574 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-25 04:41:49,575 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-25 04:41:49,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 86 flow [2021-03-25 04:41:49,582 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-03-25 04:41:49,582 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:49,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:41:49,583 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-25 04:41:50,808 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 04:41:50,910 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 04:41:51,012 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 04:41:51,115 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-25 04:41:51,120 INFO L154 LiptonReduction]: Checked pairs total: 1698 [2021-03-25 04:41:51,120 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 04:41:51,120 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1546 [2021-03-25 04:41:51,121 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-25 04:41:51,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:51,121 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:51,122 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:51,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:41:51,122 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:41:51,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:51,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2060627892, now seen corresponding path program 1 times [2021-03-25 04:41:51,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:51,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649976436] [2021-03-25 04:41:51,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:51,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:51,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:51,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:51,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:51,230 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:41:51,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:41:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:41:51,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649976436] [2021-03-25 04:41:51,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:51,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:41:51,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538111538] [2021-03-25 04:41:51,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:41:51,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:51,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:41:51,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:41:51,238 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 190 [2021-03-25 04:41:51,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:51,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:51,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 190 [2021-03-25 04:41:51,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:51,263 INFO L129 PetriNetUnfolder]: 1/26 cut-off events. [2021-03-25 04:41:51,263 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:51,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2021-03-25 04:41:51,263 INFO L132 encePairwiseOnDemand]: 186/190 looper letters, 1 selfloop transitions, 2 changer transitions 4/26 dead transitions. [2021-03-25 04:41:51,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 74 flow [2021-03-25 04:41:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:41:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:41:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 812 transitions. [2021-03-25 04:41:51,280 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8547368421052631 [2021-03-25 04:41:51,280 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 812 transitions. [2021-03-25 04:41:51,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 812 transitions. [2021-03-25 04:41:51,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:51,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 812 transitions. [2021-03-25 04:41:51,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.4) internal successors, (812), 5 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 04:41:51,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:51,286 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:51,286 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 812 transitions. [2021-03-25 04:41:51,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 74 flow [2021-03-25 04:41:51,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:41:51,287 INFO L241 Difference]: Finished difference. Result has 36 places, 22 transitions, 58 flow [2021-03-25 04:41:51,287 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2021-03-25 04:41:51,288 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -14 predicate places. [2021-03-25 04:41:51,288 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:51,288 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 22 transitions, 58 flow [2021-03-25 04:41:51,288 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 22 transitions, 58 flow [2021-03-25 04:41:51,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 58 flow [2021-03-25 04:41:51,292 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 04:41:51,292 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:41:51,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:41:51,292 INFO L142 LiptonReduction]: Number of co-enabled transitions 202 [2021-03-25 04:41:51,812 WARN L205 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:41:52,006 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:41:52,401 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:41:52,562 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:41:52,565 INFO L154 LiptonReduction]: Checked pairs total: 461 [2021-03-25 04:41:52,565 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:41:52,565 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1277 [2021-03-25 04:41:52,566 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-03-25 04:41:52,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,566 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:52,566 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:52,567 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:41:52,567 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:41:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1679272019, now seen corresponding path program 1 times [2021-03-25 04:41:52,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:52,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212944711] [2021-03-25 04:41:52,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:52,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:52,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:52,615 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:41:52,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:41:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:41:52,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212944711] [2021-03-25 04:41:52,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:52,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:41:52,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824006576] [2021-03-25 04:41:52,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:41:52,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:52,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:41:52,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:41:52,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 192 [2021-03-25 04:41:52,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:52,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 192 [2021-03-25 04:41:52,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:52,655 INFO L129 PetriNetUnfolder]: 28/75 cut-off events. [2021-03-25 04:41:52,656 INFO L130 PetriNetUnfolder]: For 18/23 co-relation queries the response was YES. [2021-03-25 04:41:52,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 75 events. 28/75 cut-off events. For 18/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 246 event pairs, 6 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 150. Up to 47 conditions per place. [2021-03-25 04:41:52,657 INFO L132 encePairwiseOnDemand]: 189/192 looper letters, 8 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-25 04:41:52,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 23 transitions, 83 flow [2021-03-25 04:41:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:41:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:41:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2021-03-25 04:41:52,659 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8107638888888888 [2021-03-25 04:41:52,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2021-03-25 04:41:52,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2021-03-25 04:41:52,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:52,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2021-03-25 04:41:52,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,662 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 467 transitions. [2021-03-25 04:41:52,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 23 transitions, 83 flow [2021-03-25 04:41:52,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 23 transitions, 77 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:41:52,663 INFO L241 Difference]: Finished difference. Result has 31 places, 20 transitions, 58 flow [2021-03-25 04:41:52,663 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2021-03-25 04:41:52,663 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -19 predicate places. [2021-03-25 04:41:52,663 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:52,664 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 58 flow [2021-03-25 04:41:52,664 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 58 flow [2021-03-25 04:41:52,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 58 flow [2021-03-25 04:41:52,667 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 04:41:52,667 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:41:52,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 20 events. 0/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:41:52,668 INFO L142 LiptonReduction]: Number of co-enabled transitions 180 [2021-03-25 04:41:52,696 INFO L154 LiptonReduction]: Checked pairs total: 356 [2021-03-25 04:41:52,696 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:41:52,696 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-25 04:41:52,697 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 56 flow [2021-03-25 04:41:52,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,697 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:52,697 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:52,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:41:52,697 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:41:52,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2021708328, now seen corresponding path program 1 times [2021-03-25 04:41:52,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:52,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051661136] [2021-03-25 04:41:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:52,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:52,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:52,743 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:41:52,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:41:52,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:52,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:41:52,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051661136] [2021-03-25 04:41:52,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:52,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:41:52,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185146105] [2021-03-25 04:41:52,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:41:52,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:52,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:41:52,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:41:52,753 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 193 [2021-03-25 04:41:52,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,754 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:52,754 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 193 [2021-03-25 04:41:52,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:52,791 INFO L129 PetriNetUnfolder]: 28/77 cut-off events. [2021-03-25 04:41:52,791 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-25 04:41:52,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 77 events. 28/77 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 266 event pairs, 12 based on Foata normal form. 8/84 useless extension candidates. Maximal degree in co-relation 153. Up to 45 conditions per place. [2021-03-25 04:41:52,792 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 5 selfloop transitions, 4 changer transitions 7/29 dead transitions. [2021-03-25 04:41:52,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 108 flow [2021-03-25 04:41:52,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:41:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:41:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 823 transitions. [2021-03-25 04:41:52,795 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8528497409326425 [2021-03-25 04:41:52,795 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 823 transitions. [2021-03-25 04:41:52,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 823 transitions. [2021-03-25 04:41:52,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:52,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 823 transitions. [2021-03-25 04:41:52,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,800 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,800 INFO L185 Difference]: Start difference. First operand has 30 places, 19 transitions, 56 flow. Second operand 5 states and 823 transitions. [2021-03-25 04:41:52,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 108 flow [2021-03-25 04:41:52,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:41:52,802 INFO L241 Difference]: Finished difference. Result has 35 places, 22 transitions, 88 flow [2021-03-25 04:41:52,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2021-03-25 04:41:52,802 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -15 predicate places. [2021-03-25 04:41:52,802 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:52,802 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 88 flow [2021-03-25 04:41:52,802 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 88 flow [2021-03-25 04:41:52,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 88 flow [2021-03-25 04:41:52,809 INFO L129 PetriNetUnfolder]: 23/61 cut-off events. [2021-03-25 04:41:52,810 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-03-25 04:41:52,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 61 events. 23/61 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 181 event pairs, 11 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 154. Up to 38 conditions per place. [2021-03-25 04:41:52,811 INFO L142 LiptonReduction]: Number of co-enabled transitions 176 [2021-03-25 04:41:52,812 INFO L154 LiptonReduction]: Checked pairs total: 134 [2021-03-25 04:41:52,812 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:41:52,812 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 04:41:52,813 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 88 flow [2021-03-25 04:41:52,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,814 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:52,814 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:52,814 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:41:52,814 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:41:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:52,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1436649350, now seen corresponding path program 1 times [2021-03-25 04:41:52,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:52,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453121405] [2021-03-25 04:41:52,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:52,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:52,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:52,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:52,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:52,955 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:41:52,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:41:52,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:52,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:41:52,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453121405] [2021-03-25 04:41:52,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:52,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:41:52,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891001042] [2021-03-25 04:41:52,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:41:52,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:52,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:41:52,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:41:52,966 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 193 [2021-03-25 04:41:52,967 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:52,967 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:52,967 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 193 [2021-03-25 04:41:52,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:53,023 INFO L129 PetriNetUnfolder]: 16/55 cut-off events. [2021-03-25 04:41:53,023 INFO L130 PetriNetUnfolder]: For 43/52 co-relation queries the response was YES. [2021-03-25 04:41:53,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 55 events. 16/55 cut-off events. For 43/52 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 149 event pairs, 2 based on Foata normal form. 12/66 useless extension candidates. Maximal degree in co-relation 174. Up to 35 conditions per place. [2021-03-25 04:41:53,024 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 5 selfloop transitions, 7 changer transitions 7/32 dead transitions. [2021-03-25 04:41:53,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 184 flow [2021-03-25 04:41:53,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:41:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:41:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 987 transitions. [2021-03-25 04:41:53,028 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8523316062176166 [2021-03-25 04:41:53,028 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 987 transitions. [2021-03-25 04:41:53,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 987 transitions. [2021-03-25 04:41:53,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:53,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 987 transitions. [2021-03-25 04:41:53,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,036 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,037 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 88 flow. Second operand 6 states and 987 transitions. [2021-03-25 04:41:53,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 184 flow [2021-03-25 04:41:53,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 178 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:41:53,041 INFO L241 Difference]: Finished difference. Result has 39 places, 25 transitions, 138 flow [2021-03-25 04:41:53,041 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2021-03-25 04:41:53,041 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2021-03-25 04:41:53,041 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:53,041 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 138 flow [2021-03-25 04:41:53,041 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 138 flow [2021-03-25 04:41:53,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 138 flow [2021-03-25 04:41:53,050 INFO L129 PetriNetUnfolder]: 11/43 cut-off events. [2021-03-25 04:41:53,050 INFO L130 PetriNetUnfolder]: For 61/67 co-relation queries the response was YES. [2021-03-25 04:41:53,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 43 events. 11/43 cut-off events. For 61/67 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 2 based on Foata normal form. 3/45 useless extension candidates. Maximal degree in co-relation 141. Up to 23 conditions per place. [2021-03-25 04:41:53,054 INFO L142 LiptonReduction]: Number of co-enabled transitions 176 [2021-03-25 04:41:53,056 INFO L154 LiptonReduction]: Checked pairs total: 145 [2021-03-25 04:41:53,056 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:41:53,056 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-25 04:41:53,060 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 138 flow [2021-03-25 04:41:53,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,061 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:53,061 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:53,061 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:41:53,061 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:41:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1427584613, now seen corresponding path program 1 times [2021-03-25 04:41:53,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:53,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667821446] [2021-03-25 04:41:53,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:53,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:53,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:53,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:53,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:53,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:53,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:53,112 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:41:53,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:41:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:41:53,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667821446] [2021-03-25 04:41:53,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:53,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:41:53,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165819365] [2021-03-25 04:41:53,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:41:53,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:53,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:41:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:41:53,126 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 193 [2021-03-25 04:41:53,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 148.2) internal successors, (741), 5 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:53,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 193 [2021-03-25 04:41:53,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:53,170 INFO L129 PetriNetUnfolder]: 46/144 cut-off events. [2021-03-25 04:41:53,170 INFO L130 PetriNetUnfolder]: For 216/226 co-relation queries the response was YES. [2021-03-25 04:41:53,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 144 events. 46/144 cut-off events. For 216/226 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 635 event pairs, 7 based on Foata normal form. 15/158 useless extension candidates. Maximal degree in co-relation 486. Up to 72 conditions per place. [2021-03-25 04:41:53,171 INFO L132 encePairwiseOnDemand]: 188/193 looper letters, 10 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2021-03-25 04:41:53,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 192 flow [2021-03-25 04:41:53,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:41:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:41:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 752 transitions. [2021-03-25 04:41:53,174 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7792746113989637 [2021-03-25 04:41:53,174 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 752 transitions. [2021-03-25 04:41:53,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 752 transitions. [2021-03-25 04:41:53,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:53,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 752 transitions. [2021-03-25 04:41:53,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,178 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,178 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 138 flow. Second operand 5 states and 752 transitions. [2021-03-25 04:41:53,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 192 flow [2021-03-25 04:41:53,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 162 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-25 04:41:53,181 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 141 flow [2021-03-25 04:41:53,182 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-25 04:41:53,182 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2021-03-25 04:41:53,182 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:53,182 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 141 flow [2021-03-25 04:41:53,182 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 141 flow [2021-03-25 04:41:53,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 141 flow [2021-03-25 04:41:53,191 INFO L129 PetriNetUnfolder]: 26/94 cut-off events. [2021-03-25 04:41:53,191 INFO L130 PetriNetUnfolder]: For 80/85 co-relation queries the response was YES. [2021-03-25 04:41:53,192 INFO L84 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 94 events. 26/94 cut-off events. For 80/85 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 353 event pairs, 4 based on Foata normal form. 4/96 useless extension candidates. Maximal degree in co-relation 254. Up to 46 conditions per place. [2021-03-25 04:41:53,192 INFO L142 LiptonReduction]: Number of co-enabled transitions 190 [2021-03-25 04:41:53,195 INFO L154 LiptonReduction]: Checked pairs total: 138 [2021-03-25 04:41:53,195 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:41:53,195 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-25 04:41:53,195 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 141 flow [2021-03-25 04:41:53,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.2) internal successors, (741), 5 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,196 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:53,196 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:53,196 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:41:53,196 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:41:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash 643705537, now seen corresponding path program 2 times [2021-03-25 04:41:53,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:53,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453027995] [2021-03-25 04:41:53,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:53,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:53,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:53,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:53,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:53,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:53,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:53,290 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:41:53,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:41:53,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:53,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:41:53,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453027995] [2021-03-25 04:41:53,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:53,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:41:53,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311432582] [2021-03-25 04:41:53,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:41:53,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:41:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:41:53,304 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 193 [2021-03-25 04:41:53,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:53,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 193 [2021-03-25 04:41:53,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:53,361 INFO L129 PetriNetUnfolder]: 17/70 cut-off events. [2021-03-25 04:41:53,361 INFO L130 PetriNetUnfolder]: For 70/96 co-relation queries the response was YES. [2021-03-25 04:41:53,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 70 events. 17/70 cut-off events. For 70/96 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 218 event pairs, 0 based on Foata normal form. 21/89 useless extension candidates. Maximal degree in co-relation 225. Up to 36 conditions per place. [2021-03-25 04:41:53,362 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 2 selfloop transitions, 10 changer transitions 6/33 dead transitions. [2021-03-25 04:41:53,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 203 flow [2021-03-25 04:41:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:41:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:41:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1145 transitions. [2021-03-25 04:41:53,365 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.847520355292376 [2021-03-25 04:41:53,365 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1145 transitions. [2021-03-25 04:41:53,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1145 transitions. [2021-03-25 04:41:53,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:53,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1145 transitions. [2021-03-25 04:41:53,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.57142857142858) internal successors, (1145), 7 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,371 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:53,371 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 141 flow. Second operand 7 states and 1145 transitions. [2021-03-25 04:41:53,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 203 flow [2021-03-25 04:41:53,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 181 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-03-25 04:41:53,374 INFO L241 Difference]: Finished difference. Result has 46 places, 27 transitions, 147 flow [2021-03-25 04:41:53,374 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=147, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2021-03-25 04:41:53,374 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2021-03-25 04:41:53,374 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:53,374 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 27 transitions, 147 flow [2021-03-25 04:41:53,375 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 27 transitions, 147 flow [2021-03-25 04:41:53,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 27 transitions, 147 flow [2021-03-25 04:41:53,380 INFO L129 PetriNetUnfolder]: 8/41 cut-off events. [2021-03-25 04:41:53,380 INFO L130 PetriNetUnfolder]: For 44/47 co-relation queries the response was YES. [2021-03-25 04:41:53,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 41 events. 8/41 cut-off events. For 44/47 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 86 event pairs, 0 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 114. Up to 15 conditions per place. [2021-03-25 04:41:53,381 INFO L142 LiptonReduction]: Number of co-enabled transitions 120 [2021-03-25 04:41:53,672 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:41:53,831 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:41:54,529 WARN L205 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 182 [2021-03-25 04:41:54,787 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:41:56,092 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 306 DAG size of output: 262 [2021-03-25 04:41:56,645 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 259 [2021-03-25 04:41:56,750 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-25 04:41:56,972 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-25 04:41:57,121 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-25 04:41:57,140 INFO L154 LiptonReduction]: Checked pairs total: 247 [2021-03-25 04:41:57,140 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:41:57,140 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3766 [2021-03-25 04:41:57,140 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 141 flow [2021-03-25 04:41:57,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:57,141 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:57,141 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:57,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:41:57,141 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:41:57,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:57,142 INFO L82 PathProgramCache]: Analyzing trace with hash 981739480, now seen corresponding path program 1 times [2021-03-25 04:41:57,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:57,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054523933] [2021-03-25 04:41:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:57,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:57,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:57,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:57,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:57,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:57,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:41:57,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054523933] [2021-03-25 04:41:57,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:57,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:41:57,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699887994] [2021-03-25 04:41:57,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:41:57,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:57,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:41:57,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:41:57,192 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 196 [2021-03-25 04:41:57,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:57,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:57,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 196 [2021-03-25 04:41:57,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:57,220 INFO L129 PetriNetUnfolder]: 13/53 cut-off events. [2021-03-25 04:41:57,220 INFO L130 PetriNetUnfolder]: For 110/123 co-relation queries the response was YES. [2021-03-25 04:41:57,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 53 events. 13/53 cut-off events. For 110/123 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 146 event pairs, 0 based on Foata normal form. 4/55 useless extension candidates. Maximal degree in co-relation 158. Up to 24 conditions per place. [2021-03-25 04:41:57,220 INFO L132 encePairwiseOnDemand]: 193/196 looper letters, 3 selfloop transitions, 1 changer transitions 3/25 dead transitions. [2021-03-25 04:41:57,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 25 transitions, 153 flow [2021-03-25 04:41:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:41:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:41:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 674 transitions. [2021-03-25 04:41:57,223 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8596938775510204 [2021-03-25 04:41:57,223 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 674 transitions. [2021-03-25 04:41:57,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 674 transitions. [2021-03-25 04:41:57,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:57,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 674 transitions. [2021-03-25 04:41:57,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:57,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:57,227 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:57,227 INFO L185 Difference]: Start difference. First operand has 40 places, 24 transitions, 141 flow. Second operand 4 states and 674 transitions. [2021-03-25 04:41:57,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 25 transitions, 153 flow [2021-03-25 04:41:57,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 119 flow, removed 10 selfloop flow, removed 7 redundant places. [2021-03-25 04:41:57,229 INFO L241 Difference]: Finished difference. Result has 38 places, 22 transitions, 105 flow [2021-03-25 04:41:57,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2021-03-25 04:41:57,229 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2021-03-25 04:41:57,229 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:57,229 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 22 transitions, 105 flow [2021-03-25 04:41:57,230 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 22 transitions, 105 flow [2021-03-25 04:41:57,230 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 22 transitions, 105 flow [2021-03-25 04:41:57,235 INFO L129 PetriNetUnfolder]: 7/36 cut-off events. [2021-03-25 04:41:57,235 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-03-25 04:41:57,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 36 events. 7/36 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 88. Up to 12 conditions per place. [2021-03-25 04:41:57,236 INFO L142 LiptonReduction]: Number of co-enabled transitions 48 [2021-03-25 04:41:57,261 INFO L154 LiptonReduction]: Checked pairs total: 75 [2021-03-25 04:41:57,262 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:41:57,262 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-25 04:41:57,262 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 103 flow [2021-03-25 04:41:57,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:57,263 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:41:57,263 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:41:57,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:41:57,264 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:41:57,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:41:57,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1378053017, now seen corresponding path program 1 times [2021-03-25 04:41:57,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:41:57,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87846347] [2021-03-25 04:41:57,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:41:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:41:57,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:57,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:41:57,362 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-03-25 04:41:57,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 04:41:57,378 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-25 04:41:57,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 04:41:57,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:41:57,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:41:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:41:57,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87846347] [2021-03-25 04:41:57,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:41:57,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:41:57,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11041725] [2021-03-25 04:41:57,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:41:57,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:41:57,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:41:57,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:41:57,402 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 197 [2021-03-25 04:41:57,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:57,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:41:57,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 197 [2021-03-25 04:41:57,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:41:57,447 INFO L129 PetriNetUnfolder]: 13/53 cut-off events. [2021-03-25 04:41:57,447 INFO L130 PetriNetUnfolder]: For 94/99 co-relation queries the response was YES. [2021-03-25 04:41:57,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 53 events. 13/53 cut-off events. For 94/99 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 172 event pairs, 0 based on Foata normal form. 5/56 useless extension candidates. Maximal degree in co-relation 144. Up to 20 conditions per place. [2021-03-25 04:41:57,448 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 3 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2021-03-25 04:41:57,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 23 transitions, 123 flow [2021-03-25 04:41:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:41:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:41:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2021-03-25 04:41:57,450 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7543147208121828 [2021-03-25 04:41:57,450 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2021-03-25 04:41:57,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2021-03-25 04:41:57,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:41:57,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2021-03-25 04:41:57,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:57,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:57,454 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:41:57,454 INFO L185 Difference]: Start difference. First operand has 36 places, 21 transitions, 103 flow. Second operand 5 states and 743 transitions. [2021-03-25 04:41:57,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 23 transitions, 123 flow [2021-03-25 04:41:57,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 23 transitions, 116 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-25 04:41:57,456 INFO L241 Difference]: Finished difference. Result has 38 places, 21 transitions, 106 flow [2021-03-25 04:41:57,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2021-03-25 04:41:57,456 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2021-03-25 04:41:57,456 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:41:57,456 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 21 transitions, 106 flow [2021-03-25 04:41:57,457 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 106 flow [2021-03-25 04:41:57,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 21 transitions, 106 flow [2021-03-25 04:41:57,461 INFO L129 PetriNetUnfolder]: 7/36 cut-off events. [2021-03-25 04:41:57,461 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-03-25 04:41:57,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 36 events. 7/36 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 97. Up to 12 conditions per place. [2021-03-25 04:41:57,462 INFO L142 LiptonReduction]: Number of co-enabled transitions 14 [2021-03-25 04:41:57,634 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-25 04:41:57,996 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-25 04:41:58,107 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:41:58,592 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:41:58,907 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:41:59,528 WARN L205 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:42:00,129 WARN L205 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:42:00,132 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-25 04:42:00,132 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:42:00,132 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2676 [2021-03-25 04:42:00,132 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 115 flow [2021-03-25 04:42:00,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:42:00,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:42:00,133 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:42:00,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:42:00,133 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:42:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:42:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1476704421, now seen corresponding path program 1 times [2021-03-25 04:42:00,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:42:00,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624425453] [2021-03-25 04:42:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:42:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:42:00,165 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:42:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:42:00,194 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:42:00,218 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:42:00,218 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:42:00,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:42:00,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:42:00 BasicIcfg [2021-03-25 04:42:00,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:42:00,284 INFO L168 Benchmark]: Toolchain (without parser) took 16214.09 ms. Allocated memory was 255.9 MB in the beginning and 511.7 MB in the end (delta: 255.9 MB). Free memory was 234.2 MB in the beginning and 200.6 MB in the end (delta: 33.7 MB). Peak memory consumption was 289.5 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:00,284 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:42:00,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.08 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 234.2 MB in the beginning and 314.4 MB in the end (delta: -80.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:00,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.05 ms. Allocated memory is still 354.4 MB. Free memory was 314.4 MB in the beginning and 311.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:00,285 INFO L168 Benchmark]: Boogie Preprocessor took 56.42 ms. Allocated memory is still 354.4 MB. Free memory was 311.6 MB in the beginning and 309.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:00,285 INFO L168 Benchmark]: RCFGBuilder took 1610.65 ms. Allocated memory is still 354.4 MB. Free memory was 309.5 MB in the beginning and 261.6 MB in the end (delta: 47.9 MB). Peak memory consumption was 50.7 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:00,285 INFO L168 Benchmark]: TraceAbstraction took 13962.49 ms. Allocated memory was 354.4 MB in the beginning and 511.7 MB in the end (delta: 157.3 MB). Free memory was 261.6 MB in the beginning and 200.6 MB in the end (delta: 61.0 MB). Peak memory consumption was 219.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:42:00,286 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.19 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 507.08 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 234.2 MB in the beginning and 314.4 MB in the end (delta: -80.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 72.05 ms. Allocated memory is still 354.4 MB. Free memory was 314.4 MB in the beginning and 311.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.42 ms. Allocated memory is still 354.4 MB. Free memory was 311.6 MB in the beginning and 309.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1610.65 ms. Allocated memory is still 354.4 MB. Free memory was 309.5 MB in the beginning and 261.6 MB in the end (delta: 47.9 MB). Peak memory consumption was 50.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13962.49 ms. Allocated memory was 354.4 MB in the beginning and 511.7 MB in the end (delta: 157.3 MB). Free memory was 261.6 MB in the beginning and 200.6 MB in the end (delta: 61.0 MB). Peak memory consumption was 219.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2618.8ms, 110 PlacesBefore, 50 PlacesAfterwards, 102 TransitionsBefore, 41 TransitionsAfterwards, 1832 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 71 TotalNumberOfCompositions, 2848 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1571, positive: 1496, positive conditional: 0, positive unconditional: 1496, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 900, positive: 880, positive conditional: 0, positive unconditional: 880, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 900, positive: 880, positive conditional: 0, positive unconditional: 880, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1571, positive: 616, positive conditional: 0, positive unconditional: 616, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 900, unknown conditional: 0, unknown unconditional: 900] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1545.0ms, 47 PlacesBefore, 33 PlacesAfterwards, 38 TransitionsBefore, 24 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 1698 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 506, positive: 391, positive conditional: 0, positive unconditional: 391, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 61, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 506, positive: 343, positive conditional: 0, positive unconditional: 343, negative: 102, negative conditional: 0, negative unconditional: 102, unknown: 61, unknown conditional: 0, unknown unconditional: 61] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1276.4ms, 36 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 20 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 461 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 173, positive: 136, positive conditional: 0, positive unconditional: 136, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 173, positive: 131, positive conditional: 0, positive unconditional: 131, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.0ms, 31 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 356 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 112, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 112, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.7ms, 35 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 134 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 35, positive conditional: 0, positive unconditional: 35, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 45, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.5ms, 39 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 145 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 45, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.7ms, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 138 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 32, positive conditional: 0, positive unconditional: 32, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3765.2ms, 46 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 24 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 247 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 120, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.9ms, 38 PlacesBefore, 36 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 75 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 47, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2675.4ms, 38 PlacesBefore, 35 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L845] 0 pthread_t t870; [L846] FCALL, FORK 0 pthread_create(&t870, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t871; [L848] FCALL, FORK 0 pthread_create(&t871, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t872; [L850] FCALL, FORK 0 pthread_create(&t872, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z$w_buff1 = z$w_buff0 [L803] 3 z$w_buff0 = 1 [L804] 3 z$w_buff1_used = z$w_buff0_used [L805] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L807] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 3 z$r_buff0_thd3 = (_Bool)1 [L814] 3 a = 1 [L817] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 b = 1 [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L782] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L783] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L784] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L786] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L786] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L787] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13753.5ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 532.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2691.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 43 SDtfs, 25 SDslu, 21 SDs, 0 SdLazy, 139 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 140.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 153.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=7, InterpolantAutomatonStates: 43, 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: 38.7ms SsaConstructionTime, 309.4ms SatisfiabilityAnalysisTime, 576.1ms InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...