/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/mix033_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:43:59,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:43:59,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:43:59,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:43:59,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:43:59,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:43:59,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:43:59,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:43:59,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:43:59,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:43:59,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:43:59,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:43:59,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:43:59,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:43:59,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:43:59,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:43:59,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:43:59,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:43:59,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:43:59,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:43:59,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:43:59,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:43:59,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:43:59,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:43:59,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:43:59,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:43:59,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:43:59,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:43:59,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:43:59,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:43:59,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:43:59,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:43:59,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:43:59,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:43:59,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:43:59,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:43:59,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:43:59,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:43:59,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:43:59,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:43:59,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:43:59,168 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-06-11 15:43:59,199 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:43:59,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:43:59,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:43:59,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:43:59,202 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:43:59,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:43:59,203 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:43:59,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:43:59,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:43:59,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:43:59,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:43:59,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:43:59,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:43:59,204 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:43:59,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:43:59,204 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:43:59,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:43:59,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:43:59,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:43:59,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:43:59,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:43:59,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:43:59,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:43:59,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:43:59,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:43:59,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:43:59,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:43:59,206 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:43:59,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:43:59,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:43:59,206 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-06-11 15:43:59,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:43:59,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:43:59,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:43:59,503 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:43:59,504 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:43:59,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_power.opt.i [2021-06-11 15:43:59,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7a28752/c4d13a67eceb4d4899741a39dbe48ef3/FLAG6b67e1500 [2021-06-11 15:44:00,032 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:44:00,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.opt.i [2021-06-11 15:44:00,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7a28752/c4d13a67eceb4d4899741a39dbe48ef3/FLAG6b67e1500 [2021-06-11 15:44:00,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7a28752/c4d13a67eceb4d4899741a39dbe48ef3 [2021-06-11 15:44:00,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:44:00,088 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:44:00,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:44:00,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:44:00,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:44:00,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:44:00" (1/1) ... [2021-06-11 15:44:00,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70bd6ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00, skipping insertion in model container [2021-06-11 15:44:00,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:44:00" (1/1) ... [2021-06-11 15:44:00,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:44:00,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:44:00,341 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/mix033_power.opt.i[950,963] [2021-06-11 15:44:00,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:44:00,553 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:44:00,563 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/mix033_power.opt.i[950,963] [2021-06-11 15:44:00,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:44:00,679 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:44:00,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00 WrapperNode [2021-06-11 15:44:00,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:44:00,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:44:00,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:44:00,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:44:00,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00" (1/1) ... [2021-06-11 15:44:00,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00" (1/1) ... [2021-06-11 15:44:00,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:44:00,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:44:00,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:44:00,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:44:00,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00" (1/1) ... [2021-06-11 15:44:00,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00" (1/1) ... [2021-06-11 15:44:00,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00" (1/1) ... [2021-06-11 15:44:00,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00" (1/1) ... [2021-06-11 15:44:00,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00" (1/1) ... [2021-06-11 15:44:00,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00" (1/1) ... [2021-06-11 15:44:00,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00" (1/1) ... [2021-06-11 15:44:00,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:44:00,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:44:00,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:44:00,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:44:00,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00" (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-06-11 15:44:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:44:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:44:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:44:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:44:00,889 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:44:00,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:44:00,889 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:44:00,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:44:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:44:00,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:44:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:44:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:44:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:44:00,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:44:00,892 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 15:44:02,422 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:44:02,422 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:44:02,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:44:02 BoogieIcfgContainer [2021-06-11 15:44:02,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:44:02,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:44:02,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:44:02,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:44:02,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:44:00" (1/3) ... [2021-06-11 15:44:02,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:44:02, skipping insertion in model container [2021-06-11 15:44:02,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:00" (2/3) ... [2021-06-11 15:44:02,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:44:02, skipping insertion in model container [2021-06-11 15:44:02,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:44:02" (3/3) ... [2021-06-11 15:44:02,431 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_power.opt.i [2021-06-11 15:44:02,436 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:44:02,440 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:44:02,441 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:44:02,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,468 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,468 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,469 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,469 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,470 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,470 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,471 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,471 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,486 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,486 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,486 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,486 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,492 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,494 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,497 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,499 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:02,499 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:44:02,515 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 15:44:02,531 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:44:02,531 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:44:02,531 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:44:02,531 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:44:02,531 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:44:02,531 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:44:02,532 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:44:02,532 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:44:02,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-06-11 15:44:02,571 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-06-11 15:44:02,571 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:02,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-06-11 15:44:02,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 104 transitions, 223 flow [2021-06-11 15:44:02,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 101 transitions, 211 flow [2021-06-11 15:44:02,580 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:02,590 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 211 flow [2021-06-11 15:44:02,593 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 101 transitions, 211 flow [2021-06-11 15:44:02,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 211 flow [2021-06-11 15:44:02,611 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-06-11 15:44:02,612 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:02,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-06-11 15:44:02,615 INFO L151 LiptonReduction]: Number of co-enabled transitions 1832 [2021-06-11 15:44:02,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:02,824 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:44:02,825 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:44:02,849 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:02,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:02,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:02,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:02,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:02,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:03,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:03,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:03,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,513 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:03,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:03,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:03,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:03,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:03,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:03,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,883 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:44:03,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:03,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:03,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:04,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:04,689 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:44:05,150 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-11 15:44:05,309 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 15:44:05,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,327 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:05,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:44:05,331 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:05,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,333 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 15:44:05,333 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:44:05,336 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,338 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-11 15:44:05,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:05,340 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-11 15:44:05,341 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-11 15:44:05,341 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:44:05,342 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,344 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-11 15:44:05,345 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-11 15:44:05,345 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:44:05,346 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,351 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-11 15:44:05,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:05,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:05,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:05,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:05,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:05,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:05,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,861 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:05,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:05,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:05,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,046 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:44:06,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,226 INFO L147 QuantifierPusher]: treesize reduction 36, result has 2.7 percent of original size 1 [2021-06-11 15:44:06,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:06,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:06,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:06,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:07,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,042 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:07,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:07,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:07,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,371 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:07,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,376 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:07,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:44:07,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:07,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:07,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,379 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:07,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:44:07,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:44:07,385 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:07,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:44:07,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:44:07,739 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:44:07,892 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:44:08,235 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:44:08,386 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:44:08,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,397 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:08,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:08,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:08,409 INFO L163 LiptonReduction]: Checked pairs total: 4955 [2021-06-11 15:44:08,409 INFO L165 LiptonReduction]: Total number of compositions: 93 [2021-06-11 15:44:08,411 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5832 [2021-06-11 15:44:08,419 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-06-11 15:44:08,419 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:08,419 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:08,420 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:08,420 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:08,424 INFO L82 PathProgramCache]: Analyzing trace with hash 460211571, now seen corresponding path program 1 times [2021-06-11 15:44:08,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:08,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211397910] [2021-06-11 15:44:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:08,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:08,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211397910] [2021-06-11 15:44:08,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:08,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:44:08,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291321516] [2021-06-11 15:44:08,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:44:08,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:08,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:44:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:44:08,643 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 197 [2021-06-11 15:44:08,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:08,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:08,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 197 [2021-06-11 15:44:08,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:08,706 INFO L129 PetriNetUnfolder]: 9/50 cut-off events. [2021-06-11 15:44:08,707 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:08,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 50 events. 9/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 142 event pairs, 1 based on Foata normal form. 12/60 useless extension candidates. Maximal degree in co-relation 72. Up to 17 conditions per place. [2021-06-11 15:44:08,708 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 5 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-06-11 15:44:08,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 75 flow [2021-06-11 15:44:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:44:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:44:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2021-06-11 15:44:08,721 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.868020304568528 [2021-06-11 15:44:08,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2021-06-11 15:44:08,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2021-06-11 15:44:08,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:08,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2021-06-11 15:44:08,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:08,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:08,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:08,738 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 513 transitions. [2021-06-11 15:44:08,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 75 flow [2021-06-11 15:44:08,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 72 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 15:44:08,742 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 58 flow [2021-06-11 15:44:08,743 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2021-06-11 15:44:08,744 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2021-06-11 15:44:08,744 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:08,744 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 24 transitions, 58 flow [2021-06-11 15:44:08,745 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 58 flow [2021-06-11 15:44:08,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 58 flow [2021-06-11 15:44:08,750 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-06-11 15:44:08,750 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:08,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:44:08,750 INFO L151 LiptonReduction]: Number of co-enabled transitions 278 [2021-06-11 15:44:08,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:09,131 INFO L163 LiptonReduction]: Checked pairs total: 652 [2021-06-11 15:44:09,132 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:44:09,132 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 388 [2021-06-11 15:44:09,133 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-06-11 15:44:09,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:09,133 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:09,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 15:44:09,134 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:09,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:09,134 INFO L82 PathProgramCache]: Analyzing trace with hash 629455488, now seen corresponding path program 1 times [2021-06-11 15:44:09,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:09,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522829534] [2021-06-11 15:44:09,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:09,245 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:44:09,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:44:09,262 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-11 15:44:09,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:44:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:09,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522829534] [2021-06-11 15:44:09,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:09,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:44:09,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305792006] [2021-06-11 15:44:09,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:44:09,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:09,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:44:09,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:44:09,282 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 199 [2021-06-11 15:44:09,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:09,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 199 [2021-06-11 15:44:09,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:09,385 INFO L129 PetriNetUnfolder]: 148/347 cut-off events. [2021-06-11 15:44:09,386 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:09,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 347 events. 148/347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1886 event pairs, 34 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 611. Up to 117 conditions per place. [2021-06-11 15:44:09,388 INFO L132 encePairwiseOnDemand]: 190/199 looper letters, 7 selfloop transitions, 7 changer transitions 14/42 dead transitions. [2021-06-11 15:44:09,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 150 flow [2021-06-11 15:44:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:44:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:44:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 749 transitions. [2021-06-11 15:44:09,392 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7527638190954774 [2021-06-11 15:44:09,392 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 749 transitions. [2021-06-11 15:44:09,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 749 transitions. [2021-06-11 15:44:09,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:09,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 749 transitions. [2021-06-11 15:44:09,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,398 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,398 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 749 transitions. [2021-06-11 15:44:09,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 150 flow [2021-06-11 15:44:09,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:44:09,400 INFO L241 Difference]: Finished difference. Result has 38 places, 28 transitions, 116 flow [2021-06-11 15:44:09,400 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2021-06-11 15:44:09,400 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2021-06-11 15:44:09,400 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:09,400 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 116 flow [2021-06-11 15:44:09,401 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 116 flow [2021-06-11 15:44:09,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 116 flow [2021-06-11 15:44:09,419 INFO L129 PetriNetUnfolder]: 72/193 cut-off events. [2021-06-11 15:44:09,419 INFO L130 PetriNetUnfolder]: For 52/63 co-relation queries the response was YES. [2021-06-11 15:44:09,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 193 events. 72/193 cut-off events. For 52/63 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 975 event pairs, 38 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 451. Up to 117 conditions per place. [2021-06-11 15:44:09,421 INFO L151 LiptonReduction]: Number of co-enabled transitions 280 [2021-06-11 15:44:09,425 INFO L163 LiptonReduction]: Checked pairs total: 148 [2021-06-11 15:44:09,425 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:09,425 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-06-11 15:44:09,426 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 116 flow [2021-06-11 15:44:09,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,426 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:09,427 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:09,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 15:44:09,427 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:09,427 INFO L82 PathProgramCache]: Analyzing trace with hash -427628767, now seen corresponding path program 1 times [2021-06-11 15:44:09,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:09,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220035082] [2021-06-11 15:44:09,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:09,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:09,471 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:44:09,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:44:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:09,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220035082] [2021-06-11 15:44:09,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:09,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:44:09,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64906487] [2021-06-11 15:44:09,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:44:09,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:09,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:44:09,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:44:09,484 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 199 [2021-06-11 15:44:09,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:09,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 199 [2021-06-11 15:44:09,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:09,526 INFO L129 PetriNetUnfolder]: 48/159 cut-off events. [2021-06-11 15:44:09,526 INFO L130 PetriNetUnfolder]: For 55/145 co-relation queries the response was YES. [2021-06-11 15:44:09,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 159 events. 48/159 cut-off events. For 55/145 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 758 event pairs, 18 based on Foata normal form. 10/163 useless extension candidates. Maximal degree in co-relation 449. Up to 83 conditions per place. [2021-06-11 15:44:09,528 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 12 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2021-06-11 15:44:09,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 184 flow [2021-06-11 15:44:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:44:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:44:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2021-06-11 15:44:09,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7826633165829145 [2021-06-11 15:44:09,530 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 623 transitions. [2021-06-11 15:44:09,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 623 transitions. [2021-06-11 15:44:09,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:09,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 623 transitions. [2021-06-11 15:44:09,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.75) internal successors, (623), 4 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-06-11 15:44:09,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,534 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,534 INFO L185 Difference]: Start difference. First operand has 35 places, 28 transitions, 116 flow. Second operand 4 states and 623 transitions. [2021-06-11 15:44:09,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 184 flow [2021-06-11 15:44:09,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 148 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-06-11 15:44:09,537 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 138 flow [2021-06-11 15:44:09,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-06-11 15:44:09,538 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2021-06-11 15:44:09,538 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:09,538 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 138 flow [2021-06-11 15:44:09,538 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 138 flow [2021-06-11 15:44:09,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 138 flow [2021-06-11 15:44:09,552 INFO L129 PetriNetUnfolder]: 48/145 cut-off events. [2021-06-11 15:44:09,553 INFO L130 PetriNetUnfolder]: For 57/66 co-relation queries the response was YES. [2021-06-11 15:44:09,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 145 events. 48/145 cut-off events. For 57/66 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 662 event pairs, 17 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 339. Up to 83 conditions per place. [2021-06-11 15:44:09,554 INFO L151 LiptonReduction]: Number of co-enabled transitions 312 [2021-06-11 15:44:09,558 INFO L163 LiptonReduction]: Checked pairs total: 195 [2021-06-11 15:44:09,558 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:09,558 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-06-11 15:44:09,559 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 138 flow [2021-06-11 15:44:09,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,559 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:09,559 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:09,560 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 15:44:09,560 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:09,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1972632334, now seen corresponding path program 1 times [2021-06-11 15:44:09,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:09,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212568351] [2021-06-11 15:44:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:09,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:09,613 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:44:09,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:44:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:09,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212568351] [2021-06-11 15:44:09,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:09,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:44:09,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712458282] [2021-06-11 15:44:09,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:44:09,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:09,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:44:09,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:44:09,626 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 199 [2021-06-11 15:44:09,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:09,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 199 [2021-06-11 15:44:09,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:09,670 INFO L129 PetriNetUnfolder]: 39/130 cut-off events. [2021-06-11 15:44:09,670 INFO L130 PetriNetUnfolder]: For 88/155 co-relation queries the response was YES. [2021-06-11 15:44:09,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 130 events. 39/130 cut-off events. For 88/155 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 543 event pairs, 4 based on Foata normal form. 3/128 useless extension candidates. Maximal degree in co-relation 380. Up to 70 conditions per place. [2021-06-11 15:44:09,671 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 13 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2021-06-11 15:44:09,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 232 flow [2021-06-11 15:44:09,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:44:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:44:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 625 transitions. [2021-06-11 15:44:09,674 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.785175879396985 [2021-06-11 15:44:09,674 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 625 transitions. [2021-06-11 15:44:09,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 625 transitions. [2021-06-11 15:44:09,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:09,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 625 transitions. [2021-06-11 15:44:09,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.25) internal successors, (625), 4 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-06-11 15:44:09,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,678 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,678 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 138 flow. Second operand 4 states and 625 transitions. [2021-06-11 15:44:09,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 232 flow [2021-06-11 15:44:09,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:44:09,681 INFO L241 Difference]: Finished difference. Result has 42 places, 36 transitions, 224 flow [2021-06-11 15:44:09,681 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2021-06-11 15:44:09,681 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2021-06-11 15:44:09,681 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:09,681 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 224 flow [2021-06-11 15:44:09,682 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 224 flow [2021-06-11 15:44:09,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 224 flow [2021-06-11 15:44:09,695 INFO L129 PetriNetUnfolder]: 39/130 cut-off events. [2021-06-11 15:44:09,695 INFO L130 PetriNetUnfolder]: For 172/179 co-relation queries the response was YES. [2021-06-11 15:44:09,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 130 events. 39/130 cut-off events. For 172/179 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 589 event pairs, 14 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 384. Up to 70 conditions per place. [2021-06-11 15:44:09,697 INFO L151 LiptonReduction]: Number of co-enabled transitions 348 [2021-06-11 15:44:09,701 INFO L163 LiptonReduction]: Checked pairs total: 245 [2021-06-11 15:44:09,702 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:09,702 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-06-11 15:44:09,702 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 224 flow [2021-06-11 15:44:09,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,703 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:09,703 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:09,703 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 15:44:09,703 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:09,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:09,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1619157298, now seen corresponding path program 1 times [2021-06-11 15:44:09,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:09,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672202073] [2021-06-11 15:44:09,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:09,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:09,751 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:44:09,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:09,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:09,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672202073] [2021-06-11 15:44:09,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:09,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:44:09,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813408621] [2021-06-11 15:44:09,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:44:09,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:09,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:44:09,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:44:09,761 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 199 [2021-06-11 15:44:09,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:09,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 199 [2021-06-11 15:44:09,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:09,840 INFO L129 PetriNetUnfolder]: 215/503 cut-off events. [2021-06-11 15:44:09,841 INFO L130 PetriNetUnfolder]: For 210/218 co-relation queries the response was YES. [2021-06-11 15:44:09,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 503 events. 215/503 cut-off events. For 210/218 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3389 event pairs, 64 based on Foata normal form. 43/448 useless extension candidates. Maximal degree in co-relation 1170. Up to 226 conditions per place. [2021-06-11 15:44:09,845 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 8 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2021-06-11 15:44:09,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 282 flow [2021-06-11 15:44:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:44:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:44:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 810 transitions. [2021-06-11 15:44:09,847 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8140703517587939 [2021-06-11 15:44:09,847 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 810 transitions. [2021-06-11 15:44:09,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 810 transitions. [2021-06-11 15:44:09,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:09,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 810 transitions. [2021-06-11 15:44:09,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,852 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,853 INFO L185 Difference]: Start difference. First operand has 42 places, 36 transitions, 224 flow. Second operand 5 states and 810 transitions. [2021-06-11 15:44:09,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 282 flow [2021-06-11 15:44:09,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:44:09,856 INFO L241 Difference]: Finished difference. Result has 48 places, 44 transitions, 289 flow [2021-06-11 15:44:09,856 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2021-06-11 15:44:09,856 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2021-06-11 15:44:09,856 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:09,857 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 44 transitions, 289 flow [2021-06-11 15:44:09,857 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 44 transitions, 289 flow [2021-06-11 15:44:09,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 289 flow [2021-06-11 15:44:09,898 INFO L129 PetriNetUnfolder]: 189/467 cut-off events. [2021-06-11 15:44:09,898 INFO L130 PetriNetUnfolder]: For 458/572 co-relation queries the response was YES. [2021-06-11 15:44:09,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 467 events. 189/467 cut-off events. For 458/572 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 3173 event pairs, 62 based on Foata normal form. 10/424 useless extension candidates. Maximal degree in co-relation 1397. Up to 270 conditions per place. [2021-06-11 15:44:09,904 INFO L151 LiptonReduction]: Number of co-enabled transitions 544 [2021-06-11 15:44:09,937 INFO L163 LiptonReduction]: Checked pairs total: 248 [2021-06-11 15:44:09,937 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:09,937 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 81 [2021-06-11 15:44:09,938 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 289 flow [2021-06-11 15:44:09,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:09,938 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:09,938 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:09,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 15:44:09,938 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1637026141, now seen corresponding path program 1 times [2021-06-11 15:44:09,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:09,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683841215] [2021-06-11 15:44:09,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:10,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:10,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:10,055 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:44:10,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:10,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:10,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683841215] [2021-06-11 15:44:10,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:10,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:44:10,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079766198] [2021-06-11 15:44:10,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:44:10,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:10,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:44:10,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:44:10,065 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 199 [2021-06-11 15:44:10,066 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,066 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:10,066 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 199 [2021-06-11 15:44:10,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:10,169 INFO L129 PetriNetUnfolder]: 159/419 cut-off events. [2021-06-11 15:44:10,169 INFO L130 PetriNetUnfolder]: For 743/1294 co-relation queries the response was YES. [2021-06-11 15:44:10,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 419 events. 159/419 cut-off events. For 743/1294 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2771 event pairs, 15 based on Foata normal form. 168/539 useless extension candidates. Maximal degree in co-relation 1540. Up to 226 conditions per place. [2021-06-11 15:44:10,173 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 5 selfloop transitions, 18 changer transitions 3/55 dead transitions. [2021-06-11 15:44:10,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 55 transitions, 404 flow [2021-06-11 15:44:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:44:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:44:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1134 transitions. [2021-06-11 15:44:10,177 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8140703517587939 [2021-06-11 15:44:10,177 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1134 transitions. [2021-06-11 15:44:10,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1134 transitions. [2021-06-11 15:44:10,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:10,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1134 transitions. [2021-06-11 15:44:10,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,183 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,183 INFO L185 Difference]: Start difference. First operand has 48 places, 44 transitions, 289 flow. Second operand 7 states and 1134 transitions. [2021-06-11 15:44:10,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 55 transitions, 404 flow [2021-06-11 15:44:10,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 404 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:44:10,189 INFO L241 Difference]: Finished difference. Result has 57 places, 52 transitions, 402 flow [2021-06-11 15:44:10,189 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2021-06-11 15:44:10,189 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2021-06-11 15:44:10,189 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:10,189 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 52 transitions, 402 flow [2021-06-11 15:44:10,189 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 52 transitions, 402 flow [2021-06-11 15:44:10,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 52 transitions, 402 flow [2021-06-11 15:44:10,227 INFO L129 PetriNetUnfolder]: 143/390 cut-off events. [2021-06-11 15:44:10,227 INFO L130 PetriNetUnfolder]: For 1317/1615 co-relation queries the response was YES. [2021-06-11 15:44:10,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 390 events. 143/390 cut-off events. For 1317/1615 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 2620 event pairs, 11 based on Foata normal form. 1/347 useless extension candidates. Maximal degree in co-relation 1621. Up to 205 conditions per place. [2021-06-11 15:44:10,235 INFO L151 LiptonReduction]: Number of co-enabled transitions 636 [2021-06-11 15:44:10,244 INFO L163 LiptonReduction]: Checked pairs total: 342 [2021-06-11 15:44:10,245 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:10,245 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-06-11 15:44:10,245 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 402 flow [2021-06-11 15:44:10,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,246 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:10,246 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:10,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 15:44:10,246 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1124298556, now seen corresponding path program 1 times [2021-06-11 15:44:10,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:10,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855667100] [2021-06-11 15:44:10,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:10,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:10,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:10,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:10,311 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:44:10,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:10,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:10,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855667100] [2021-06-11 15:44:10,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:10,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:44:10,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092025402] [2021-06-11 15:44:10,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:44:10,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:10,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:44:10,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:44:10,322 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 199 [2021-06-11 15:44:10,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:10,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 199 [2021-06-11 15:44:10,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:10,429 INFO L129 PetriNetUnfolder]: 134/368 cut-off events. [2021-06-11 15:44:10,429 INFO L130 PetriNetUnfolder]: For 1925/3042 co-relation queries the response was YES. [2021-06-11 15:44:10,432 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1828 conditions, 368 events. 134/368 cut-off events. For 1925/3042 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2409 event pairs, 8 based on Foata normal form. 156/477 useless extension candidates. Maximal degree in co-relation 1801. Up to 200 conditions per place. [2021-06-11 15:44:10,434 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 2 selfloop transitions, 22 changer transitions 4/57 dead transitions. [2021-06-11 15:44:10,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 496 flow [2021-06-11 15:44:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:44:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:44:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1452 transitions. [2021-06-11 15:44:10,437 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8107202680067002 [2021-06-11 15:44:10,438 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1452 transitions. [2021-06-11 15:44:10,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1452 transitions. [2021-06-11 15:44:10,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:10,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1452 transitions. [2021-06-11 15:44:10,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 161.33333333333334) internal successors, (1452), 9 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,445 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,445 INFO L185 Difference]: Start difference. First operand has 57 places, 52 transitions, 402 flow. Second operand 9 states and 1452 transitions. [2021-06-11 15:44:10,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 496 flow [2021-06-11 15:44:10,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 440 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-06-11 15:44:10,455 INFO L241 Difference]: Finished difference. Result has 63 places, 53 transitions, 416 flow [2021-06-11 15:44:10,455 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=416, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2021-06-11 15:44:10,455 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2021-06-11 15:44:10,455 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:10,455 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 53 transitions, 416 flow [2021-06-11 15:44:10,456 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 53 transitions, 416 flow [2021-06-11 15:44:10,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 53 transitions, 416 flow [2021-06-11 15:44:10,484 INFO L129 PetriNetUnfolder]: 129/352 cut-off events. [2021-06-11 15:44:10,485 INFO L130 PetriNetUnfolder]: For 1225/1323 co-relation queries the response was YES. [2021-06-11 15:44:10,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 352 events. 129/352 cut-off events. For 1225/1323 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 2310 event pairs, 6 based on Foata normal form. 1/311 useless extension candidates. Maximal degree in co-relation 1463. Up to 120 conditions per place. [2021-06-11 15:44:10,490 INFO L151 LiptonReduction]: Number of co-enabled transitions 598 [2021-06-11 15:44:10,503 INFO L163 LiptonReduction]: Checked pairs total: 319 [2021-06-11 15:44:10,503 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:10,504 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-06-11 15:44:10,504 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 416 flow [2021-06-11 15:44:10,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,505 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:10,505 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:10,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 15:44:10,505 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:10,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2136994930, now seen corresponding path program 1 times [2021-06-11 15:44:10,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:10,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259935568] [2021-06-11 15:44:10,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:10,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:44:10,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:44:10,583 INFO L142 QuantifierPusher]: treesize reduction 12, result has 80.6 percent of original size [2021-06-11 15:44:10,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:44:10,604 INFO L142 QuantifierPusher]: treesize reduction 7, result has 68.2 percent of original size [2021-06-11 15:44:10,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 15:44:10,615 INFO L142 QuantifierPusher]: treesize reduction 7, result has 68.2 percent of original size [2021-06-11 15:44:10,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 15:44:10,627 INFO L142 QuantifierPusher]: treesize reduction 8, result has 80.0 percent of original size [2021-06-11 15:44:10,628 INFO L147 QuantifierPusher]: treesize reduction 9, result has 71.9 percent of original size 23 [2021-06-11 15:44:10,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:44:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:10,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259935568] [2021-06-11 15:44:10,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:10,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:44:10,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690633507] [2021-06-11 15:44:10,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 15:44:10,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:10,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 15:44:10,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-11 15:44:10,643 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 199 [2021-06-11 15:44:10,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 416 flow. Second operand has 8 states, 8 states have (on average 144.0) internal successors, (1152), 8 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:10,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 199 [2021-06-11 15:44:10,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:10,839 INFO L129 PetriNetUnfolder]: 279/736 cut-off events. [2021-06-11 15:44:10,839 INFO L130 PetriNetUnfolder]: For 3160/3627 co-relation queries the response was YES. [2021-06-11 15:44:10,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 736 events. 279/736 cut-off events. For 3160/3627 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 5667 event pairs, 19 based on Foata normal form. 55/689 useless extension candidates. Maximal degree in co-relation 3087. Up to 232 conditions per place. [2021-06-11 15:44:10,847 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 16 selfloop transitions, 7 changer transitions 6/70 dead transitions. [2021-06-11 15:44:10,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 596 flow [2021-06-11 15:44:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:44:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:44:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1020 transitions. [2021-06-11 15:44:10,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7322325915290739 [2021-06-11 15:44:10,849 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1020 transitions. [2021-06-11 15:44:10,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1020 transitions. [2021-06-11 15:44:10,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:10,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1020 transitions. [2021-06-11 15:44:10,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.71428571428572) internal successors, (1020), 7 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,854 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,854 INFO L185 Difference]: Start difference. First operand has 62 places, 53 transitions, 416 flow. Second operand 7 states and 1020 transitions. [2021-06-11 15:44:10,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 596 flow [2021-06-11 15:44:10,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 526 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-06-11 15:44:10,892 INFO L241 Difference]: Finished difference. Result has 64 places, 58 transitions, 408 flow [2021-06-11 15:44:10,893 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=408, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2021-06-11 15:44:10,893 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2021-06-11 15:44:10,893 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:10,893 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 58 transitions, 408 flow [2021-06-11 15:44:10,893 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 58 transitions, 408 flow [2021-06-11 15:44:10,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 58 transitions, 408 flow [2021-06-11 15:44:10,948 INFO L129 PetriNetUnfolder]: 256/693 cut-off events. [2021-06-11 15:44:10,948 INFO L130 PetriNetUnfolder]: For 1074/1116 co-relation queries the response was YES. [2021-06-11 15:44:10,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 693 events. 256/693 cut-off events. For 1074/1116 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 5403 event pairs, 12 based on Foata normal form. 1/607 useless extension candidates. Maximal degree in co-relation 2545. Up to 240 conditions per place. [2021-06-11 15:44:10,958 INFO L151 LiptonReduction]: Number of co-enabled transitions 732 [2021-06-11 15:44:10,973 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:44:10,973 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:10,974 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 81 [2021-06-11 15:44:10,974 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 408 flow [2021-06-11 15:44:10,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 144.0) internal successors, (1152), 8 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,975 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:10,975 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:10,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 15:44:10,975 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash -900195552, now seen corresponding path program 2 times [2021-06-11 15:44:10,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:10,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230806686] [2021-06-11 15:44:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:11,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:11,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:11,089 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:44:11,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:44:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:11,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230806686] [2021-06-11 15:44:11,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:11,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:44:11,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895971259] [2021-06-11 15:44:11,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:44:11,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:11,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:44:11,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:44:11,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 199 [2021-06-11 15:44:11,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 408 flow. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:11,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 199 [2021-06-11 15:44:11,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:11,232 INFO L129 PetriNetUnfolder]: 316/850 cut-off events. [2021-06-11 15:44:11,232 INFO L130 PetriNetUnfolder]: For 1414/1527 co-relation queries the response was YES. [2021-06-11 15:44:11,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3269 conditions, 850 events. 316/850 cut-off events. For 1414/1527 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 6866 event pairs, 10 based on Foata normal form. 6/748 useless extension candidates. Maximal degree in co-relation 3240. Up to 280 conditions per place. [2021-06-11 15:44:11,240 INFO L132 encePairwiseOnDemand]: 190/199 looper letters, 15 selfloop transitions, 22 changer transitions 5/72 dead transitions. [2021-06-11 15:44:11,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 72 transitions, 573 flow [2021-06-11 15:44:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:44:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:44:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2021-06-11 15:44:11,243 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7678391959798995 [2021-06-11 15:44:11,243 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 764 transitions. [2021-06-11 15:44:11,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 764 transitions. [2021-06-11 15:44:11,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:11,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 764 transitions. [2021-06-11 15:44:11,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,248 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,248 INFO L185 Difference]: Start difference. First operand has 64 places, 58 transitions, 408 flow. Second operand 5 states and 764 transitions. [2021-06-11 15:44:11,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 72 transitions, 573 flow [2021-06-11 15:44:11,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 571 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:44:11,272 INFO L241 Difference]: Finished difference. Result has 69 places, 63 transitions, 524 flow [2021-06-11 15:44:11,272 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=524, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2021-06-11 15:44:11,272 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2021-06-11 15:44:11,272 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:11,272 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 63 transitions, 524 flow [2021-06-11 15:44:11,272 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 63 transitions, 524 flow [2021-06-11 15:44:11,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 63 transitions, 524 flow [2021-06-11 15:44:11,317 INFO L129 PetriNetUnfolder]: 192/527 cut-off events. [2021-06-11 15:44:11,317 INFO L130 PetriNetUnfolder]: For 1003/1020 co-relation queries the response was YES. [2021-06-11 15:44:11,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 527 events. 192/527 cut-off events. For 1003/1020 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 3895 event pairs, 5 based on Foata normal form. 2/471 useless extension candidates. Maximal degree in co-relation 2043. Up to 168 conditions per place. [2021-06-11 15:44:11,325 INFO L151 LiptonReduction]: Number of co-enabled transitions 710 [2021-06-11 15:44:11,333 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:44:11,333 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:11,333 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 61 [2021-06-11 15:44:11,334 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 524 flow [2021-06-11 15:44:11,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,334 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:11,334 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:11,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 15:44:11,334 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:11,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:11,335 INFO L82 PathProgramCache]: Analyzing trace with hash 638069052, now seen corresponding path program 3 times [2021-06-11 15:44:11,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:11,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219688977] [2021-06-11 15:44:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:11,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:11,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:11,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:11,409 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:44:11,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:44:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:11,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219688977] [2021-06-11 15:44:11,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:11,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:44:11,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070738317] [2021-06-11 15:44:11,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:44:11,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:11,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:44:11,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:44:11,422 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 199 [2021-06-11 15:44:11,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 524 flow. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:11,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 199 [2021-06-11 15:44:11,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:11,530 INFO L129 PetriNetUnfolder]: 232/627 cut-off events. [2021-06-11 15:44:11,530 INFO L130 PetriNetUnfolder]: For 1230/1253 co-relation queries the response was YES. [2021-06-11 15:44:11,534 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2558 conditions, 627 events. 232/627 cut-off events. For 1230/1253 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 4587 event pairs, 4 based on Foata normal form. 5/562 useless extension candidates. Maximal degree in co-relation 2532. Up to 216 conditions per place. [2021-06-11 15:44:11,536 INFO L132 encePairwiseOnDemand]: 190/199 looper letters, 8 selfloop transitions, 9 changer transitions 29/74 dead transitions. [2021-06-11 15:44:11,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 74 transitions, 724 flow [2021-06-11 15:44:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 15:44:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 15:44:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 916 transitions. [2021-06-11 15:44:11,539 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7671691792294807 [2021-06-11 15:44:11,539 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 916 transitions. [2021-06-11 15:44:11,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 916 transitions. [2021-06-11 15:44:11,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:11,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 916 transitions. [2021-06-11 15:44:11,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.66666666666666) internal successors, (916), 6 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,544 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,544 INFO L185 Difference]: Start difference. First operand has 66 places, 63 transitions, 524 flow. Second operand 6 states and 916 transitions. [2021-06-11 15:44:11,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 74 transitions, 724 flow [2021-06-11 15:44:11,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 708 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-06-11 15:44:11,560 INFO L241 Difference]: Finished difference. Result has 69 places, 43 transitions, 324 flow [2021-06-11 15:44:11,561 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=69, PETRI_TRANSITIONS=43} [2021-06-11 15:44:11,561 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2021-06-11 15:44:11,562 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:11,562 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 43 transitions, 324 flow [2021-06-11 15:44:11,562 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 43 transitions, 324 flow [2021-06-11 15:44:11,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 43 transitions, 324 flow [2021-06-11 15:44:11,580 INFO L129 PetriNetUnfolder]: 58/213 cut-off events. [2021-06-11 15:44:11,580 INFO L130 PetriNetUnfolder]: For 426/428 co-relation queries the response was YES. [2021-06-11 15:44:11,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 213 events. 58/213 cut-off events. For 426/428 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1315 event pairs, 4 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 812. Up to 56 conditions per place. [2021-06-11 15:44:11,583 INFO L151 LiptonReduction]: Number of co-enabled transitions 322 [2021-06-11 15:44:11,589 INFO L163 LiptonReduction]: Checked pairs total: 105 [2021-06-11 15:44:11,590 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:11,590 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-06-11 15:44:11,590 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 324 flow [2021-06-11 15:44:11,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,591 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:11,591 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:11,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 15:44:11,591 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:11,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1073308968, now seen corresponding path program 4 times [2021-06-11 15:44:11,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:11,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405578749] [2021-06-11 15:44:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:11,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:11,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:11,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405578749] [2021-06-11 15:44:11,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:11,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:44:11,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237214804] [2021-06-11 15:44:11,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:44:11,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:11,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:44:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:44:11,642 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 199 [2021-06-11 15:44:11,643 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,643 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:11,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 199 [2021-06-11 15:44:11,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:11,673 INFO L129 PetriNetUnfolder]: 64/244 cut-off events. [2021-06-11 15:44:11,673 INFO L130 PetriNetUnfolder]: For 531/538 co-relation queries the response was YES. [2021-06-11 15:44:11,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 244 events. 64/244 cut-off events. For 531/538 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1568 event pairs, 4 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 933. Up to 68 conditions per place. [2021-06-11 15:44:11,675 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 2 selfloop transitions, 2 changer transitions 16/43 dead transitions. [2021-06-11 15:44:11,675 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 43 transitions, 338 flow [2021-06-11 15:44:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:44:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:44:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2021-06-11 15:44:11,676 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8592964824120602 [2021-06-11 15:44:11,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2021-06-11 15:44:11,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2021-06-11 15:44:11,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:11,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2021-06-11 15:44:11,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,680 INFO L185 Difference]: Start difference. First operand has 67 places, 43 transitions, 324 flow. Second operand 3 states and 513 transitions. [2021-06-11 15:44:11,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 43 transitions, 338 flow [2021-06-11 15:44:11,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 43 transitions, 269 flow, removed 5 selfloop flow, removed 13 redundant places. [2021-06-11 15:44:11,686 INFO L241 Difference]: Finished difference. Result has 57 places, 27 transitions, 152 flow [2021-06-11 15:44:11,686 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=57, PETRI_TRANSITIONS=27} [2021-06-11 15:44:11,687 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2021-06-11 15:44:11,687 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:11,687 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 27 transitions, 152 flow [2021-06-11 15:44:11,687 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 27 transitions, 152 flow [2021-06-11 15:44:11,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 27 transitions, 152 flow [2021-06-11 15:44:11,692 INFO L129 PetriNetUnfolder]: 6/39 cut-off events. [2021-06-11 15:44:11,692 INFO L130 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2021-06-11 15:44:11,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 39 events. 6/39 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 109. Up to 10 conditions per place. [2021-06-11 15:44:11,692 INFO L151 LiptonReduction]: Number of co-enabled transitions 46 [2021-06-11 15:44:11,694 INFO L163 LiptonReduction]: Checked pairs total: 27 [2021-06-11 15:44:11,694 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:11,694 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 15:44:11,696 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 152 flow [2021-06-11 15:44:11,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,697 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:11,697 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:11,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 15:44:11,697 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash -521132066, now seen corresponding path program 5 times [2021-06-11 15:44:11,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:11,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650534410] [2021-06-11 15:44:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:44:11,759 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:44:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:44:11,799 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:44:11,836 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:44:11,836 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:44:11,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 15:44:11,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:44:11 BasicIcfg [2021-06-11 15:44:11,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:44:11,951 INFO L168 Benchmark]: Toolchain (without parser) took 11861.59 ms. Allocated memory was 350.2 MB in the beginning and 511.7 MB in the end (delta: 161.5 MB). Free memory was 311.7 MB in the beginning and 217.6 MB in the end (delta: 94.1 MB). Peak memory consumption was 256.8 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:11,954 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 350.2 MB. Free memory was 330.3 MB in the beginning and 330.3 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:44:11,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.33 ms. Allocated memory is still 350.2 MB. Free memory was 311.5 MB in the beginning and 308.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:11,955 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.12 ms. Allocated memory is still 350.2 MB. Free memory was 308.7 MB in the beginning and 305.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:11,955 INFO L168 Benchmark]: Boogie Preprocessor took 51.93 ms. Allocated memory is still 350.2 MB. Free memory was 305.6 MB in the beginning and 303.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:11,955 INFO L168 Benchmark]: RCFGBuilder took 1630.07 ms. Allocated memory is still 350.2 MB. Free memory was 303.5 MB in the beginning and 291.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 150.5 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:11,955 INFO L168 Benchmark]: TraceAbstraction took 9523.82 ms. Allocated memory was 350.2 MB in the beginning and 511.7 MB in the end (delta: 161.5 MB). Free memory was 291.4 MB in the beginning and 217.6 MB in the end (delta: 73.9 MB). Peak memory consumption was 235.3 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:11,956 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.57 ms. Allocated memory is still 350.2 MB. Free memory was 330.3 MB in the beginning and 330.3 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 591.33 ms. Allocated memory is still 350.2 MB. Free memory was 311.5 MB in the beginning and 308.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 59.12 ms. Allocated memory is still 350.2 MB. Free memory was 308.7 MB in the beginning and 305.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 51.93 ms. Allocated memory is still 350.2 MB. Free memory was 305.6 MB in the beginning and 303.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1630.07 ms. Allocated memory is still 350.2 MB. Free memory was 303.5 MB in the beginning and 291.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 150.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9523.82 ms. Allocated memory was 350.2 MB in the beginning and 511.7 MB in the end (delta: 161.5 MB). Free memory was 291.4 MB in the beginning and 217.6 MB in the end (delta: 73.9 MB). Peak memory consumption was 235.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5815.9ms, 109 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 27 TransitionsAfterwards, 1832 CoEnabledTransitionPairs, 8 FixpointIterations, 40 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 4955 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2456, positive: 2285, positive conditional: 2285, positive unconditional: 0, negative: 171, negative conditional: 171, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2456, positive: 2285, positive conditional: 0, positive unconditional: 2285, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2456, positive: 2285, positive conditional: 0, positive unconditional: 2285, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1540, positive: 1501, positive conditional: 0, positive unconditional: 1501, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1540, positive: 1478, positive conditional: 0, positive unconditional: 1478, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 413, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 348, negative conditional: 0, negative unconditional: 348, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2456, positive: 784, positive conditional: 0, positive unconditional: 784, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 1540, unknown conditional: 0, unknown unconditional: 1540] , Statistics on independence cache: Total cache size (in pairs): 1540, Positive cache size: 1501, Positive conditional cache size: 0, Positive unconditional cache size: 1501, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 386.8ms, 33 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 652 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 208, positive: 164, positive conditional: 164, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 208, positive: 164, positive conditional: 7, positive unconditional: 157, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 208, positive: 164, positive conditional: 7, positive unconditional: 157, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, positive: 42, positive conditional: 3, positive unconditional: 39, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 53, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 216, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 190, negative conditional: 0, negative unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, positive: 122, positive conditional: 4, positive unconditional: 118, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 53, unknown conditional: 3, unknown unconditional: 50] , Statistics on independence cache: Total cache size (in pairs): 1593, Positive cache size: 1543, Positive conditional cache size: 3, Positive unconditional cache size: 1540, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.4ms, 38 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 148 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 59, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 1603, Positive cache size: 1553, Positive conditional cache size: 3, Positive unconditional cache size: 1550, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.0ms, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 195 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 11, negative conditional: 0, negative unconditional: 11, 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: 60, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1607, Positive cache size: 1557, Positive conditional cache size: 3, Positive unconditional cache size: 1554, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.0ms, 42 PlacesBefore, 42 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 245 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, positive: 80, positive conditional: 80, 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: 94, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 94, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1608, Positive cache size: 1558, Positive conditional cache size: 3, Positive unconditional cache size: 1555, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 80.2ms, 48 PlacesBefore, 48 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 248 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, positive: 92, positive conditional: 92, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, positive: 92, positive conditional: 33, positive unconditional: 59, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 92, positive conditional: 33, positive unconditional: 59, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 4, 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: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, positive: 85, positive conditional: 29, positive unconditional: 56, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1616, Positive cache size: 1565, Positive conditional cache size: 7, Positive unconditional cache size: 1558, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.1ms, 57 PlacesBefore, 57 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 636 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 342 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, positive: 105, positive conditional: 105, 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: 123, positive: 105, positive conditional: 64, positive unconditional: 41, 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: 123, positive: 105, positive conditional: 64, positive unconditional: 41, 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: 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: 123, positive: 105, positive conditional: 64, positive unconditional: 41, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1616, Positive cache size: 1565, Positive conditional cache size: 7, Positive unconditional cache size: 1558, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.7ms, 63 PlacesBefore, 62 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 598 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 319 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, positive: 128, positive conditional: 128, 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: 146, positive: 128, positive conditional: 75, positive unconditional: 53, 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: 146, positive: 128, positive conditional: 75, positive unconditional: 53, 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: 1, positive: 1, positive conditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 146, positive: 127, positive conditional: 74, positive unconditional: 53, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1617, Positive cache size: 1566, Positive conditional cache size: 8, Positive unconditional cache size: 1558, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 80.3ms, 64 PlacesBefore, 64 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1617, Positive cache size: 1566, Positive conditional cache size: 8, Positive unconditional cache size: 1558, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.6ms, 69 PlacesBefore, 66 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 710 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1617, Positive cache size: 1566, Positive conditional cache size: 8, Positive unconditional cache size: 1558, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.8ms, 69 PlacesBefore, 67 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 105 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, positive: 15, positive conditional: 5, positive unconditional: 10, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 15, positive conditional: 5, positive unconditional: 10, negative: 5, negative conditional: 0, negative unconditional: 5, 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: 20, positive: 15, positive conditional: 5, positive unconditional: 10, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1617, Positive cache size: 1566, Positive conditional cache size: 8, Positive unconditional cache size: 1558, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0ms, 57 PlacesBefore, 50 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 27 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, positive: 12, positive conditional: 9, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 9, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, 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: 15, positive: 12, positive conditional: 9, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1617, Positive cache size: 1566, Positive conditional cache size: 8, Positive unconditional cache size: 1558, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t876; [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t877; [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t878; [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 a = 1 [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9310.3ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1294.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5884.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 93 SDtfs, 57 SDslu, 58 SDs, 0 SdLazy, 230 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 279.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 291.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=524occurred in iteration=9, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 38.7ms SsaConstructionTime, 338.6ms SatisfiabilityAnalysisTime, 676.0ms InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 1133 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...