/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:46:07,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:46:07,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:46:07,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:46:07,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:46:07,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:46:07,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:46:07,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:46:07,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:46:07,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:46:07,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:46:07,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:46:07,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:46:07,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:46:07,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:46:07,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:46:07,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:46:07,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:46:07,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:46:07,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:46:07,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:46:07,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:46:07,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:46:07,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:46:08,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:46:08,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:46:08,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:46:08,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:46:08,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:46:08,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:46:08,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:46:08,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:46:08,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:46:08,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:46:08,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:46:08,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:46:08,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:46:08,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:46:08,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:46:08,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:46:08,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:46:08,013 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:46:08,048 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:46:08,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:46:08,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:46:08,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:46:08,052 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:46:08,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:46:08,053 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:46:08,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:46:08,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:46:08,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:46:08,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:46:08,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:46:08,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:46:08,054 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:46:08,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:46:08,055 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:46:08,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:46:08,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:46:08,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:46:08,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:46:08,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:46:08,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:46:08,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:46:08,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:46:08,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:46:08,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:46:08,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:46:08,056 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:46:08,056 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:46:08,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:46:08,057 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-26 10:46:08,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:46:08,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:46:08,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:46:08,393 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:46:08,394 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:46:08,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.opt.i [2021-03-26 10:46:08,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2064b4926/48ff2fa686fc4a83b8306eb7c0c11b1d/FLAGa2455e5da [2021-03-26 10:46:09,001 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:46:09,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_rmo.opt.i [2021-03-26 10:46:09,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2064b4926/48ff2fa686fc4a83b8306eb7c0c11b1d/FLAGa2455e5da [2021-03-26 10:46:09,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2064b4926/48ff2fa686fc4a83b8306eb7c0c11b1d [2021-03-26 10:46:09,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:46:09,338 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:46:09,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:46:09,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:46:09,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:46:09,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:46:09" (1/1) ... [2021-03-26 10:46:09,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7ea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09, skipping insertion in model container [2021-03-26 10:46:09,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:46:09" (1/1) ... [2021-03-26 10:46:09,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:46:09,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:46:09,521 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/thin002_rmo.opt.i[992,1005] [2021-03-26 10:46:09,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:46:09,708 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:46:09,718 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/thin002_rmo.opt.i[992,1005] [2021-03-26 10:46:09,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:46:09,864 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:46:09,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09 WrapperNode [2021-03-26 10:46:09,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:46:09,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:46:09,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:46:09,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:46:09,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09" (1/1) ... [2021-03-26 10:46:09,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09" (1/1) ... [2021-03-26 10:46:09,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:46:09,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:46:09,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:46:09,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:46:09,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09" (1/1) ... [2021-03-26 10:46:09,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09" (1/1) ... [2021-03-26 10:46:09,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09" (1/1) ... [2021-03-26 10:46:09,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09" (1/1) ... [2021-03-26 10:46:09,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09" (1/1) ... [2021-03-26 10:46:09,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09" (1/1) ... [2021-03-26 10:46:09,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09" (1/1) ... [2021-03-26 10:46:09,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:46:09,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:46:09,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:46:09,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:46:09,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09" (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-26 10:46:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 10:46:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:46:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:46:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:46:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:46:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:46:10,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:46:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:46:10,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:46:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:46:10,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:46:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:46:10,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:46:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:46:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:46:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:46:10,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:46:10,043 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:46:11,649 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:46:11,649 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-26 10:46:11,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:46:11 BoogieIcfgContainer [2021-03-26 10:46:11,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:46:11,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:46:11,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:46:11,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:46:11,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:46:09" (1/3) ... [2021-03-26 10:46:11,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce00fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:46:11, skipping insertion in model container [2021-03-26 10:46:11,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:46:09" (2/3) ... [2021-03-26 10:46:11,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce00fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:46:11, skipping insertion in model container [2021-03-26 10:46:11,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:46:11" (3/3) ... [2021-03-26 10:46:11,658 INFO L111 eAbstractionObserver]: Analyzing ICFG thin002_rmo.opt.i [2021-03-26 10:46:11,664 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:46:11,668 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 10:46:11,668 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:46:11,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,715 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,715 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,715 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,715 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,731 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,731 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,732 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,732 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,733 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,733 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,733 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,733 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,738 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,739 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,741 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,741 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,743 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,743 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,747 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,747 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:46:11,748 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:46:11,764 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 10:46:11,781 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:46:11,782 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:46:11,782 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:46:11,782 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:46:11,782 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:46:11,782 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:46:11,782 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:46:11,782 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:46:11,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2021-03-26 10:46:11,832 INFO L129 PetriNetUnfolder]: 2/129 cut-off events. [2021-03-26 10:46:11,833 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:46:11,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2021-03-26 10:46:11,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2021-03-26 10:46:11,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 115 transitions, 242 flow [2021-03-26 10:46:11,842 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:11,853 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 115 transitions, 242 flow [2021-03-26 10:46:11,855 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 115 transitions, 242 flow [2021-03-26 10:46:11,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 115 transitions, 242 flow [2021-03-26 10:46:11,876 INFO L129 PetriNetUnfolder]: 1/115 cut-off events. [2021-03-26 10:46:11,876 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:46:11,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 1/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2021-03-26 10:46:11,879 INFO L142 LiptonReduction]: Number of co-enabled transitions 1506 [2021-03-26 10:46:13,569 WARN L205 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2021-03-26 10:46:13,902 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-03-26 10:46:15,296 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-03-26 10:46:15,895 WARN L205 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-03-26 10:46:16,153 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-26 10:46:16,613 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-26 10:46:16,734 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 10:46:19,780 INFO L154 LiptonReduction]: Checked pairs total: 2448 [2021-03-26 10:46:19,780 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-26 10:46:19,782 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7941 [2021-03-26 10:46:19,794 INFO L129 PetriNetUnfolder]: 1/43 cut-off events. [2021-03-26 10:46:19,794 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:46:19,794 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:19,795 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:19,795 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:19,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:19,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1242854848, now seen corresponding path program 1 times [2021-03-26 10:46:19,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:19,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574692173] [2021-03-26 10:46:19,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:46:20,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:20,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:46:20,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:20,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:20,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:20,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:20,165 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-26 10:46:20,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574692173] [2021-03-26 10:46:20,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:46:20,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:46:20,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896239723] [2021-03-26 10:46:20,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:46:20,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:46:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:46:20,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:46:20,190 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 207 [2021-03-26 10:46:20,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 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-26 10:46:20,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:46:20,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 207 [2021-03-26 10:46:20,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:46:20,229 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-26 10:46:20,229 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:46:20,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 4/49 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:46:20,231 INFO L132 encePairwiseOnDemand]: 202/207 looper letters, 2 selfloop transitions, 2 changer transitions 3/44 dead transitions. [2021-03-26 10:46:20,231 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 112 flow [2021-03-26 10:46:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:46:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:46:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 960 transitions. [2021-03-26 10:46:20,249 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.927536231884058 [2021-03-26 10:46:20,250 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 960 transitions. [2021-03-26 10:46:20,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 960 transitions. [2021-03-26 10:46:20,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:46:20,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 960 transitions. [2021-03-26 10:46:20,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 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-26 10:46:20,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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-26 10:46:20,273 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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-26 10:46:20,275 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 5 states and 960 transitions. [2021-03-26 10:46:20,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 112 flow [2021-03-26 10:46:20,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:46:20,280 INFO L241 Difference]: Finished difference. Result has 58 places, 41 transitions, 102 flow [2021-03-26 10:46:20,281 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2021-03-26 10:46:20,282 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2021-03-26 10:46:20,282 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:20,282 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 41 transitions, 102 flow [2021-03-26 10:46:20,284 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 41 transitions, 102 flow [2021-03-26 10:46:20,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 41 transitions, 102 flow [2021-03-26 10:46:20,298 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-26 10:46:20,298 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 10:46:20,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 41 events. 0/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:46:20,300 INFO L142 LiptonReduction]: Number of co-enabled transitions 298 [2021-03-26 10:46:23,262 WARN L205 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 10:46:23,453 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 10:46:23,767 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 10:46:23,912 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 10:46:23,916 INFO L154 LiptonReduction]: Checked pairs total: 1531 [2021-03-26 10:46:23,916 INFO L156 LiptonReduction]: Total number of compositions: 16 [2021-03-26 10:46:23,917 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3635 [2021-03-26 10:46:23,917 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 70 flow [2021-03-26 10:46:23,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 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-26 10:46:23,918 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:23,918 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:23,918 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:46:23,918 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:23,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:23,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1423867321, now seen corresponding path program 1 times [2021-03-26 10:46:23,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:23,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13977248] [2021-03-26 10:46:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:46:24,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:24,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:46:24,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:24,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:24,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:24,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:24,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:24,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:24,050 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-26 10:46:24,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13977248] [2021-03-26 10:46:24,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:46:24,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:46:24,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517888378] [2021-03-26 10:46:24,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:46:24,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:46:24,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:46:24,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:46:24,054 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 223 [2021-03-26 10:46:24,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:46:24,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:46:24,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 223 [2021-03-26 10:46:24,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:46:24,086 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 10:46:24,086 INFO L130 PetriNetUnfolder]: For 26/33 co-relation queries the response was YES. [2021-03-26 10:46:24,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 30 events. 0/30 cut-off events. For 26/33 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:46:24,086 INFO L132 encePairwiseOnDemand]: 218/223 looper letters, 1 selfloop transitions, 4 changer transitions 1/26 dead transitions. [2021-03-26 10:46:24,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 26 transitions, 87 flow [2021-03-26 10:46:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:46:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:46:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 776 transitions. [2021-03-26 10:46:24,089 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8699551569506726 [2021-03-26 10:46:24,089 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 776 transitions. [2021-03-26 10:46:24,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 776 transitions. [2021-03-26 10:46:24,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:46:24,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 776 transitions. [2021-03-26 10:46:24,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:46:24,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 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-26 10:46:24,096 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 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-26 10:46:24,097 INFO L185 Difference]: Start difference. First operand has 39 places, 25 transitions, 70 flow. Second operand 4 states and 776 transitions. [2021-03-26 10:46:24,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 26 transitions, 87 flow [2021-03-26 10:46:24,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 77 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 10:46:24,098 INFO L241 Difference]: Finished difference. Result has 40 places, 25 transitions, 80 flow [2021-03-26 10:46:24,098 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2021-03-26 10:46:24,098 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -16 predicate places. [2021-03-26 10:46:24,099 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:24,099 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 25 transitions, 80 flow [2021-03-26 10:46:24,099 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 25 transitions, 80 flow [2021-03-26 10:46:24,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 25 transitions, 80 flow [2021-03-26 10:46:24,103 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-26 10:46:24,103 INFO L130 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2021-03-26 10:46:24,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 25 events. 0/25 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:46:24,108 INFO L142 LiptonReduction]: Number of co-enabled transitions 258 [2021-03-26 10:46:24,444 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-03-26 10:46:24,748 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-03-26 10:46:25,363 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2021-03-26 10:46:26,006 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2021-03-26 10:46:26,658 WARN L205 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 173 [2021-03-26 10:46:26,976 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2021-03-26 10:46:27,681 WARN L205 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 173 [2021-03-26 10:46:27,984 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2021-03-26 10:46:27,988 INFO L154 LiptonReduction]: Checked pairs total: 468 [2021-03-26 10:46:27,988 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:46:27,988 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3889 [2021-03-26 10:46:27,989 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 74 flow [2021-03-26 10:46:27,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:46:27,990 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:27,990 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:27,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:46:27,990 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash 996386327, now seen corresponding path program 1 times [2021-03-26 10:46:27,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:27,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906203994] [2021-03-26 10:46:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:46:28,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:28,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:28,058 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-26 10:46:28,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906203994] [2021-03-26 10:46:28,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:46:28,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:46:28,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627236356] [2021-03-26 10:46:28,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:46:28,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:46:28,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:46:28,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:46:28,061 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 225 [2021-03-26 10:46:28,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:46:28,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:46:28,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 225 [2021-03-26 10:46:28,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:46:28,074 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:46:28,074 INFO L130 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2021-03-26 10:46:28,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 23 events. 0/23 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:46:28,075 INFO L132 encePairwiseOnDemand]: 222/225 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-26 10:46:28,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 23 transitions, 80 flow [2021-03-26 10:46:28,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:46:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:46:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2021-03-26 10:46:28,081 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214814814814815 [2021-03-26 10:46:28,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2021-03-26 10:46:28,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2021-03-26 10:46:28,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:46:28,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2021-03-26 10:46:28,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 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-26 10:46:28,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-26 10:46:28,086 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 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-26 10:46:28,086 INFO L185 Difference]: Start difference. First operand has 38 places, 23 transitions, 74 flow. Second operand 3 states and 622 transitions. [2021-03-26 10:46:28,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 23 transitions, 80 flow [2021-03-26 10:46:28,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 23 transitions, 66 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-26 10:46:28,087 INFO L241 Difference]: Finished difference. Result has 37 places, 23 transitions, 68 flow [2021-03-26 10:46:28,088 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2021-03-26 10:46:28,088 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -19 predicate places. [2021-03-26 10:46:28,088 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:28,088 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 68 flow [2021-03-26 10:46:28,089 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 68 flow [2021-03-26 10:46:28,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 68 flow [2021-03-26 10:46:28,094 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:46:28,094 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:46:28,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:46:28,095 INFO L142 LiptonReduction]: Number of co-enabled transitions 226 [2021-03-26 10:46:28,123 INFO L154 LiptonReduction]: Checked pairs total: 208 [2021-03-26 10:46:28,123 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:46:28,123 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-26 10:46:28,124 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 68 flow [2021-03-26 10:46:28,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:46:28,125 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:28,125 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:28,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:46:28,125 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:28,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:28,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1260364429, now seen corresponding path program 1 times [2021-03-26 10:46:28,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:28,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644215863] [2021-03-26 10:46:28,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:46:28,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:28,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:28,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:28,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:28,230 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-26 10:46:28,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644215863] [2021-03-26 10:46:28,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:46:28,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:46:28,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403767436] [2021-03-26 10:46:28,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:46:28,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:46:28,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:46:28,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:46:28,233 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 225 [2021-03-26 10:46:28,234 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-26 10:46:28,234 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:46:28,234 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 225 [2021-03-26 10:46:28,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:46:28,262 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 10:46:28,263 INFO L130 PetriNetUnfolder]: For 11/18 co-relation queries the response was YES. [2021-03-26 10:46:28,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 28 events. 0/28 cut-off events. For 11/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 2/30 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:46:28,263 INFO L132 encePairwiseOnDemand]: 221/225 looper letters, 1 selfloop transitions, 3 changer transitions 1/24 dead transitions. [2021-03-26 10:46:28,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 24 transitions, 83 flow [2021-03-26 10:46:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:46:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:46:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 795 transitions. [2021-03-26 10:46:28,270 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2021-03-26 10:46:28,270 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 795 transitions. [2021-03-26 10:46:28,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 795 transitions. [2021-03-26 10:46:28,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:46:28,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 795 transitions. [2021-03-26 10:46:28,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 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-26 10:46:28,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 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-26 10:46:28,274 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 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-26 10:46:28,275 INFO L185 Difference]: Start difference. First operand has 37 places, 23 transitions, 68 flow. Second operand 4 states and 795 transitions. [2021-03-26 10:46:28,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 24 transitions, 83 flow [2021-03-26 10:46:28,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 24 transitions, 77 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:46:28,276 INFO L241 Difference]: Finished difference. Result has 40 places, 23 transitions, 78 flow [2021-03-26 10:46:28,276 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2021-03-26 10:46:28,276 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -16 predicate places. [2021-03-26 10:46:28,276 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:28,276 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 23 transitions, 78 flow [2021-03-26 10:46:28,276 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 23 transitions, 78 flow [2021-03-26 10:46:28,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 23 transitions, 78 flow [2021-03-26 10:46:28,283 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:46:28,283 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-26 10:46:28,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 23 events. 0/23 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:46:28,284 INFO L142 LiptonReduction]: Number of co-enabled transitions 206 [2021-03-26 10:46:28,312 INFO L154 LiptonReduction]: Checked pairs total: 339 [2021-03-26 10:46:28,312 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:46:28,312 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-03-26 10:46:28,316 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 76 flow [2021-03-26 10:46:28,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-26 10:46:28,317 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:28,317 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:28,317 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:46:28,317 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:28,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1054347089, now seen corresponding path program 1 times [2021-03-26 10:46:28,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:28,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306924917] [2021-03-26 10:46:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:46:28,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:28,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:28,413 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-26 10:46:28,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306924917] [2021-03-26 10:46:28,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:46:28,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:46:28,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761054822] [2021-03-26 10:46:28,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:46:28,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:46:28,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:46:28,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:46:28,415 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 226 [2021-03-26 10:46:28,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:46:28,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:46:28,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 226 [2021-03-26 10:46:28,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:46:28,427 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 10:46:28,427 INFO L130 PetriNetUnfolder]: For 25/27 co-relation queries the response was YES. [2021-03-26 10:46:28,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 22 events. 0/22 cut-off events. For 25/27 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:46:28,428 INFO L132 encePairwiseOnDemand]: 223/226 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-26 10:46:28,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 22 transitions, 82 flow [2021-03-26 10:46:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:46:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:46:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 625 transitions. [2021-03-26 10:46:28,430 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218289085545722 [2021-03-26 10:46:28,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 625 transitions. [2021-03-26 10:46:28,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 625 transitions. [2021-03-26 10:46:28,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:46:28,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 625 transitions. [2021-03-26 10:46:28,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 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-26 10:46:28,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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-26 10:46:28,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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-26 10:46:28,434 INFO L185 Difference]: Start difference. First operand has 39 places, 22 transitions, 76 flow. Second operand 3 states and 625 transitions. [2021-03-26 10:46:28,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 22 transitions, 82 flow [2021-03-26 10:46:28,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 22 transitions, 66 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-26 10:46:28,435 INFO L241 Difference]: Finished difference. Result has 37 places, 22 transitions, 68 flow [2021-03-26 10:46:28,436 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2021-03-26 10:46:28,436 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -19 predicate places. [2021-03-26 10:46:28,436 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:28,436 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 22 transitions, 68 flow [2021-03-26 10:46:28,436 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 22 transitions, 68 flow [2021-03-26 10:46:28,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 22 transitions, 68 flow [2021-03-26 10:46:28,441 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 10:46:28,441 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:46:28,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 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-26 10:46:28,442 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-26 10:46:30,878 INFO L154 LiptonReduction]: Checked pairs total: 149 [2021-03-26 10:46:30,879 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:46:30,879 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2443 [2021-03-26 10:46:30,879 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 68 flow [2021-03-26 10:46:30,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:46:30,880 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:30,880 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:30,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:46:30,880 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:30,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:30,881 INFO L82 PathProgramCache]: Analyzing trace with hash 594663043, now seen corresponding path program 1 times [2021-03-26 10:46:30,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:30,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744730981] [2021-03-26 10:46:30,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:46:30,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:30,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:30,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:30,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:30,953 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-26 10:46:30,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744730981] [2021-03-26 10:46:30,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:46:30,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:46:30,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008514249] [2021-03-26 10:46:30,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:46:30,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:46:30,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:46:30,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:46:30,958 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 226 [2021-03-26 10:46:30,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 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-26 10:46:30,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:46:30,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 226 [2021-03-26 10:46:30,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:46:30,981 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 10:46:30,981 INFO L130 PetriNetUnfolder]: For 11/13 co-relation queries the response was YES. [2021-03-26 10:46:30,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 28 events. 0/28 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 3/31 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:46:30,982 INFO L132 encePairwiseOnDemand]: 222/226 looper letters, 1 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2021-03-26 10:46:30,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 23 transitions, 83 flow [2021-03-26 10:46:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:46:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:46:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 799 transitions. [2021-03-26 10:46:30,984 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8838495575221239 [2021-03-26 10:46:30,984 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 799 transitions. [2021-03-26 10:46:30,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 799 transitions. [2021-03-26 10:46:30,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:46:30,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 799 transitions. [2021-03-26 10:46:30,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 199.75) internal successors, (799), 4 states have internal predecessors, (799), 0 states have call successors, (0), 0 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-26 10:46:30,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 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-26 10:46:30,989 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 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-26 10:46:30,990 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 68 flow. Second operand 4 states and 799 transitions. [2021-03-26 10:46:30,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 23 transitions, 83 flow [2021-03-26 10:46:30,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 23 transitions, 77 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:46:30,992 INFO L241 Difference]: Finished difference. Result has 40 places, 22 transitions, 78 flow [2021-03-26 10:46:30,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2021-03-26 10:46:30,992 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -16 predicate places. [2021-03-26 10:46:30,992 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:30,992 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 22 transitions, 78 flow [2021-03-26 10:46:30,993 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 22 transitions, 78 flow [2021-03-26 10:46:30,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 22 transitions, 78 flow [2021-03-26 10:46:30,996 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 10:46:30,997 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 10:46:30,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 22 events. 0/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 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-26 10:46:30,999 INFO L142 LiptonReduction]: Number of co-enabled transitions 148 [2021-03-26 10:46:31,031 INFO L154 LiptonReduction]: Checked pairs total: 215 [2021-03-26 10:46:31,032 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:46:31,032 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-26 10:46:31,037 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 21 transitions, 76 flow [2021-03-26 10:46:31,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 198.75) internal successors, (795), 4 states have internal predecessors, (795), 0 states have call successors, (0), 0 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-26 10:46:31,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:31,038 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:31,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:46:31,038 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:31,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:31,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1421551625, now seen corresponding path program 1 times [2021-03-26 10:46:31,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:31,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504369841] [2021-03-26 10:46:31,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:46:31,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:31,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:46:31,221 INFO L142 QuantifierPusher]: treesize reduction 35, result has 73.3 percent of original size [2021-03-26 10:46:31,230 INFO L147 QuantifierPusher]: treesize reduction 9, result has 90.6 percent of original size 87 [2021-03-26 10:46:31,286 INFO L142 QuantifierPusher]: treesize reduction 43, result has 69.1 percent of original size [2021-03-26 10:46:31,288 INFO L147 QuantifierPusher]: treesize reduction 9, result has 90.6 percent of original size 87 [2021-03-26 10:46:31,300 INFO L142 QuantifierPusher]: treesize reduction 58, result has 61.1 percent of original size [2021-03-26 10:46:31,302 INFO L147 QuantifierPusher]: treesize reduction 9, result has 90.1 percent of original size 82 [2021-03-26 10:46:31,348 INFO L142 QuantifierPusher]: treesize reduction 50, result has 67.5 percent of original size [2021-03-26 10:46:31,351 INFO L147 QuantifierPusher]: treesize reduction 9, result has 91.3 percent of original size 95 [2021-03-26 10:46:31,410 INFO L142 QuantifierPusher]: treesize reduction 15, result has 55.9 percent of original size [2021-03-26 10:46:31,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:46:31,422 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-26 10:46:31,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504369841] [2021-03-26 10:46:31,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:46:31,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:46:31,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541522918] [2021-03-26 10:46:31,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:46:31,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:46:31,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:46:31,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:46:31,425 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 227 [2021-03-26 10:46:31,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 21 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 151.0) internal successors, (1057), 7 states have internal predecessors, (1057), 0 states have call successors, (0), 0 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-26 10:46:31,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:46:31,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 227 [2021-03-26 10:46:31,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:46:31,581 INFO L129 PetriNetUnfolder]: 7/51 cut-off events. [2021-03-26 10:46:31,581 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-03-26 10:46:31,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 51 events. 7/51 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 112 event pairs, 1 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 109. Up to 10 conditions per place. [2021-03-26 10:46:31,582 INFO L132 encePairwiseOnDemand]: 223/227 looper letters, 11 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 10:46:31,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 26 transitions, 114 flow [2021-03-26 10:46:31,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:46:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:46:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2021-03-26 10:46:31,584 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6773127753303965 [2021-03-26 10:46:31,584 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 615 transitions. [2021-03-26 10:46:31,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions. [2021-03-26 10:46:31,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:46:31,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions. [2021-03-26 10:46:31,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:46:31,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 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-26 10:46:31,588 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 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-26 10:46:31,588 INFO L185 Difference]: Start difference. First operand has 39 places, 21 transitions, 76 flow. Second operand 4 states and 615 transitions. [2021-03-26 10:46:31,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 26 transitions, 114 flow [2021-03-26 10:46:31,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 98 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-26 10:46:31,589 INFO L241 Difference]: Finished difference. Result has 38 places, 21 transitions, 70 flow [2021-03-26 10:46:31,589 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2021-03-26 10:46:31,589 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -18 predicate places. [2021-03-26 10:46:31,590 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:31,590 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 21 transitions, 70 flow [2021-03-26 10:46:31,590 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 70 flow [2021-03-26 10:46:31,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 21 transitions, 70 flow [2021-03-26 10:46:31,594 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 10:46:31,594 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 10:46:31,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 21 events. 0/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:46:31,594 INFO L142 LiptonReduction]: Number of co-enabled transitions 134 [2021-03-26 10:46:31,752 INFO L154 LiptonReduction]: Checked pairs total: 179 [2021-03-26 10:46:31,752 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:46:31,752 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 162 [2021-03-26 10:46:31,753 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 68 flow [2021-03-26 10:46:31,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 151.0) internal successors, (1057), 7 states have internal predecessors, (1057), 0 states have call successors, (0), 0 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-26 10:46:31,753 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:31,753 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:31,754 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:46:31,754 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:31,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:31,754 INFO L82 PathProgramCache]: Analyzing trace with hash 688476031, now seen corresponding path program 1 times [2021-03-26 10:46:31,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:31,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616184904] [2021-03-26 10:46:31,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:46:31,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:31,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:31,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:31,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:31,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:31,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:46:31,805 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-26 10:46:31,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616184904] [2021-03-26 10:46:31,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:46:31,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:46:31,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800295527] [2021-03-26 10:46:31,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:46:31,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:46:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:46:31,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:46:31,807 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 228 [2021-03-26 10:46:31,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 20 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-26 10:46:31,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:46:31,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 228 [2021-03-26 10:46:31,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:46:31,853 INFO L129 PetriNetUnfolder]: 90/179 cut-off events. [2021-03-26 10:46:31,853 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-26 10:46:31,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 179 events. 90/179 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 734 event pairs, 46 based on Foata normal form. 16/177 useless extension candidates. Maximal degree in co-relation 371. Up to 119 conditions per place. [2021-03-26 10:46:31,854 INFO L132 encePairwiseOnDemand]: 221/228 looper letters, 6 selfloop transitions, 5 changer transitions 9/33 dead transitions. [2021-03-26 10:46:31,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 134 flow [2021-03-26 10:46:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:46:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:46:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1007 transitions. [2021-03-26 10:46:31,857 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2021-03-26 10:46:31,857 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1007 transitions. [2021-03-26 10:46:31,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1007 transitions. [2021-03-26 10:46:31,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:46:31,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1007 transitions. [2021-03-26 10:46:31,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 201.4) internal successors, (1007), 5 states have internal predecessors, (1007), 0 states have call successors, (0), 0 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-26 10:46:31,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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-26 10:46:31,862 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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-26 10:46:31,862 INFO L185 Difference]: Start difference. First operand has 37 places, 20 transitions, 68 flow. Second operand 5 states and 1007 transitions. [2021-03-26 10:46:31,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 134 flow [2021-03-26 10:46:31,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 124 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-26 10:46:31,863 INFO L241 Difference]: Finished difference. Result has 40 places, 24 transitions, 103 flow [2021-03-26 10:46:31,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2021-03-26 10:46:31,864 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -16 predicate places. [2021-03-26 10:46:31,864 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:31,864 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 24 transitions, 103 flow [2021-03-26 10:46:31,864 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 24 transitions, 103 flow [2021-03-26 10:46:31,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 24 transitions, 103 flow [2021-03-26 10:46:31,878 INFO L129 PetriNetUnfolder]: 73/146 cut-off events. [2021-03-26 10:46:31,878 INFO L130 PetriNetUnfolder]: For 87/165 co-relation queries the response was YES. [2021-03-26 10:46:31,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 146 events. 73/146 cut-off events. For 87/165 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 594 event pairs, 40 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 390. Up to 104 conditions per place. [2021-03-26 10:46:31,881 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 10:46:32,225 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-03-26 10:46:32,561 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-03-26 10:46:33,878 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 285 DAG size of output: 284 [2021-03-26 10:46:34,494 WARN L205 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 284 [2021-03-26 10:46:34,497 INFO L154 LiptonReduction]: Checked pairs total: 44 [2021-03-26 10:46:34,497 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:46:34,497 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2633 [2021-03-26 10:46:34,498 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 104 flow [2021-03-26 10:46:34,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-26 10:46:34,498 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:34,498 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:34,498 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:46:34,498 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:34,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:34,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2016840062, now seen corresponding path program 1 times [2021-03-26 10:46:34,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:34,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215036777] [2021-03-26 10:46:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:46:34,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:46:34,566 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-26 10:46:34,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215036777] [2021-03-26 10:46:34,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:46:34,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:46:34,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665182848] [2021-03-26 10:46:34,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:46:34,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:46:34,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:46:34,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:46:34,568 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 229 [2021-03-26 10:46:34,569 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 197.8) internal successors, (989), 5 states have internal predecessors, (989), 0 states have call successors, (0), 0 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-26 10:46:34,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:46:34,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 229 [2021-03-26 10:46:34,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:46:34,632 INFO L129 PetriNetUnfolder]: 66/146 cut-off events. [2021-03-26 10:46:34,632 INFO L130 PetriNetUnfolder]: For 135/326 co-relation queries the response was YES. [2021-03-26 10:46:34,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 146 events. 66/146 cut-off events. For 135/326 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 550 event pairs, 14 based on Foata normal form. 22/157 useless extension candidates. Maximal degree in co-relation 508. Up to 108 conditions per place. [2021-03-26 10:46:34,634 INFO L132 encePairwiseOnDemand]: 221/229 looper letters, 6 selfloop transitions, 9 changer transitions 9/37 dead transitions. [2021-03-26 10:46:34,634 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 228 flow [2021-03-26 10:46:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:46:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:46:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1208 transitions. [2021-03-26 10:46:34,637 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8791848617176128 [2021-03-26 10:46:34,637 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1208 transitions. [2021-03-26 10:46:34,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1208 transitions. [2021-03-26 10:46:34,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:46:34,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1208 transitions. [2021-03-26 10:46:34,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.33333333333334) internal successors, (1208), 6 states have internal predecessors, (1208), 0 states have call successors, (0), 0 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-26 10:46:34,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 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-26 10:46:34,643 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 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-26 10:46:34,643 INFO L185 Difference]: Start difference. First operand has 38 places, 24 transitions, 104 flow. Second operand 6 states and 1208 transitions. [2021-03-26 10:46:34,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 228 flow [2021-03-26 10:46:34,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 221 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:46:34,645 INFO L241 Difference]: Finished difference. Result has 44 places, 28 transitions, 169 flow [2021-03-26 10:46:34,645 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2021-03-26 10:46:34,645 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -12 predicate places. [2021-03-26 10:46:34,645 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:34,645 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 169 flow [2021-03-26 10:46:34,646 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 28 transitions, 169 flow [2021-03-26 10:46:34,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 169 flow [2021-03-26 10:46:34,657 INFO L129 PetriNetUnfolder]: 49/114 cut-off events. [2021-03-26 10:46:34,657 INFO L130 PetriNetUnfolder]: For 225/309 co-relation queries the response was YES. [2021-03-26 10:46:34,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 114 events. 49/114 cut-off events. For 225/309 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 408 event pairs, 13 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 440. Up to 76 conditions per place. [2021-03-26 10:46:34,659 INFO L142 LiptonReduction]: Number of co-enabled transitions 140 [2021-03-26 10:46:34,709 INFO L154 LiptonReduction]: Checked pairs total: 49 [2021-03-26 10:46:34,709 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:46:34,709 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 64 [2021-03-26 10:46:34,710 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 171 flow [2021-03-26 10:46:34,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 197.8) internal successors, (989), 5 states have internal predecessors, (989), 0 states have call successors, (0), 0 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-26 10:46:34,710 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:34,710 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:34,711 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:46:34,711 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:34,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:34,711 INFO L82 PathProgramCache]: Analyzing trace with hash 974572163, now seen corresponding path program 1 times [2021-03-26 10:46:34,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:34,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877262597] [2021-03-26 10:46:34,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:46:34,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:46:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:46:34,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877262597] [2021-03-26 10:46:34,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:46:34,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:46:34,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757201771] [2021-03-26 10:46:34,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:46:34,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:46:34,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:46:34,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:46:34,790 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 230 [2021-03-26 10:46:34,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 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-26 10:46:34,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:46:34,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 230 [2021-03-26 10:46:34,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:46:34,870 INFO L129 PetriNetUnfolder]: 36/97 cut-off events. [2021-03-26 10:46:34,870 INFO L130 PetriNetUnfolder]: For 277/415 co-relation queries the response was YES. [2021-03-26 10:46:34,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 97 events. 36/97 cut-off events. For 277/415 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 304 event pairs, 2 based on Foata normal form. 27/119 useless extension candidates. Maximal degree in co-relation 442. Up to 68 conditions per place. [2021-03-26 10:46:34,871 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 6 selfloop transitions, 13 changer transitions 9/41 dead transitions. [2021-03-26 10:46:34,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 353 flow [2021-03-26 10:46:34,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:46:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:46:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1409 transitions. [2021-03-26 10:46:34,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8751552795031056 [2021-03-26 10:46:34,875 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1409 transitions. [2021-03-26 10:46:34,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1409 transitions. [2021-03-26 10:46:34,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:46:34,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1409 transitions. [2021-03-26 10:46:34,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 201.28571428571428) internal successors, (1409), 7 states have internal predecessors, (1409), 0 states have call successors, (0), 0 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-26 10:46:34,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 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-26 10:46:34,882 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 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-26 10:46:34,883 INFO L185 Difference]: Start difference. First operand has 42 places, 28 transitions, 171 flow. Second operand 7 states and 1409 transitions. [2021-03-26 10:46:34,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 353 flow [2021-03-26 10:46:34,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 291 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 10:46:34,885 INFO L241 Difference]: Finished difference. Result has 47 places, 32 transitions, 221 flow [2021-03-26 10:46:34,885 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2021-03-26 10:46:34,886 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -9 predicate places. [2021-03-26 10:46:34,886 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:34,886 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 32 transitions, 221 flow [2021-03-26 10:46:34,886 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 32 transitions, 221 flow [2021-03-26 10:46:34,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 32 transitions, 221 flow [2021-03-26 10:46:34,894 INFO L129 PetriNetUnfolder]: 25/75 cut-off events. [2021-03-26 10:46:34,895 INFO L130 PetriNetUnfolder]: For 195/221 co-relation queries the response was YES. [2021-03-26 10:46:34,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 75 events. 25/75 cut-off events. For 195/221 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 211 event pairs, 2 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 281. Up to 42 conditions per place. [2021-03-26 10:46:34,896 INFO L142 LiptonReduction]: Number of co-enabled transitions 130 [2021-03-26 10:46:34,898 INFO L154 LiptonReduction]: Checked pairs total: 40 [2021-03-26 10:46:34,898 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:46:34,898 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-26 10:46:34,899 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 221 flow [2021-03-26 10:46:34,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 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-26 10:46:34,899 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:34,899 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:34,899 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:46:34,900 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:34,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:34,900 INFO L82 PathProgramCache]: Analyzing trace with hash 920881448, now seen corresponding path program 1 times [2021-03-26 10:46:34,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:34,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707954152] [2021-03-26 10:46:34,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:46:34,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:46:34,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:46:34,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:46:34,991 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-26 10:46:34,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707954152] [2021-03-26 10:46:34,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:46:34,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:46:34,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991995924] [2021-03-26 10:46:34,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:46:34,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:46:34,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:46:34,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:46:34,997 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 230 [2021-03-26 10:46:34,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 197.85714285714286) internal successors, (1385), 7 states have internal predecessors, (1385), 0 states have call successors, (0), 0 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-26 10:46:34,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:46:34,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 230 [2021-03-26 10:46:34,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:46:35,085 INFO L129 PetriNetUnfolder]: 20/63 cut-off events. [2021-03-26 10:46:35,085 INFO L130 PetriNetUnfolder]: For 243/304 co-relation queries the response was YES. [2021-03-26 10:46:35,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 63 events. 20/63 cut-off events. For 243/304 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 0 based on Foata normal form. 27/86 useless extension candidates. Maximal degree in co-relation 275. Up to 38 conditions per place. [2021-03-26 10:46:35,086 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 2 selfloop transitions, 17 changer transitions 5/37 dead transitions. [2021-03-26 10:46:35,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 37 transitions, 325 flow [2021-03-26 10:46:35,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:46:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:46:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1602 transitions. [2021-03-26 10:46:35,090 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8706521739130435 [2021-03-26 10:46:35,090 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1602 transitions. [2021-03-26 10:46:35,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1602 transitions. [2021-03-26 10:46:35,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:46:35,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1602 transitions. [2021-03-26 10:46:35,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 200.25) internal successors, (1602), 8 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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-26 10:46:35,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 230.0) internal successors, (2070), 9 states have internal predecessors, (2070), 0 states have call successors, (0), 0 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-26 10:46:35,098 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 230.0) internal successors, (2070), 9 states have internal predecessors, (2070), 0 states have call successors, (0), 0 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-26 10:46:35,098 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 221 flow. Second operand 8 states and 1602 transitions. [2021-03-26 10:46:35,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 37 transitions, 325 flow [2021-03-26 10:46:35,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 259 flow, removed 23 selfloop flow, removed 6 redundant places. [2021-03-26 10:46:35,101 INFO L241 Difference]: Finished difference. Result has 49 places, 32 transitions, 211 flow [2021-03-26 10:46:35,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=211, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2021-03-26 10:46:35,102 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -7 predicate places. [2021-03-26 10:46:35,102 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:46:35,102 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 32 transitions, 211 flow [2021-03-26 10:46:35,102 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 32 transitions, 211 flow [2021-03-26 10:46:35,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 32 transitions, 211 flow [2021-03-26 10:46:35,108 INFO L129 PetriNetUnfolder]: 17/55 cut-off events. [2021-03-26 10:46:35,108 INFO L130 PetriNetUnfolder]: For 104/114 co-relation queries the response was YES. [2021-03-26 10:46:35,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 55 events. 17/55 cut-off events. For 104/114 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 171. Up to 18 conditions per place. [2021-03-26 10:46:35,109 INFO L142 LiptonReduction]: Number of co-enabled transitions 112 [2021-03-26 10:46:35,409 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2021-03-26 10:46:35,863 WARN L205 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2021-03-26 10:46:35,996 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-03-26 10:46:36,127 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-03-26 10:46:36,255 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-03-26 10:46:36,490 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2021-03-26 10:46:36,742 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2021-03-26 10:46:37,045 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 10:46:37,185 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 10:46:37,330 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2021-03-26 10:46:37,473 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2021-03-26 10:46:37,764 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-26 10:46:38,049 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-26 10:46:38,053 INFO L154 LiptonReduction]: Checked pairs total: 14 [2021-03-26 10:46:38,053 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:46:38,053 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2951 [2021-03-26 10:46:38,053 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 206 flow [2021-03-26 10:46:38,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 197.85714285714286) internal successors, (1385), 7 states have internal predecessors, (1385), 0 states have call successors, (0), 0 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-26 10:46:38,054 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:38,054 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-26 10:46:38,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:46:38,054 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:38,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:38,055 INFO L82 PathProgramCache]: Analyzing trace with hash 39045991, now seen corresponding path program 1 times [2021-03-26 10:46:38,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:38,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363102697] [2021-03-26 10:46:38,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:46:38,098 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:46:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:46:38,145 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:46:38,189 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:46:38,190 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:46:38,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:46:38,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:46:38 BasicIcfg [2021-03-26 10:46:38,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:46:38,319 INFO L168 Benchmark]: Toolchain (without parser) took 28981.04 ms. Allocated memory was 255.9 MB in the beginning and 761.3 MB in the end (delta: 505.4 MB). Free memory was 233.4 MB in the beginning and 599.3 MB in the end (delta: -365.9 MB). Peak memory consumption was 137.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:38,319 INFO L168 Benchmark]: CDTParser took 0.48 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-26 10:46:38,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 526.68 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 232.9 MB in the beginning and 324.1 MB in the end (delta: -91.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:38,320 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.53 ms. Allocated memory is still 362.8 MB. Free memory was 324.1 MB in the beginning and 321.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:38,320 INFO L168 Benchmark]: Boogie Preprocessor took 26.60 ms. Allocated memory is still 362.8 MB. Free memory was 321.6 MB in the beginning and 319.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:38,321 INFO L168 Benchmark]: RCFGBuilder took 1689.14 ms. Allocated memory is still 362.8 MB. Free memory was 319.5 MB in the beginning and 212.8 MB in the end (delta: 106.7 MB). Peak memory consumption was 108.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:38,321 INFO L168 Benchmark]: TraceAbstraction took 26666.06 ms. Allocated memory was 362.8 MB in the beginning and 761.3 MB in the end (delta: 398.5 MB). Free memory was 211.8 MB in the beginning and 599.3 MB in the end (delta: -387.5 MB). Peak memory consumption was 11.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:38,327 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 526.68 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 232.9 MB in the beginning and 324.1 MB in the end (delta: -91.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 67.53 ms. Allocated memory is still 362.8 MB. Free memory was 324.1 MB in the beginning and 321.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.60 ms. Allocated memory is still 362.8 MB. Free memory was 321.6 MB in the beginning and 319.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1689.14 ms. Allocated memory is still 362.8 MB. Free memory was 319.5 MB in the beginning and 212.8 MB in the end (delta: 106.7 MB). Peak memory consumption was 108.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 26666.06 ms. Allocated memory was 362.8 MB in the beginning and 761.3 MB in the end (delta: 398.5 MB). Free memory was 211.8 MB in the beginning and 599.3 MB in the end (delta: -387.5 MB). Peak memory consumption was 11.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7925.1ms, 127 PlacesBefore, 56 PlacesAfterwards, 115 TransitionsBefore, 44 TransitionsAfterwards, 1506 CoEnabledTransitionPairs, 5 FixpointIterations, 45 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 74 TotalNumberOfCompositions, 2448 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1320, positive: 1249, positive conditional: 1249, positive unconditional: 0, negative: 71, negative conditional: 71, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1320, positive: 1249, positive conditional: 0, positive unconditional: 1249, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1320, positive: 1249, positive conditional: 0, positive unconditional: 1249, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1021, positive: 981, positive conditional: 0, positive unconditional: 981, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1021, positive: 970, positive conditional: 0, positive unconditional: 970, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1759, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 455, negative conditional: 0, negative unconditional: 455, unknown: 1258, unknown conditional: 0, unknown unconditional: 1258] ], Cache Queries: [ total: 1320, positive: 268, positive conditional: 0, positive unconditional: 268, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 1021, unknown conditional: 0, unknown unconditional: 1021] , Statistics on independence cache: Total cache size (in pairs): 1021, Positive cache size: 981, Positive conditional cache size: 0, Positive unconditional cache size: 981, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3632.7ms, 58 PlacesBefore, 39 PlacesAfterwards, 41 TransitionsBefore, 25 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 5 FixpointIterations, 15 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 1531 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 638, positive: 537, positive conditional: 537, positive unconditional: 0, negative: 101, negative conditional: 101, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 638, positive: 537, positive conditional: 0, positive unconditional: 537, negative: 101, negative conditional: 0, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 638, positive: 537, positive conditional: 0, positive unconditional: 537, negative: 101, negative conditional: 0, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 106, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 106, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 767, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 609, unknown conditional: 0, unknown unconditional: 609] ], Cache Queries: [ total: 638, positive: 444, positive conditional: 0, positive unconditional: 444, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 106, unknown conditional: 0, unknown unconditional: 106] , Statistics on independence cache: Total cache size (in pairs): 1127, Positive cache size: 1074, Positive conditional cache size: 0, Positive unconditional cache size: 1074, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3889.1ms, 40 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 468 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 189, positive: 155, positive conditional: 155, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 189, positive: 155, positive conditional: 0, positive unconditional: 155, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 189, positive: 155, positive conditional: 0, positive unconditional: 155, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 189, positive: 150, positive conditional: 0, positive unconditional: 150, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1132, Positive cache size: 1079, Positive conditional cache size: 0, Positive unconditional cache size: 1079, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.2ms, 37 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 208 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 85, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 85, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 85, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1136, Positive cache size: 1082, Positive conditional cache size: 0, Positive unconditional cache size: 1082, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.4ms, 40 PlacesBefore, 39 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 339 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188, positive: 160, positive conditional: 160, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, positive: 160, positive conditional: 0, positive unconditional: 160, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, positive: 160, positive conditional: 0, positive unconditional: 160, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, positive: 146, positive conditional: 0, positive unconditional: 146, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 1150, Positive cache size: 1096, Positive conditional cache size: 0, Positive unconditional cache size: 1096, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Eliminated conditions: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2442.2ms, 37 PlacesBefore, 37 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 149 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2435, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2435, unknown conditional: 0, unknown unconditional: 2435] ], Cache Queries: [ total: 77, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1156, Positive cache size: 1100, Positive conditional cache size: 0, Positive unconditional cache size: 1100, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.2ms, 40 PlacesBefore, 39 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 215 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1160, Positive cache size: 1104, Positive conditional cache size: 0, Positive unconditional cache size: 1104, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 162.2ms, 38 PlacesBefore, 37 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 179 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, positive: 100, positive conditional: 100, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, positive: 100, positive conditional: 11, positive unconditional: 89, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, positive: 100, positive conditional: 11, positive unconditional: 89, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 121, positive conditional: 121, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, positive: 92, positive conditional: 4, positive unconditional: 88, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1168, Positive cache size: 1112, Positive conditional cache size: 7, Positive unconditional cache size: 1105, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2633.0ms, 40 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 44 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, positive: 24, positive conditional: 15, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 24, positive conditional: 15, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 4, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 17, positive conditional: 11, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1175, Positive cache size: 1119, Positive conditional cache size: 11, Positive unconditional cache size: 1108, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63.4ms, 44 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 49 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, positive: 41, positive conditional: 24, positive unconditional: 17, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 41, positive conditional: 24, positive unconditional: 17, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, positive: 38, positive conditional: 21, positive unconditional: 17, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1178, Positive cache size: 1122, Positive conditional cache size: 14, Positive unconditional cache size: 1108, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.9ms, 47 PlacesBefore, 45 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 40 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, positive: 24, positive conditional: 20, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 24, positive conditional: 20, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 24, positive conditional: 20, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1178, Positive cache size: 1122, Positive conditional cache size: 14, Positive unconditional cache size: 1108, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2950.5ms, 49 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 29 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 14 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1192, Positive cache size: 1136, Positive conditional cache size: 28, Positive unconditional cache size: 1108, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Eliminated conditions: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2725; [L861] FCALL, FORK 0 pthread_create(&t2725, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={8:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L777] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0) [L777] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L778] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1) [L778] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L779] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used) [L779] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L780] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 1 weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L781] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1) [L781] EXPR 1 weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] EXPR 1 weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L782] EXPR 1 weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] EXPR 1 \read(a) [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 [L790] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={8:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L862] 0 pthread_t t2726; [L863] FCALL, FORK 0 pthread_create(&t2726, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={8:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 2 __unbuffered_p1_EAX = x [L805] 2 y = 1 [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L864] 0 pthread_t t2727; [L865] FCALL, FORK 0 pthread_create(&t2727, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={8:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L817] 3 __unbuffered_p2_EAX = y [L820] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={8:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L866] 0 pthread_t t2728; [L867] FCALL, FORK 0 pthread_create(&t2728, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={8:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z [L835] 4 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={8:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={8:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 26412.8ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 780.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8004.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 36 SDtfs, 22 SDslu, 26 SDs, 0 SdLazy, 265 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 244.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 349.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=10, InterpolantAutomatonStates: 53, 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: 46.0ms SsaConstructionTime, 475.6ms SatisfiabilityAnalysisTime, 903.6ms InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...