/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:50:27,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:50:27,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:50:27,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:50:27,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:50:27,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:50:27,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:50:27,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:50:27,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:50:27,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:50:27,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:50:27,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:50:27,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:50:27,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:50:27,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:50:27,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:50:27,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:50:27,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:50:27,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:50:27,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:50:27,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:50:27,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:50:27,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:50:27,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:50:27,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:50:27,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:50:27,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:50:27,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:50:27,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:50:27,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:50:27,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:50:27,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:50:27,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:50:27,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:50:27,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:50:27,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:50:27,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:50:27,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:50:27,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:50:27,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:50:27,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:50:27,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 04:50:27,138 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:50:27,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:50:27,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:50:27,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:50:27,142 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:50:27,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:50:27,142 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:50:27,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:50:27,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:50:27,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:50:27,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:50:27,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:50:27,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:50:27,144 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:50:27,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:50:27,144 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:50:27,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:50:27,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:50:27,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:50:27,145 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:50:27,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:50:27,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:50:27,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:50:27,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:50:27,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:50:27,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:50:27,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:50:27,146 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:50:27,146 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:50:27,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:50:27,146 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:50:27,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:50:27,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:50:27,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:50:27,429 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:50:27,430 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:50:27,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2021-03-25 04:50:27,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f52518b5/e7b39658366741c2903d96f11c874add/FLAGa165723d3 [2021-03-25 04:50:27,949 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:50:27,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2021-03-25 04:50:27,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f52518b5/e7b39658366741c2903d96f11c874add/FLAGa165723d3 [2021-03-25 04:50:28,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f52518b5/e7b39658366741c2903d96f11c874add [2021-03-25 04:50:28,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:50:28,301 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:50:28,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:50:28,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:50:28,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:50:28,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:50:28" (1/1) ... [2021-03-25 04:50:28,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5610347f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28, skipping insertion in model container [2021-03-25 04:50:28,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:50:28" (1/1) ... [2021-03-25 04:50:28,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:50:28,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:50:28,509 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/mix056_pso.opt.i[948,961] [2021-03-25 04:50:28,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:50:28,777 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:50:28,790 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/mix056_pso.opt.i[948,961] [2021-03-25 04:50:28,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:50:28,918 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:50:28,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28 WrapperNode [2021-03-25 04:50:28,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:50:28,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:50:28,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:50:28,922 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:50:28,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28" (1/1) ... [2021-03-25 04:50:28,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28" (1/1) ... [2021-03-25 04:50:28,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:50:28,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:50:28,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:50:28,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:50:29,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28" (1/1) ... [2021-03-25 04:50:29,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28" (1/1) ... [2021-03-25 04:50:29,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28" (1/1) ... [2021-03-25 04:50:29,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28" (1/1) ... [2021-03-25 04:50:29,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28" (1/1) ... [2021-03-25 04:50:29,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28" (1/1) ... [2021-03-25 04:50:29,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28" (1/1) ... [2021-03-25 04:50:29,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:50:29,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:50:29,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:50:29,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:50:29,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:50:29,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:50:29,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:50:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:50:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:50:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:50:29,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:50:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:50:29,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:50:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:50:29,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:50:29,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:50:29,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:50:29,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:50:29,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:50:29,116 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:50:30,681 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:50:30,681 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:50:30,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:50:30 BoogieIcfgContainer [2021-03-25 04:50:30,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:50:30,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:50:30,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:50:30,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:50:30,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:50:28" (1/3) ... [2021-03-25 04:50:30,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208d1a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:50:30, skipping insertion in model container [2021-03-25 04:50:30,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:28" (2/3) ... [2021-03-25 04:50:30,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208d1a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:50:30, skipping insertion in model container [2021-03-25 04:50:30,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:50:30" (3/3) ... [2021-03-25 04:50:30,690 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_pso.opt.i [2021-03-25 04:50:30,697 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:50:30,700 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:50:30,701 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:50:30,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,732 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,732 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,732 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,732 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,734 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,734 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,734 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,739 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,739 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,741 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,741 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,746 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,747 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,748 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,752 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,752 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,753 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:30,755 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:50:30,772 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 04:50:30,787 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:50:30,787 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:50:30,787 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:50:30,788 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:50:30,788 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:50:30,788 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:50:30,788 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:50:30,788 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:50:30,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-03-25 04:50:30,860 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-25 04:50:30,861 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:30,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 04:50:30,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-03-25 04:50:30,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-03-25 04:50:30,869 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:30,876 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-25 04:50:30,879 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-25 04:50:30,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-03-25 04:50:30,898 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-25 04:50:30,898 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:30,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 04:50:30,902 INFO L142 LiptonReduction]: Number of co-enabled transitions 1578 [2021-03-25 04:50:32,188 WARN L205 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2021-03-25 04:50:32,540 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 04:50:34,168 WARN L205 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-25 04:50:34,815 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 04:50:35,345 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:50:35,797 WARN L205 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 04:50:35,922 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:50:36,706 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:50:37,002 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:50:37,565 WARN L205 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 04:50:38,154 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 04:50:38,391 INFO L154 LiptonReduction]: Checked pairs total: 2725 [2021-03-25 04:50:38,392 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-25 04:50:38,393 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7525 [2021-03-25 04:50:38,401 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 04:50:38,401 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:38,401 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:38,401 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:38,402 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:38,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1719955494, now seen corresponding path program 1 times [2021-03-25 04:50:38,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:38,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830982021] [2021-03-25 04:50:38,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:38,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:38,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:38,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:38,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:38,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830982021] [2021-03-25 04:50:38,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:38,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:50:38,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213629348] [2021-03-25 04:50:38,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:50:38,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:50:38,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:50:38,671 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 164 [2021-03-25 04:50:38,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:38,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:38,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 164 [2021-03-25 04:50:38,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:38,727 INFO L129 PetriNetUnfolder]: 23/90 cut-off events. [2021-03-25 04:50:38,727 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:38,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 90 events. 23/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 305 event pairs, 3 based on Foata normal form. 5/87 useless extension candidates. Maximal degree in co-relation 129. Up to 37 conditions per place. [2021-03-25 04:50:38,729 INFO L132 encePairwiseOnDemand]: 160/164 looper letters, 7 selfloop transitions, 2 changer transitions 3/37 dead transitions. [2021-03-25 04:50:38,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 105 flow [2021-03-25 04:50:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:50:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:50:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2021-03-25 04:50:38,740 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8882113821138211 [2021-03-25 04:50:38,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2021-03-25 04:50:38,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2021-03-25 04:50:38,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:38,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2021-03-25 04:50:38,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:38,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:38,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:38,761 INFO L185 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 437 transitions. [2021-03-25 04:50:38,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 105 flow [2021-03-25 04:50:38,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 04:50:38,765 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 72 flow [2021-03-25 04:50:38,766 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-25 04:50:38,767 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2021-03-25 04:50:38,767 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:38,767 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 72 flow [2021-03-25 04:50:38,768 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 72 flow [2021-03-25 04:50:38,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 72 flow [2021-03-25 04:50:38,779 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-03-25 04:50:38,779 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:38,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:50:38,781 INFO L142 LiptonReduction]: Number of co-enabled transitions 230 [2021-03-25 04:50:39,208 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 04:50:39,555 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 04:50:40,185 WARN L205 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:50:40,788 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:50:41,366 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-25 04:50:41,527 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-25 04:50:41,582 INFO L154 LiptonReduction]: Checked pairs total: 1024 [2021-03-25 04:50:41,582 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-25 04:50:41,583 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2816 [2021-03-25 04:50:41,583 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-03-25 04:50:41,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:41,584 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:41,584 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:41,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:50:41,584 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash 236066665, now seen corresponding path program 1 times [2021-03-25 04:50:41,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:41,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402049630] [2021-03-25 04:50:41,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:41,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:41,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:41,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:41,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:41,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:41,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:50:41,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:41,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:50:41,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:41,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:50:41,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:41,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:41,772 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:50:41,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:50:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:41,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402049630] [2021-03-25 04:50:41,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:41,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 04:50:41,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559895841] [2021-03-25 04:50:41,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 04:50:41,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:41,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 04:50:41,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-03-25 04:50:41,783 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 173 [2021-03-25 04:50:41,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 8 states, 8 states have (on average 126.875) internal successors, (1015), 8 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:41,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:41,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 173 [2021-03-25 04:50:41,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:41,861 INFO L129 PetriNetUnfolder]: 28/80 cut-off events. [2021-03-25 04:50:41,861 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-25 04:50:41,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 80 events. 28/80 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 255 event pairs, 16 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 143. Up to 52 conditions per place. [2021-03-25 04:50:41,864 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 7 selfloop transitions, 8 changer transitions 0/29 dead transitions. [2021-03-25 04:50:41,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 100 flow [2021-03-25 04:50:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2021-03-25 04:50:41,870 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7514450867052023 [2021-03-25 04:50:41,870 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2021-03-25 04:50:41,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2021-03-25 04:50:41,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:41,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2021-03-25 04:50:41,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:41,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:41,874 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:41,874 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 4 states and 520 transitions. [2021-03-25 04:50:41,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 100 flow [2021-03-25 04:50:41,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:50:41,875 INFO L241 Difference]: Finished difference. Result has 34 places, 28 transitions, 100 flow [2021-03-25 04:50:41,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2021-03-25 04:50:41,875 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -11 predicate places. [2021-03-25 04:50:41,875 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:41,875 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 100 flow [2021-03-25 04:50:41,876 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 100 flow [2021-03-25 04:50:41,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 100 flow [2021-03-25 04:50:41,883 INFO L129 PetriNetUnfolder]: 13/56 cut-off events. [2021-03-25 04:50:41,884 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 04:50:41,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 56 events. 13/56 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 153 event pairs, 4 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 100. Up to 22 conditions per place. [2021-03-25 04:50:41,884 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-25 04:50:42,177 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 04:50:42,334 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 04:50:42,604 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 04:50:42,731 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 04:50:42,736 INFO L154 LiptonReduction]: Checked pairs total: 404 [2021-03-25 04:50:42,736 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:50:42,736 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 861 [2021-03-25 04:50:42,736 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 96 flow [2021-03-25 04:50:42,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 126.875) internal successors, (1015), 8 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:42,737 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:42,737 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:42,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:50:42,738 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:42,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:42,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2078084844, now seen corresponding path program 1 times [2021-03-25 04:50:42,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:42,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962177275] [2021-03-25 04:50:42,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:42,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:42,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:42,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962177275] [2021-03-25 04:50:42,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:42,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:50:42,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932312246] [2021-03-25 04:50:42,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:50:42,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:42,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:50:42,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:50:42,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 174 [2021-03-25 04:50:42,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:42,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:42,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 174 [2021-03-25 04:50:42,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:42,841 INFO L129 PetriNetUnfolder]: 34/95 cut-off events. [2021-03-25 04:50:42,841 INFO L130 PetriNetUnfolder]: For 40/48 co-relation queries the response was YES. [2021-03-25 04:50:42,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 95 events. 34/95 cut-off events. For 40/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 345 event pairs, 9 based on Foata normal form. 4/84 useless extension candidates. Maximal degree in co-relation 207. Up to 41 conditions per place. [2021-03-25 04:50:42,842 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 4 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-25 04:50:42,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 114 flow [2021-03-25 04:50:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:50:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:50:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-25 04:50:42,845 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8812260536398467 [2021-03-25 04:50:42,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-25 04:50:42,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-25 04:50:42,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:42,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-25 04:50:42,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:42,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:42,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:42,847 INFO L185 Difference]: Start difference. First operand has 33 places, 27 transitions, 96 flow. Second operand 3 states and 460 transitions. [2021-03-25 04:50:42,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 114 flow [2021-03-25 04:50:42,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 112 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-25 04:50:42,849 INFO L241 Difference]: Finished difference. Result has 36 places, 29 transitions, 115 flow [2021-03-25 04:50:42,849 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2021-03-25 04:50:42,849 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2021-03-25 04:50:42,849 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:42,849 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 115 flow [2021-03-25 04:50:42,850 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 115 flow [2021-03-25 04:50:42,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 115 flow [2021-03-25 04:50:42,860 INFO L129 PetriNetUnfolder]: 21/76 cut-off events. [2021-03-25 04:50:42,860 INFO L130 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2021-03-25 04:50:42,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 76 events. 21/76 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 283 event pairs, 7 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 165. Up to 31 conditions per place. [2021-03-25 04:50:42,862 INFO L142 LiptonReduction]: Number of co-enabled transitions 300 [2021-03-25 04:50:42,864 INFO L154 LiptonReduction]: Checked pairs total: 110 [2021-03-25 04:50:42,864 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:42,864 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-25 04:50:42,865 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 115 flow [2021-03-25 04:50:42,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:42,865 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:42,865 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:42,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:50:42,865 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:42,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1452036730, now seen corresponding path program 1 times [2021-03-25 04:50:42,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:42,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052365460] [2021-03-25 04:50:42,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:42,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:42,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:42,968 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 04:50:42,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 04:50:42,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:42,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:50:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:43,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052365460] [2021-03-25 04:50:43,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:43,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:43,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640552379] [2021-03-25 04:50:43,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:43,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:43,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:43,014 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 174 [2021-03-25 04:50:43,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:43,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 174 [2021-03-25 04:50:43,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:43,073 INFO L129 PetriNetUnfolder]: 57/138 cut-off events. [2021-03-25 04:50:43,073 INFO L130 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2021-03-25 04:50:43,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 138 events. 57/138 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 585 event pairs, 33 based on Foata normal form. 2/127 useless extension candidates. Maximal degree in co-relation 365. Up to 90 conditions per place. [2021-03-25 04:50:43,075 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 8 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2021-03-25 04:50:43,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 150 flow [2021-03-25 04:50:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2021-03-25 04:50:43,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.75 [2021-03-25 04:50:43,077 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2021-03-25 04:50:43,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2021-03-25 04:50:43,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:43,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2021-03-25 04:50:43,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,081 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,081 INFO L185 Difference]: Start difference. First operand has 36 places, 29 transitions, 115 flow. Second operand 4 states and 522 transitions. [2021-03-25 04:50:43,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 150 flow [2021-03-25 04:50:43,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 147 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:50:43,082 INFO L241 Difference]: Finished difference. Result has 39 places, 30 transitions, 138 flow [2021-03-25 04:50:43,083 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2021-03-25 04:50:43,083 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2021-03-25 04:50:43,083 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:43,083 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 138 flow [2021-03-25 04:50:43,083 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 138 flow [2021-03-25 04:50:43,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 138 flow [2021-03-25 04:50:43,092 INFO L129 PetriNetUnfolder]: 18/66 cut-off events. [2021-03-25 04:50:43,092 INFO L130 PetriNetUnfolder]: For 63/66 co-relation queries the response was YES. [2021-03-25 04:50:43,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 66 events. 18/66 cut-off events. For 63/66 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 231 event pairs, 6 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 173. Up to 26 conditions per place. [2021-03-25 04:50:43,094 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-25 04:50:43,096 INFO L154 LiptonReduction]: Checked pairs total: 133 [2021-03-25 04:50:43,096 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:43,096 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-25 04:50:43,097 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 138 flow [2021-03-25 04:50:43,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,097 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:43,097 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:43,097 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:50:43,097 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:43,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:43,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1038637903, now seen corresponding path program 1 times [2021-03-25 04:50:43,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:43,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058824204] [2021-03-25 04:50:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:43,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:43,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:43,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:43,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:50:43,158 INFO L142 QuantifierPusher]: treesize reduction 12, result has 47.8 percent of original size [2021-03-25 04:50:43,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:50:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:43,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058824204] [2021-03-25 04:50:43,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:43,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:43,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303271377] [2021-03-25 04:50:43,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:43,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:43,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:43,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:43,168 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 174 [2021-03-25 04:50:43,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:43,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 174 [2021-03-25 04:50:43,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:43,232 INFO L129 PetriNetUnfolder]: 52/132 cut-off events. [2021-03-25 04:50:43,232 INFO L130 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2021-03-25 04:50:43,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 132 events. 52/132 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 561 event pairs, 13 based on Foata normal form. 2/125 useless extension candidates. Maximal degree in co-relation 397. Up to 73 conditions per place. [2021-03-25 04:50:43,233 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 14 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2021-03-25 04:50:43,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 206 flow [2021-03-25 04:50:43,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:50:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:50:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 681 transitions. [2021-03-25 04:50:43,236 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7827586206896552 [2021-03-25 04:50:43,236 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 681 transitions. [2021-03-25 04:50:43,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 681 transitions. [2021-03-25 04:50:43,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:43,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 681 transitions. [2021-03-25 04:50:43,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,240 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,240 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 138 flow. Second operand 5 states and 681 transitions. [2021-03-25 04:50:43,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 206 flow [2021-03-25 04:50:43,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:50:43,242 INFO L241 Difference]: Finished difference. Result has 42 places, 32 transitions, 154 flow [2021-03-25 04:50:43,243 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2021-03-25 04:50:43,243 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2021-03-25 04:50:43,243 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:43,243 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 154 flow [2021-03-25 04:50:43,243 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 154 flow [2021-03-25 04:50:43,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 154 flow [2021-03-25 04:50:43,255 INFO L129 PetriNetUnfolder]: 25/83 cut-off events. [2021-03-25 04:50:43,255 INFO L130 PetriNetUnfolder]: For 165/172 co-relation queries the response was YES. [2021-03-25 04:50:43,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 83 events. 25/83 cut-off events. For 165/172 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 317 event pairs, 7 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 241. Up to 32 conditions per place. [2021-03-25 04:50:43,256 INFO L142 LiptonReduction]: Number of co-enabled transitions 322 [2021-03-25 04:50:43,259 INFO L154 LiptonReduction]: Checked pairs total: 150 [2021-03-25 04:50:43,259 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:43,259 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-25 04:50:43,260 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 154 flow [2021-03-25 04:50:43,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,260 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:43,260 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:43,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:50:43,260 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:43,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:43,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2133004166, now seen corresponding path program 1 times [2021-03-25 04:50:43,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:43,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308638014] [2021-03-25 04:50:43,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:43,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:43,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:50:43,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:43,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:43,326 INFO L142 QuantifierPusher]: treesize reduction 11, result has 50.0 percent of original size [2021-03-25 04:50:43,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:50:43,335 INFO L142 QuantifierPusher]: treesize reduction 11, result has 56.0 percent of original size [2021-03-25 04:50:43,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:50:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:43,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308638014] [2021-03-25 04:50:43,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:43,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:50:43,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478812428] [2021-03-25 04:50:43,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:50:43,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:43,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:50:43,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:50:43,349 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 174 [2021-03-25 04:50:43,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:43,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 174 [2021-03-25 04:50:43,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:43,450 INFO L129 PetriNetUnfolder]: 45/127 cut-off events. [2021-03-25 04:50:43,450 INFO L130 PetriNetUnfolder]: For 196/196 co-relation queries the response was YES. [2021-03-25 04:50:43,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 127 events. 45/127 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 530 event pairs, 1 based on Foata normal form. 2/120 useless extension candidates. Maximal degree in co-relation 407. Up to 52 conditions per place. [2021-03-25 04:50:43,452 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 13 selfloop transitions, 10 changer transitions 0/39 dead transitions. [2021-03-25 04:50:43,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 238 flow [2021-03-25 04:50:43,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:50:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:50:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions. [2021-03-25 04:50:43,455 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7662835249042146 [2021-03-25 04:50:43,455 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 800 transitions. [2021-03-25 04:50:43,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions. [2021-03-25 04:50:43,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:43,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions. [2021-03-25 04:50:43,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,459 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,460 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 154 flow. Second operand 6 states and 800 transitions. [2021-03-25 04:50:43,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 238 flow [2021-03-25 04:50:43,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 229 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:50:43,465 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 187 flow [2021-03-25 04:50:43,465 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-25 04:50:43,465 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2021-03-25 04:50:43,465 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:43,465 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 187 flow [2021-03-25 04:50:43,465 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 187 flow [2021-03-25 04:50:43,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 34 transitions, 187 flow [2021-03-25 04:50:43,480 INFO L129 PetriNetUnfolder]: 26/81 cut-off events. [2021-03-25 04:50:43,480 INFO L130 PetriNetUnfolder]: For 195/200 co-relation queries the response was YES. [2021-03-25 04:50:43,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 81 events. 26/81 cut-off events. For 195/200 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 296 event pairs, 7 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 263. Up to 31 conditions per place. [2021-03-25 04:50:43,481 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-25 04:50:43,486 INFO L154 LiptonReduction]: Checked pairs total: 177 [2021-03-25 04:50:43,487 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:43,487 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-25 04:50:43,489 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 187 flow [2021-03-25 04:50:43,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,490 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:43,490 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:43,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:50:43,490 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:43,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:43,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1867740210, now seen corresponding path program 1 times [2021-03-25 04:50:43,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:43,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104873138] [2021-03-25 04:50:43,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:43,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:43,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:50:43,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:43,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:50:43,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:43,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:50:43,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:43,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:43,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104873138] [2021-03-25 04:50:43,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:43,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:43,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363412329] [2021-03-25 04:50:43,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:43,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:43,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:43,652 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 174 [2021-03-25 04:50:43,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:43,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 174 [2021-03-25 04:50:43,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:43,720 INFO L129 PetriNetUnfolder]: 39/131 cut-off events. [2021-03-25 04:50:43,720 INFO L130 PetriNetUnfolder]: For 301/301 co-relation queries the response was YES. [2021-03-25 04:50:43,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 131 events. 39/131 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 600 event pairs, 6 based on Foata normal form. 8/130 useless extension candidates. Maximal degree in co-relation 444. Up to 50 conditions per place. [2021-03-25 04:50:43,724 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 13 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2021-03-25 04:50:43,724 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 237 flow [2021-03-25 04:50:43,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2021-03-25 04:50:43,726 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7816091954022989 [2021-03-25 04:50:43,726 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2021-03-25 04:50:43,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2021-03-25 04:50:43,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:43,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2021-03-25 04:50:43,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,729 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,729 INFO L185 Difference]: Start difference. First operand has 46 places, 34 transitions, 187 flow. Second operand 4 states and 544 transitions. [2021-03-25 04:50:43,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 237 flow [2021-03-25 04:50:43,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 219 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 04:50:43,733 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 191 flow [2021-03-25 04:50:43,733 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-25 04:50:43,733 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2021-03-25 04:50:43,733 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:43,733 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 191 flow [2021-03-25 04:50:43,733 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 191 flow [2021-03-25 04:50:43,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 34 transitions, 191 flow [2021-03-25 04:50:43,747 INFO L129 PetriNetUnfolder]: 16/75 cut-off events. [2021-03-25 04:50:43,748 INFO L130 PetriNetUnfolder]: For 196/199 co-relation queries the response was YES. [2021-03-25 04:50:43,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 75 events. 16/75 cut-off events. For 196/199 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 255 event pairs, 5 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 229. Up to 24 conditions per place. [2021-03-25 04:50:43,749 INFO L142 LiptonReduction]: Number of co-enabled transitions 340 [2021-03-25 04:50:43,752 INFO L154 LiptonReduction]: Checked pairs total: 171 [2021-03-25 04:50:43,752 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:43,752 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-25 04:50:43,753 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 191 flow [2021-03-25 04:50:43,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,753 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:43,753 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:43,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:50:43,753 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:43,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1204777379, now seen corresponding path program 1 times [2021-03-25 04:50:43,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:43,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127805103] [2021-03-25 04:50:43,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:43,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:43,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:43,850 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:50:43,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:50:43,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:43,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:43,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127805103] [2021-03-25 04:50:43,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:43,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:43,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428376038] [2021-03-25 04:50:43,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:50:43,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:50:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:50:43,860 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 174 [2021-03-25 04:50:43,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:43,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 174 [2021-03-25 04:50:43,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:43,934 INFO L129 PetriNetUnfolder]: 139/322 cut-off events. [2021-03-25 04:50:43,934 INFO L130 PetriNetUnfolder]: For 458/553 co-relation queries the response was YES. [2021-03-25 04:50:43,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 322 events. 139/322 cut-off events. For 458/553 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 1838 event pairs, 53 based on Foata normal form. 41/294 useless extension candidates. Maximal degree in co-relation 877. Up to 195 conditions per place. [2021-03-25 04:50:43,937 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 11 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2021-03-25 04:50:43,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 251 flow [2021-03-25 04:50:43,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:50:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:50:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 720 transitions. [2021-03-25 04:50:43,940 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2021-03-25 04:50:43,940 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 720 transitions. [2021-03-25 04:50:43,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 720 transitions. [2021-03-25 04:50:43,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:43,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 720 transitions. [2021-03-25 04:50:43,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,944 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,944 INFO L185 Difference]: Start difference. First operand has 46 places, 34 transitions, 191 flow. Second operand 5 states and 720 transitions. [2021-03-25 04:50:43,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 251 flow [2021-03-25 04:50:43,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 239 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 04:50:43,948 INFO L241 Difference]: Finished difference. Result has 51 places, 41 transitions, 243 flow [2021-03-25 04:50:43,948 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2021-03-25 04:50:43,948 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2021-03-25 04:50:43,948 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:43,948 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 243 flow [2021-03-25 04:50:43,949 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 243 flow [2021-03-25 04:50:43,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 243 flow [2021-03-25 04:50:43,976 INFO L129 PetriNetUnfolder]: 98/232 cut-off events. [2021-03-25 04:50:43,977 INFO L130 PetriNetUnfolder]: For 452/509 co-relation queries the response was YES. [2021-03-25 04:50:43,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 232 events. 98/232 cut-off events. For 452/509 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1209 event pairs, 35 based on Foata normal form. 5/204 useless extension candidates. Maximal degree in co-relation 772. Up to 137 conditions per place. [2021-03-25 04:50:43,980 INFO L142 LiptonReduction]: Number of co-enabled transitions 430 [2021-03-25 04:50:43,985 INFO L154 LiptonReduction]: Checked pairs total: 106 [2021-03-25 04:50:43,985 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:43,986 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-25 04:50:43,988 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 243 flow [2021-03-25 04:50:43,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:43,989 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:43,989 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:43,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:50:43,989 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:43,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:43,990 INFO L82 PathProgramCache]: Analyzing trace with hash 583779411, now seen corresponding path program 1 times [2021-03-25 04:50:43,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:43,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568268760] [2021-03-25 04:50:43,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:44,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:44,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:44,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:44,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:44,059 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:50:44,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:50:44,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:44,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:44,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568268760] [2021-03-25 04:50:44,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:44,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:50:44,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807501504] [2021-03-25 04:50:44,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:44,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:44,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:44,069 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 174 [2021-03-25 04:50:44,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:44,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 174 [2021-03-25 04:50:44,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:44,150 INFO L129 PetriNetUnfolder]: 96/249 cut-off events. [2021-03-25 04:50:44,150 INFO L130 PetriNetUnfolder]: For 676/1561 co-relation queries the response was YES. [2021-03-25 04:50:44,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 249 events. 96/249 cut-off events. For 676/1561 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1321 event pairs, 6 based on Foata normal form. 110/324 useless extension candidates. Maximal degree in co-relation 915. Up to 152 conditions per place. [2021-03-25 04:50:44,152 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 8 selfloop transitions, 15 changer transitions 3/50 dead transitions. [2021-03-25 04:50:44,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 332 flow [2021-03-25 04:50:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:50:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:50:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1008 transitions. [2021-03-25 04:50:44,156 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2021-03-25 04:50:44,156 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1008 transitions. [2021-03-25 04:50:44,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1008 transitions. [2021-03-25 04:50:44,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:44,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1008 transitions. [2021-03-25 04:50:44,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,161 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,161 INFO L185 Difference]: Start difference. First operand has 51 places, 41 transitions, 243 flow. Second operand 7 states and 1008 transitions. [2021-03-25 04:50:44,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 332 flow [2021-03-25 04:50:44,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 320 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 04:50:44,165 INFO L241 Difference]: Finished difference. Result has 57 places, 45 transitions, 305 flow [2021-03-25 04:50:44,166 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2021-03-25 04:50:44,166 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2021-03-25 04:50:44,166 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:44,166 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 45 transitions, 305 flow [2021-03-25 04:50:44,166 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 45 transitions, 305 flow [2021-03-25 04:50:44,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 305 flow [2021-03-25 04:50:44,182 INFO L129 PetriNetUnfolder]: 49/153 cut-off events. [2021-03-25 04:50:44,182 INFO L130 PetriNetUnfolder]: For 576/740 co-relation queries the response was YES. [2021-03-25 04:50:44,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 153 events. 49/153 cut-off events. For 576/740 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 758 event pairs, 7 based on Foata normal form. 4/142 useless extension candidates. Maximal degree in co-relation 636. Up to 94 conditions per place. [2021-03-25 04:50:44,184 INFO L142 LiptonReduction]: Number of co-enabled transitions 464 [2021-03-25 04:50:44,387 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 04:50:44,769 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 04:50:44,872 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 04:50:44,881 INFO L154 LiptonReduction]: Checked pairs total: 220 [2021-03-25 04:50:44,881 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:50:44,881 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 715 [2021-03-25 04:50:44,881 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 293 flow [2021-03-25 04:50:44,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,882 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:44,882 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:44,882 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:50:44,882 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash -121288443, now seen corresponding path program 1 times [2021-03-25 04:50:44,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:44,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960704088] [2021-03-25 04:50:44,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:44,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:44,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:44,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:44,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:44,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960704088] [2021-03-25 04:50:44,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:44,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:50:44,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31411614] [2021-03-25 04:50:44,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:50:44,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:44,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:50:44,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:50:44,915 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 175 [2021-03-25 04:50:44,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:44,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 175 [2021-03-25 04:50:44,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:44,942 INFO L129 PetriNetUnfolder]: 55/169 cut-off events. [2021-03-25 04:50:44,942 INFO L130 PetriNetUnfolder]: For 661/725 co-relation queries the response was YES. [2021-03-25 04:50:44,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 169 events. 55/169 cut-off events. For 661/725 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 799 event pairs, 10 based on Foata normal form. 9/165 useless extension candidates. Maximal degree in co-relation 687. Up to 96 conditions per place. [2021-03-25 04:50:44,943 INFO L132 encePairwiseOnDemand]: 172/175 looper letters, 3 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2021-03-25 04:50:44,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 37 transitions, 248 flow [2021-03-25 04:50:44,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:50:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:50:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2021-03-25 04:50:44,945 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.88 [2021-03-25 04:50:44,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2021-03-25 04:50:44,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2021-03-25 04:50:44,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:44,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2021-03-25 04:50:44,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,948 INFO L185 Difference]: Start difference. First operand has 57 places, 43 transitions, 293 flow. Second operand 3 states and 462 transitions. [2021-03-25 04:50:44,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 37 transitions, 248 flow [2021-03-25 04:50:44,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 37 transitions, 224 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-25 04:50:44,951 INFO L241 Difference]: Finished difference. Result has 51 places, 37 transitions, 223 flow [2021-03-25 04:50:44,951 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2021-03-25 04:50:44,951 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2021-03-25 04:50:44,951 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:44,951 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 223 flow [2021-03-25 04:50:44,951 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 223 flow [2021-03-25 04:50:44,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 37 transitions, 223 flow [2021-03-25 04:50:44,968 INFO L129 PetriNetUnfolder]: 55/169 cut-off events. [2021-03-25 04:50:44,968 INFO L130 PetriNetUnfolder]: For 349/367 co-relation queries the response was YES. [2021-03-25 04:50:44,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 169 events. 55/169 cut-off events. For 349/367 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 784 event pairs, 10 based on Foata normal form. 1/159 useless extension candidates. Maximal degree in co-relation 569. Up to 68 conditions per place. [2021-03-25 04:50:44,970 INFO L142 LiptonReduction]: Number of co-enabled transitions 308 [2021-03-25 04:50:44,973 INFO L154 LiptonReduction]: Checked pairs total: 94 [2021-03-25 04:50:44,973 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:44,974 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-25 04:50:44,975 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 223 flow [2021-03-25 04:50:44,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,975 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:44,975 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:44,976 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:50:44,976 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash -938455343, now seen corresponding path program 1 times [2021-03-25 04:50:44,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:44,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100867770] [2021-03-25 04:50:44,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:45,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:45,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:45,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:45,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:45,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:45,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:45,043 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:50:45,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:50:45,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:45,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:45,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100867770] [2021-03-25 04:50:45,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:45,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:50:45,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369480008] [2021-03-25 04:50:45,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:50:45,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:45,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:50:45,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:50:45,055 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 175 [2021-03-25 04:50:45,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:45,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 175 [2021-03-25 04:50:45,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:45,122 INFO L129 PetriNetUnfolder]: 87/207 cut-off events. [2021-03-25 04:50:45,122 INFO L130 PetriNetUnfolder]: For 337/629 co-relation queries the response was YES. [2021-03-25 04:50:45,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 207 events. 87/207 cut-off events. For 337/629 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 953 event pairs, 0 based on Foata normal form. 56/233 useless extension candidates. Maximal degree in co-relation 756. Up to 93 conditions per place. [2021-03-25 04:50:45,124 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 5 selfloop transitions, 11 changer transitions 6/44 dead transitions. [2021-03-25 04:50:45,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 299 flow [2021-03-25 04:50:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:50:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:50:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1009 transitions. [2021-03-25 04:50:45,127 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8236734693877551 [2021-03-25 04:50:45,127 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1009 transitions. [2021-03-25 04:50:45,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1009 transitions. [2021-03-25 04:50:45,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:45,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1009 transitions. [2021-03-25 04:50:45,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.14285714285714) internal successors, (1009), 7 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,132 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,132 INFO L185 Difference]: Start difference. First operand has 51 places, 37 transitions, 223 flow. Second operand 7 states and 1009 transitions. [2021-03-25 04:50:45,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 299 flow [2021-03-25 04:50:45,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 44 transitions, 272 flow, removed 12 selfloop flow, removed 1 redundant places. [2021-03-25 04:50:45,134 INFO L241 Difference]: Finished difference. Result has 59 places, 36 transitions, 234 flow [2021-03-25 04:50:45,134 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=59, PETRI_TRANSITIONS=36} [2021-03-25 04:50:45,135 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2021-03-25 04:50:45,135 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:45,135 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 36 transitions, 234 flow [2021-03-25 04:50:45,135 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 36 transitions, 234 flow [2021-03-25 04:50:45,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 36 transitions, 234 flow [2021-03-25 04:50:45,142 INFO L129 PetriNetUnfolder]: 14/64 cut-off events. [2021-03-25 04:50:45,142 INFO L130 PetriNetUnfolder]: For 128/146 co-relation queries the response was YES. [2021-03-25 04:50:45,142 INFO L84 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 64 events. 14/64 cut-off events. For 128/146 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 177 event pairs, 0 based on Foata normal form. 2/64 useless extension candidates. Maximal degree in co-relation 229. Up to 24 conditions per place. [2021-03-25 04:50:45,143 INFO L142 LiptonReduction]: Number of co-enabled transitions 200 [2021-03-25 04:50:45,517 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:50:45,632 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:50:46,237 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 180 [2021-03-25 04:50:46,438 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2021-03-25 04:50:47,796 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 334 DAG size of output: 262 [2021-03-25 04:50:48,280 WARN L205 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-25 04:50:48,527 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 04:50:48,748 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 04:50:49,288 WARN L205 SmtUtils]: Spent 538.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 04:50:49,846 WARN L205 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 04:50:49,853 INFO L154 LiptonReduction]: Checked pairs total: 172 [2021-03-25 04:50:49,853 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-25 04:50:49,853 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4718 [2021-03-25 04:50:49,854 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 222 flow [2021-03-25 04:50:49,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:49,854 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:49,854 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:49,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:50:49,854 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1270824270, now seen corresponding path program 1 times [2021-03-25 04:50:49,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:49,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189710423] [2021-03-25 04:50:49,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:49,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:49,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:49,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:49,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:49,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:49,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:49,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189710423] [2021-03-25 04:50:49,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:49,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:49,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653049997] [2021-03-25 04:50:49,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:50:49,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:49,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:50:49,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:50:49,902 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 182 [2021-03-25 04:50:49,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 31 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:49,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:49,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 182 [2021-03-25 04:50:49,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:49,930 INFO L129 PetriNetUnfolder]: 26/87 cut-off events. [2021-03-25 04:50:49,930 INFO L130 PetriNetUnfolder]: For 363/387 co-relation queries the response was YES. [2021-03-25 04:50:49,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 87 events. 26/87 cut-off events. For 363/387 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 305 event pairs, 0 based on Foata normal form. 7/90 useless extension candidates. Maximal degree in co-relation 337. Up to 41 conditions per place. [2021-03-25 04:50:49,931 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 3 selfloop transitions, 1 changer transitions 7/32 dead transitions. [2021-03-25 04:50:49,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 32 transitions, 234 flow [2021-03-25 04:50:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 602 transitions. [2021-03-25 04:50:49,933 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2021-03-25 04:50:49,933 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 602 transitions. [2021-03-25 04:50:49,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 602 transitions. [2021-03-25 04:50:49,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:49,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 602 transitions. [2021-03-25 04:50:49,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:49,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:49,936 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:49,936 INFO L185 Difference]: Start difference. First operand has 53 places, 31 transitions, 222 flow. Second operand 4 states and 602 transitions. [2021-03-25 04:50:49,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 32 transitions, 234 flow [2021-03-25 04:50:49,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 32 transitions, 185 flow, removed 12 selfloop flow, removed 10 redundant places. [2021-03-25 04:50:49,938 INFO L241 Difference]: Finished difference. Result has 48 places, 25 transitions, 137 flow [2021-03-25 04:50:49,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=25} [2021-03-25 04:50:49,939 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2021-03-25 04:50:49,939 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:49,939 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 25 transitions, 137 flow [2021-03-25 04:50:49,939 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 25 transitions, 137 flow [2021-03-25 04:50:49,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 25 transitions, 137 flow [2021-03-25 04:50:49,944 INFO L129 PetriNetUnfolder]: 8/38 cut-off events. [2021-03-25 04:50:49,944 INFO L130 PetriNetUnfolder]: For 57/59 co-relation queries the response was YES. [2021-03-25 04:50:49,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 38 events. 8/38 cut-off events. For 57/59 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 0 based on Foata normal form. 2/39 useless extension candidates. Maximal degree in co-relation 105. Up to 12 conditions per place. [2021-03-25 04:50:49,944 INFO L142 LiptonReduction]: Number of co-enabled transitions 76 [2021-03-25 04:50:50,271 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-25 04:50:50,672 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-03-25 04:50:50,796 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:50:50,799 INFO L154 LiptonReduction]: Checked pairs total: 26 [2021-03-25 04:50:50,799 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:50:50,799 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 860 [2021-03-25 04:50:50,799 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 24 transitions, 142 flow [2021-03-25 04:50:50,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:50,800 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:50,800 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:50,800 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:50:50,800 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:50,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:50,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2120000692, now seen corresponding path program 1 times [2021-03-25 04:50:50,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:50,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588766650] [2021-03-25 04:50:50,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:50:50,824 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:50:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:50:50,847 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:50:50,870 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:50:50,870 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:50:50,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:50:50,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:50:50 BasicIcfg [2021-03-25 04:50:50,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:50:50,922 INFO L168 Benchmark]: Toolchain (without parser) took 22620.28 ms. Allocated memory was 255.9 MB in the beginning and 658.5 MB in the end (delta: 402.7 MB). Free memory was 234.1 MB in the beginning and 428.1 MB in the end (delta: -194.0 MB). Peak memory consumption was 208.7 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:50,922 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:50:50,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 617.06 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 233.6 MB in the beginning and 316.9 MB in the end (delta: -83.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:50,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.40 ms. Allocated memory is still 356.5 MB. Free memory was 316.9 MB in the beginning and 314.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:50,923 INFO L168 Benchmark]: Boogie Preprocessor took 34.57 ms. Allocated memory is still 356.5 MB. Free memory was 314.0 MB in the beginning and 311.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:50,923 INFO L168 Benchmark]: RCFGBuilder took 1650.98 ms. Allocated memory is still 356.5 MB. Free memory was 311.9 MB in the beginning and 270.6 MB in the end (delta: 41.4 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:50,923 INFO L168 Benchmark]: TraceAbstraction took 20235.92 ms. Allocated memory was 356.5 MB in the beginning and 658.5 MB in the end (delta: 302.0 MB). Free memory was 270.6 MB in the beginning and 428.1 MB in the end (delta: -157.5 MB). Peak memory consumption was 143.4 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:50,931 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.47 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 617.06 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 233.6 MB in the beginning and 316.9 MB in the end (delta: -83.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 75.40 ms. Allocated memory is still 356.5 MB. Free memory was 316.9 MB in the beginning and 314.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 34.57 ms. Allocated memory is still 356.5 MB. Free memory was 314.0 MB in the beginning and 311.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1650.98 ms. Allocated memory is still 356.5 MB. Free memory was 311.9 MB in the beginning and 270.6 MB in the end (delta: 41.4 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20235.92 ms. Allocated memory was 356.5 MB in the beginning and 658.5 MB in the end (delta: 302.0 MB). Free memory was 270.6 MB in the beginning and 428.1 MB in the end (delta: -157.5 MB). Peak memory consumption was 143.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7512.7ms, 101 PlacesBefore, 45 PlacesAfterwards, 93 TransitionsBefore, 36 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 2725 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1254, positive: 1173, positive conditional: 0, positive unconditional: 1173, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 791, positive: 769, positive conditional: 0, positive unconditional: 769, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 791, positive: 769, positive conditional: 0, positive unconditional: 769, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1254, positive: 404, positive conditional: 0, positive unconditional: 404, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 791, unknown conditional: 0, unknown unconditional: 791] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2814.7ms, 42 PlacesBefore, 31 PlacesAfterwards, 31 TransitionsBefore, 22 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 1024 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 226, positive: 147, positive conditional: 0, positive unconditional: 147, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 226, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 859.9ms, 34 PlacesBefore, 33 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 404 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 98, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.3ms, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 110 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 33, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.5ms, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 133 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 40, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.0ms, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 150 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 45, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.2ms, 46 PlacesBefore, 46 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 177 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 63, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.6ms, 46 PlacesBefore, 46 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 171 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 54, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.7ms, 51 PlacesBefore, 51 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 714.6ms, 57 PlacesBefore, 57 PlacesAfterwards, 45 TransitionsBefore, 43 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 91, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 91, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.0ms, 51 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 94 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 20, positive: 15, positive conditional: 0, positive unconditional: 15, 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): 73, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4718.3ms, 59 PlacesBefore, 53 PlacesAfterwards, 36 TransitionsBefore, 31 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 172 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 123, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 123, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 859.7ms, 48 PlacesBefore, 44 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 26 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1498; [L814] FCALL, FORK 0 pthread_create(&t1498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1499; [L816] FCALL, FORK 0 pthread_create(&t1499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1500; [L818] FCALL, FORK 0 pthread_create(&t1500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20086.8ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 932.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7608.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 44 SDtfs, 24 SDslu, 20 SDs, 0 SdLazy, 227 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 269.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 279.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=9, InterpolantAutomatonStates: 55, 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: 39.2ms SsaConstructionTime, 406.4ms SatisfiabilityAnalysisTime, 752.5ms InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...