/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/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:49:05,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:49:05,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:49:05,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:49:05,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:49:05,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:49:05,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:49:05,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:49:05,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:49:05,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:49:05,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:49:05,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:49:05,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:49:05,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:49:05,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:49:05,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:49:05,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:49:05,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:49:05,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:49:05,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:49:05,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:49:05,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:49:05,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:49:05,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:49:05,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:49:05,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:49:05,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:49:05,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:49:05,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:49:05,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:49:05,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:49:05,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:49:05,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:49:05,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:49:05,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:49:05,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:49:05,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:49:05,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:49:05,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:49:05,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:49:05,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:49:05,402 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:49:05,436 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:49:05,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:49:05,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:49:05,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:49:05,438 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:49:05,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:49:05,438 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:49:05,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:49:05,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:49:05,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:49:05,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:49:05,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:49:05,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:49:05,439 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:49:05,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:49:05,439 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:49:05,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:49:05,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:49:05,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:49:05,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:49:05,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:49:05,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:49:05,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:49:05,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:49:05,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:49:05,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:49:05,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:49:05,441 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:49:05,441 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:49:05,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:49:05,442 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:49:05,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:49:05,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:49:05,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:49:05,778 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:49:05,778 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:49:05,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2021-03-25 04:49:05,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c576ec082/46e8279e540144b49b4e3980f0161e24/FLAG5d2a51f05 [2021-03-25 04:49:06,354 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:49:06,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2021-03-25 04:49:06,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c576ec082/46e8279e540144b49b4e3980f0161e24/FLAG5d2a51f05 [2021-03-25 04:49:06,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c576ec082/46e8279e540144b49b4e3980f0161e24 [2021-03-25 04:49:06,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:49:06,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:49:06,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:49:06,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:49:06,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:49:06,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:49:06" (1/1) ... [2021-03-25 04:49:06,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c7570c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:06, skipping insertion in model container [2021-03-25 04:49:06,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:49:06" (1/1) ... [2021-03-25 04:49:06,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:49:06,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:49:07,048 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/mix052_tso.oepc.i[949,962] [2021-03-25 04:49:07,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:49:07,236 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:49:07,245 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/mix052_tso.oepc.i[949,962] [2021-03-25 04:49:07,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:49:07,346 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:49:07,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:07 WrapperNode [2021-03-25 04:49:07,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:49:07,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:49:07,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:49:07,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:49:07,354 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:49:07" (1/1) ... [2021-03-25 04:49:07,373 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:49:07" (1/1) ... [2021-03-25 04:49:07,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:49:07,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:49:07,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:49:07,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:49:07,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:07" (1/1) ... [2021-03-25 04:49:07,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:07" (1/1) ... [2021-03-25 04:49:07,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:07" (1/1) ... [2021-03-25 04:49:07,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:07" (1/1) ... [2021-03-25 04:49:07,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:07" (1/1) ... [2021-03-25 04:49:07,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:07" (1/1) ... [2021-03-25 04:49:07,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:07" (1/1) ... [2021-03-25 04:49:07,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:49:07,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:49:07,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:49:07,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:49:07,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:07" (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:49:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:49:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:49:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:49:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:49:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:49:07,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:49:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:49:07,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:49:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:49:07,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:49:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:49:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:49:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:49:07,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:49:07,547 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:49:09,078 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:49:09,078 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:49:09,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:49:09 BoogieIcfgContainer [2021-03-25 04:49:09,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:49:09,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:49:09,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:49:09,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:49:09,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:49:06" (1/3) ... [2021-03-25 04:49:09,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a50948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:49:09, skipping insertion in model container [2021-03-25 04:49:09,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:07" (2/3) ... [2021-03-25 04:49:09,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a50948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:49:09, skipping insertion in model container [2021-03-25 04:49:09,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:49:09" (3/3) ... [2021-03-25 04:49:09,087 INFO L111 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2021-03-25 04:49:09,092 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:49:09,095 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:49:09,096 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:49:09,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,128 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,128 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,128 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,128 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,133 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,133 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,136 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,136 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,141 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,141 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,142 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,142 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,148 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,152 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,154 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,162 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:09,164 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:49:09,178 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 04:49:09,195 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:49:09,195 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:49:09,195 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:49:09,195 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:49:09,195 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:49:09,195 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:49:09,196 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:49:09,196 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:49:09,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-25 04:49:09,238 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-25 04:49:09,239 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:49:09,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 04:49:09,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-25 04:49:09,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-25 04:49:09,251 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:09,257 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-25 04:49:09,260 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-25 04:49:09,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-25 04:49:09,280 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-25 04:49:09,280 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:49:09,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 04:49:09,283 INFO L142 LiptonReduction]: Number of co-enabled transitions 1686 [2021-03-25 04:49:10,189 WARN L205 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-03-25 04:49:10,565 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-25 04:49:11,933 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-25 04:49:12,592 WARN L205 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 04:49:13,475 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:49:13,885 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 04:49:14,009 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:49:14,919 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 04:49:15,208 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 04:49:15,757 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 04:49:16,337 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 04:49:16,553 INFO L154 LiptonReduction]: Checked pairs total: 3192 [2021-03-25 04:49:16,554 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-25 04:49:16,555 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7305 [2021-03-25 04:49:16,562 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-25 04:49:16,563 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:49:16,563 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:16,563 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:16,564 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:16,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:16,568 INFO L82 PathProgramCache]: Analyzing trace with hash 113873990, now seen corresponding path program 1 times [2021-03-25 04:49:16,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:16,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654852591] [2021-03-25 04:49:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:16,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:16,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:16,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:16,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:16,831 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:49:16,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654852591] [2021-03-25 04:49:16,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:16,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:49:16,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390390112] [2021-03-25 04:49:16,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:49:16,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:16,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:49:16,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:49:16,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 165 [2021-03-25 04:49:16,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 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:49:16,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:16,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 165 [2021-03-25 04:49:16,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:16,936 INFO L129 PetriNetUnfolder]: 69/185 cut-off events. [2021-03-25 04:49:16,937 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:49:16,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 185 events. 69/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 910 event pairs, 13 based on Foata normal form. 11/179 useless extension candidates. Maximal degree in co-relation 294. Up to 89 conditions per place. [2021-03-25 04:49:16,939 INFO L132 encePairwiseOnDemand]: 161/165 looper letters, 9 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2021-03-25 04:49:16,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 115 flow [2021-03-25 04:49:16,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:49:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:49:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2021-03-25 04:49:16,960 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8868686868686869 [2021-03-25 04:49:16,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2021-03-25 04:49:16,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2021-03-25 04:49:16,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:16,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2021-03-25 04:49:16,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 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:49:16,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 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:49:16,978 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 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:49:16,979 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 439 transitions. [2021-03-25 04:49:16,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 115 flow [2021-03-25 04:49:16,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 04:49:16,984 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 74 flow [2021-03-25 04:49:16,985 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2021-03-25 04:49:16,986 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-25 04:49:16,986 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:16,986 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 74 flow [2021-03-25 04:49:16,987 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 74 flow [2021-03-25 04:49:16,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-25 04:49:16,992 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 04:49:16,992 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:49:16,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:49:16,993 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-25 04:49:17,407 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:49:17,698 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:49:18,371 WARN L205 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:49:18,940 WARN L205 SmtUtils]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:49:19,493 INFO L154 LiptonReduction]: Checked pairs total: 1218 [2021-03-25 04:49:19,493 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-25 04:49:19,493 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2507 [2021-03-25 04:49:19,494 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-25 04:49:19,494 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:49:19,494 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:19,495 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:49:19,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:49:19,495 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash 884818913, now seen corresponding path program 1 times [2021-03-25 04:49:19,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:19,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874950258] [2021-03-25 04:49:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:19,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:19,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:19,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:19,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:19,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:19,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:49:19,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:19,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:49:19,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:19,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:49:19,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:19,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:49:19,692 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:49:19,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:49:19,700 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:49:19,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874950258] [2021-03-25 04:49:19,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:19,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 04:49:19,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119388057] [2021-03-25 04:49:19,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 04:49:19,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:19,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 04:49:19,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-03-25 04:49:19,705 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 173 [2021-03-25 04:49:19,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 8 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 0 states have call successors, (0), 0 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:49:19,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:19,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 173 [2021-03-25 04:49:19,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:19,803 INFO L129 PetriNetUnfolder]: 84/175 cut-off events. [2021-03-25 04:49:19,803 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-25 04:49:19,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 175 events. 84/175 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 763 event pairs, 52 based on Foata normal form. 2/170 useless extension candidates. Maximal degree in co-relation 329. Up to 131 conditions per place. [2021-03-25 04:49:19,807 INFO L132 encePairwiseOnDemand]: 165/173 looper letters, 9 selfloop transitions, 9 changer transitions 0/33 dead transitions. [2021-03-25 04:49:19,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 114 flow [2021-03-25 04:49:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:49:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:49:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2021-03-25 04:49:19,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7615606936416185 [2021-03-25 04:49:19,809 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 527 transitions. [2021-03-25 04:49:19,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 527 transitions. [2021-03-25 04:49:19,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:19,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 527 transitions. [2021-03-25 04:49:19,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 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:49:19,813 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:49:19,813 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:49:19,813 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 4 states and 527 transitions. [2021-03-25 04:49:19,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 114 flow [2021-03-25 04:49:19,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:49:19,815 INFO L241 Difference]: Finished difference. Result has 36 places, 31 transitions, 111 flow [2021-03-25 04:49:19,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2021-03-25 04:49:19,815 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -11 predicate places. [2021-03-25 04:49:19,815 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:19,815 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 111 flow [2021-03-25 04:49:19,816 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 111 flow [2021-03-25 04:49:19,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 111 flow [2021-03-25 04:49:19,850 INFO L129 PetriNetUnfolder]: 27/99 cut-off events. [2021-03-25 04:49:19,851 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-25 04:49:19,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 99 events. 27/99 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 399 event pairs, 9 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 180. Up to 43 conditions per place. [2021-03-25 04:49:19,853 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-25 04:49:20,491 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-25 04:49:20,649 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 04:49:20,922 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-25 04:49:21,063 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 04:49:21,070 INFO L154 LiptonReduction]: Checked pairs total: 582 [2021-03-25 04:49:21,070 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:49:21,070 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1255 [2021-03-25 04:49:21,071 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 105 flow [2021-03-25 04:49:21,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 0 states have call successors, (0), 0 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:49:21,072 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:21,073 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:21,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:49:21,074 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash 79909949, now seen corresponding path program 1 times [2021-03-25 04:49:21,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:21,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7456792] [2021-03-25 04:49:21,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:21,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:21,226 INFO L142 QuantifierPusher]: treesize reduction 11, result has 38.9 percent of original size [2021-03-25 04:49:21,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:49:21,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 04:49:21,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:49:21,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:49:21,309 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:49:21,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7456792] [2021-03-25 04:49:21,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:21,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:49:21,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706897954] [2021-03-25 04:49:21,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:49:21,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:21,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:49:21,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:49:21,312 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 175 [2021-03-25 04:49:21,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 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:49:21,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:21,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 175 [2021-03-25 04:49:21,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:21,399 INFO L129 PetriNetUnfolder]: 80/176 cut-off events. [2021-03-25 04:49:21,399 INFO L130 PetriNetUnfolder]: For 70/89 co-relation queries the response was YES. [2021-03-25 04:49:21,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 176 events. 80/176 cut-off events. For 70/89 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 787 event pairs, 23 based on Foata normal form. 10/179 useless extension candidates. Maximal degree in co-relation 463. Up to 125 conditions per place. [2021-03-25 04:49:21,400 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 10 selfloop transitions, 9 changer transitions 0/33 dead transitions. [2021-03-25 04:49:21,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 158 flow [2021-03-25 04:49:21,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:49:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:49:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 545 transitions. [2021-03-25 04:49:21,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7785714285714286 [2021-03-25 04:49:21,403 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 545 transitions. [2021-03-25 04:49:21,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 545 transitions. [2021-03-25 04:49:21,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:21,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 545 transitions. [2021-03-25 04:49:21,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:49:21,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 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:49:21,406 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 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:49:21,406 INFO L185 Difference]: Start difference. First operand has 34 places, 29 transitions, 105 flow. Second operand 4 states and 545 transitions. [2021-03-25 04:49:21,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 158 flow [2021-03-25 04:49:21,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 156 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-25 04:49:21,408 INFO L241 Difference]: Finished difference. Result has 38 places, 31 transitions, 143 flow [2021-03-25 04:49:21,408 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2021-03-25 04:49:21,408 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -9 predicate places. [2021-03-25 04:49:21,408 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:21,408 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 31 transitions, 143 flow [2021-03-25 04:49:21,409 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 31 transitions, 143 flow [2021-03-25 04:49:21,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 143 flow [2021-03-25 04:49:21,422 INFO L129 PetriNetUnfolder]: 40/117 cut-off events. [2021-03-25 04:49:21,422 INFO L130 PetriNetUnfolder]: For 65/70 co-relation queries the response was YES. [2021-03-25 04:49:21,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 117 events. 40/117 cut-off events. For 65/70 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 473 event pairs, 14 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 297. Up to 58 conditions per place. [2021-03-25 04:49:21,423 INFO L142 LiptonReduction]: Number of co-enabled transitions 322 [2021-03-25 04:49:21,426 INFO L154 LiptonReduction]: Checked pairs total: 235 [2021-03-25 04:49:21,426 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:49:21,427 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-25 04:49:21,427 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 143 flow [2021-03-25 04:49:21,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 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:49:21,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:21,428 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:21,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:49:21,428 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:21,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:21,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1170290334, now seen corresponding path program 1 times [2021-03-25 04:49:21,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:21,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159298617] [2021-03-25 04:49:21,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:21,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:49:21,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:49:21,518 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:49:21,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159298617] [2021-03-25 04:49:21,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:21,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:49:21,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922146656] [2021-03-25 04:49:21,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:49:21,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:49:21,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:49:21,523 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 175 [2021-03-25 04:49:21,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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:49:21,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:21,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 175 [2021-03-25 04:49:21,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:21,591 INFO L129 PetriNetUnfolder]: 85/179 cut-off events. [2021-03-25 04:49:21,591 INFO L130 PetriNetUnfolder]: For 154/193 co-relation queries the response was YES. [2021-03-25 04:49:21,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 179 events. 85/179 cut-off events. For 154/193 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 765 event pairs, 27 based on Foata normal form. 9/183 useless extension candidates. Maximal degree in co-relation 580. Up to 110 conditions per place. [2021-03-25 04:49:21,593 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 17 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2021-03-25 04:49:21,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 229 flow [2021-03-25 04:49:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:49:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:49:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2021-03-25 04:49:21,595 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8028571428571428 [2021-03-25 04:49:21,596 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2021-03-25 04:49:21,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2021-03-25 04:49:21,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:21,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2021-03-25 04:49:21,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 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:49:21,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 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:49:21,599 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 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:49:21,599 INFO L185 Difference]: Start difference. First operand has 38 places, 31 transitions, 143 flow. Second operand 4 states and 562 transitions. [2021-03-25 04:49:21,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 229 flow [2021-03-25 04:49:21,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:49:21,601 INFO L241 Difference]: Finished difference. Result has 40 places, 35 transitions, 177 flow [2021-03-25 04:49:21,601 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2021-03-25 04:49:21,601 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2021-03-25 04:49:21,601 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:21,602 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 35 transitions, 177 flow [2021-03-25 04:49:21,602 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 35 transitions, 177 flow [2021-03-25 04:49:21,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 177 flow [2021-03-25 04:49:21,622 INFO L129 PetriNetUnfolder]: 72/173 cut-off events. [2021-03-25 04:49:21,622 INFO L130 PetriNetUnfolder]: For 177/197 co-relation queries the response was YES. [2021-03-25 04:49:21,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 173 events. 72/173 cut-off events. For 177/197 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 808 event pairs, 21 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 510. Up to 84 conditions per place. [2021-03-25 04:49:21,624 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-25 04:49:21,627 INFO L154 LiptonReduction]: Checked pairs total: 227 [2021-03-25 04:49:21,628 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:49:21,628 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-03-25 04:49:21,628 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 177 flow [2021-03-25 04:49:21,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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:49:21,629 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:21,629 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:21,629 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:49:21,629 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash 897833438, now seen corresponding path program 2 times [2021-03-25 04:49:21,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:21,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132976982] [2021-03-25 04:49:21,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:21,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:49:21,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:49:21,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:49:21,715 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:49:21,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132976982] [2021-03-25 04:49:21,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:21,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:49:21,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758292276] [2021-03-25 04:49:21,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:49:21,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:21,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:49:21,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:49:21,717 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 175 [2021-03-25 04:49:21,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:49:21,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:21,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 175 [2021-03-25 04:49:21,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:21,785 INFO L129 PetriNetUnfolder]: 77/165 cut-off events. [2021-03-25 04:49:21,786 INFO L130 PetriNetUnfolder]: For 216/294 co-relation queries the response was YES. [2021-03-25 04:49:21,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 165 events. 77/165 cut-off events. For 216/294 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 700 event pairs, 26 based on Foata normal form. 17/177 useless extension candidates. Maximal degree in co-relation 616. Up to 106 conditions per place. [2021-03-25 04:49:21,787 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 16 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2021-03-25 04:49:21,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 243 flow [2021-03-25 04:49:21,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:49:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:49:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2021-03-25 04:49:21,790 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8014285714285714 [2021-03-25 04:49:21,790 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2021-03-25 04:49:21,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2021-03-25 04:49:21,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:21,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2021-03-25 04:49:21,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 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:49:21,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 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:49:21,794 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 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:49:21,794 INFO L185 Difference]: Start difference. First operand has 40 places, 35 transitions, 177 flow. Second operand 4 states and 561 transitions. [2021-03-25 04:49:21,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 243 flow [2021-03-25 04:49:21,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 231 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-25 04:49:21,800 INFO L241 Difference]: Finished difference. Result has 43 places, 35 transitions, 190 flow [2021-03-25 04:49:21,800 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2021-03-25 04:49:21,801 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2021-03-25 04:49:21,801 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:21,801 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 190 flow [2021-03-25 04:49:21,801 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 190 flow [2021-03-25 04:49:21,801 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 190 flow [2021-03-25 04:49:21,827 INFO L129 PetriNetUnfolder]: 68/162 cut-off events. [2021-03-25 04:49:21,828 INFO L130 PetriNetUnfolder]: For 222/241 co-relation queries the response was YES. [2021-03-25 04:49:21,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 162 events. 68/162 cut-off events. For 222/241 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 731 event pairs, 24 based on Foata normal form. 2/157 useless extension candidates. Maximal degree in co-relation 502. Up to 76 conditions per place. [2021-03-25 04:49:21,829 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-25 04:49:21,833 INFO L154 LiptonReduction]: Checked pairs total: 243 [2021-03-25 04:49:21,833 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:49:21,833 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-25 04:49:21,835 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 190 flow [2021-03-25 04:49:21,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:49:21,835 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:21,835 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:21,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:49:21,835 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1485874793, now seen corresponding path program 1 times [2021-03-25 04:49:21,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:21,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469972917] [2021-03-25 04:49:21,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:21,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:49:21,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:49:21,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:49:21,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:21,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 04:49:21,970 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:49:21,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469972917] [2021-03-25 04:49:21,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:21,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:49:21,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239437776] [2021-03-25 04:49:21,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:49:21,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:21,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:49:21,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:49:21,975 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 175 [2021-03-25 04:49:21,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 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:49:21,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:21,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 175 [2021-03-25 04:49:21,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:22,076 INFO L129 PetriNetUnfolder]: 85/178 cut-off events. [2021-03-25 04:49:22,076 INFO L130 PetriNetUnfolder]: For 301/426 co-relation queries the response was YES. [2021-03-25 04:49:22,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 178 events. 85/178 cut-off events. For 301/426 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 761 event pairs, 19 based on Foata normal form. 20/192 useless extension candidates. Maximal degree in co-relation 691. Up to 112 conditions per place. [2021-03-25 04:49:22,078 INFO L132 encePairwiseOnDemand]: 167/175 looper letters, 17 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2021-03-25 04:49:22,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 288 flow [2021-03-25 04:49:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:49:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:49:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2021-03-25 04:49:22,081 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7554285714285714 [2021-03-25 04:49:22,081 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2021-03-25 04:49:22,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2021-03-25 04:49:22,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:22,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2021-03-25 04:49:22,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 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:49:22,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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:49:22,084 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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:49:22,084 INFO L185 Difference]: Start difference. First operand has 43 places, 35 transitions, 190 flow. Second operand 5 states and 661 transitions. [2021-03-25 04:49:22,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 288 flow [2021-03-25 04:49:22,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 270 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 04:49:22,087 INFO L241 Difference]: Finished difference. Result has 45 places, 38 transitions, 224 flow [2021-03-25 04:49:22,088 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2021-03-25 04:49:22,088 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2021-03-25 04:49:22,088 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:22,088 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 224 flow [2021-03-25 04:49:22,088 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 224 flow [2021-03-25 04:49:22,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 224 flow [2021-03-25 04:49:22,112 INFO L129 PetriNetUnfolder]: 82/183 cut-off events. [2021-03-25 04:49:22,112 INFO L130 PetriNetUnfolder]: For 295/326 co-relation queries the response was YES. [2021-03-25 04:49:22,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 183 events. 82/183 cut-off events. For 295/326 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 841 event pairs, 31 based on Foata normal form. 2/179 useless extension candidates. Maximal degree in co-relation 616. Up to 83 conditions per place. [2021-03-25 04:49:22,115 INFO L142 LiptonReduction]: Number of co-enabled transitions 384 [2021-03-25 04:49:22,119 INFO L154 LiptonReduction]: Checked pairs total: 325 [2021-03-25 04:49:22,119 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:49:22,119 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-03-25 04:49:22,123 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 224 flow [2021-03-25 04:49:22,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 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:49:22,124 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:22,124 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:22,124 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:49:22,124 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:22,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1916608981, now seen corresponding path program 2 times [2021-03-25 04:49:22,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:22,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169016384] [2021-03-25 04:49:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:22,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:49:22,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:49:22,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:49:22,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:49:22,239 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:49:22,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169016384] [2021-03-25 04:49:22,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:22,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:49:22,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459514505] [2021-03-25 04:49:22,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:49:22,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:22,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:49:22,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:49:22,243 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 175 [2021-03-25 04:49:22,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 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:49:22,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:22,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 175 [2021-03-25 04:49:22,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:22,377 INFO L129 PetriNetUnfolder]: 90/205 cut-off events. [2021-03-25 04:49:22,377 INFO L130 PetriNetUnfolder]: For 493/695 co-relation queries the response was YES. [2021-03-25 04:49:22,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 205 events. 90/205 cut-off events. For 493/695 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 984 event pairs, 7 based on Foata normal form. 25/224 useless extension candidates. Maximal degree in co-relation 826. Up to 98 conditions per place. [2021-03-25 04:49:22,379 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 14 selfloop transitions, 20 changer transitions 0/48 dead transitions. [2021-03-25 04:49:22,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 368 flow [2021-03-25 04:49:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:49:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:49:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2021-03-25 04:49:22,382 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7565714285714286 [2021-03-25 04:49:22,382 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2021-03-25 04:49:22,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2021-03-25 04:49:22,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:22,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2021-03-25 04:49:22,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:49:22,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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:49:22,385 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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:49:22,385 INFO L185 Difference]: Start difference. First operand has 45 places, 38 transitions, 224 flow. Second operand 5 states and 662 transitions. [2021-03-25 04:49:22,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 368 flow [2021-03-25 04:49:22,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 344 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 04:49:22,389 INFO L241 Difference]: Finished difference. Result has 48 places, 44 transitions, 321 flow [2021-03-25 04:49:22,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2021-03-25 04:49:22,389 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2021-03-25 04:49:22,389 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:22,389 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 44 transitions, 321 flow [2021-03-25 04:49:22,389 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 44 transitions, 321 flow [2021-03-25 04:49:22,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 321 flow [2021-03-25 04:49:22,436 INFO L129 PetriNetUnfolder]: 88/202 cut-off events. [2021-03-25 04:49:22,437 INFO L130 PetriNetUnfolder]: For 555/626 co-relation queries the response was YES. [2021-03-25 04:49:22,437 INFO L84 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 202 events. 88/202 cut-off events. For 555/626 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 960 event pairs, 22 based on Foata normal form. 4/201 useless extension candidates. Maximal degree in co-relation 816. Up to 92 conditions per place. [2021-03-25 04:49:22,439 INFO L142 LiptonReduction]: Number of co-enabled transitions 432 [2021-03-25 04:49:22,446 INFO L154 LiptonReduction]: Checked pairs total: 456 [2021-03-25 04:49:22,446 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:49:22,447 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 58 [2021-03-25 04:49:22,447 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 321 flow [2021-03-25 04:49:22,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 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:49:22,447 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:22,448 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:22,448 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:49:22,448 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:22,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:22,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1918702008, now seen corresponding path program 1 times [2021-03-25 04:49:22,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:22,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093561062] [2021-03-25 04:49:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:22,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:22,505 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:49:22,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:49:22,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:22,513 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:49:22,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093561062] [2021-03-25 04:49:22,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:22,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:49:22,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237178918] [2021-03-25 04:49:22,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:49:22,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:22,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:49:22,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:49:22,515 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 175 [2021-03-25 04:49:22,515 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:49:22,515 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:22,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 175 [2021-03-25 04:49:22,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:22,590 INFO L129 PetriNetUnfolder]: 162/354 cut-off events. [2021-03-25 04:49:22,590 INFO L130 PetriNetUnfolder]: For 871/1111 co-relation queries the response was YES. [2021-03-25 04:49:22,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 354 events. 162/354 cut-off events. For 871/1111 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1998 event pairs, 45 based on Foata normal form. 73/370 useless extension candidates. Maximal degree in co-relation 1211. Up to 176 conditions per place. [2021-03-25 04:49:22,594 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 12 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2021-03-25 04:49:22,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 361 flow [2021-03-25 04:49:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:49:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:49:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 740 transitions. [2021-03-25 04:49:22,597 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8457142857142858 [2021-03-25 04:49:22,597 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 740 transitions. [2021-03-25 04:49:22,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 740 transitions. [2021-03-25 04:49:22,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:22,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 740 transitions. [2021-03-25 04:49:22,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:49:22,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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:49:22,600 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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:49:22,600 INFO L185 Difference]: Start difference. First operand has 48 places, 44 transitions, 321 flow. Second operand 5 states and 740 transitions. [2021-03-25 04:49:22,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 361 flow [2021-03-25 04:49:22,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 347 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 04:49:22,606 INFO L241 Difference]: Finished difference. Result has 54 places, 49 transitions, 353 flow [2021-03-25 04:49:22,606 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2021-03-25 04:49:22,606 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2021-03-25 04:49:22,606 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:22,606 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 49 transitions, 353 flow [2021-03-25 04:49:22,607 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 49 transitions, 353 flow [2021-03-25 04:49:22,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 49 transitions, 353 flow [2021-03-25 04:49:22,641 INFO L129 PetriNetUnfolder]: 128/294 cut-off events. [2021-03-25 04:49:22,642 INFO L130 PetriNetUnfolder]: For 871/971 co-relation queries the response was YES. [2021-03-25 04:49:22,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 294 events. 128/294 cut-off events. For 871/971 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1595 event pairs, 41 based on Foata normal form. 26/305 useless extension candidates. Maximal degree in co-relation 1174. Up to 118 conditions per place. [2021-03-25 04:49:22,646 INFO L142 LiptonReduction]: Number of co-enabled transitions 528 [2021-03-25 04:49:22,651 INFO L154 LiptonReduction]: Checked pairs total: 295 [2021-03-25 04:49:22,651 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:49:22,651 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-03-25 04:49:22,654 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 353 flow [2021-03-25 04:49:22,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:49:22,655 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:22,655 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:22,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:49:22,655 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:22,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:22,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1521427174, now seen corresponding path program 1 times [2021-03-25 04:49:22,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:22,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075456566] [2021-03-25 04:49:22,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:22,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:22,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:22,718 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:49:22,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:49:22,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:22,729 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:49:22,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075456566] [2021-03-25 04:49:22,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:22,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:49:22,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687307519] [2021-03-25 04:49:22,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:49:22,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:22,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:49:22,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:49:22,730 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 175 [2021-03-25 04:49:22,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:49:22,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:22,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 175 [2021-03-25 04:49:22,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:22,814 INFO L129 PetriNetUnfolder]: 95/249 cut-off events. [2021-03-25 04:49:22,815 INFO L130 PetriNetUnfolder]: For 1104/1709 co-relation queries the response was YES. [2021-03-25 04:49:22,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 249 events. 95/249 cut-off events. For 1104/1709 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1390 event pairs, 9 based on Foata normal form. 143/361 useless extension candidates. Maximal degree in co-relation 979. Up to 126 conditions per place. [2021-03-25 04:49:22,817 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 8 selfloop transitions, 15 changer transitions 3/55 dead transitions. [2021-03-25 04:49:22,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 419 flow [2021-03-25 04:49:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:49:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:49:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1036 transitions. [2021-03-25 04:49:22,820 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8457142857142858 [2021-03-25 04:49:22,820 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1036 transitions. [2021-03-25 04:49:22,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1036 transitions. [2021-03-25 04:49:22,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:22,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1036 transitions. [2021-03-25 04:49:22,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 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:49:22,825 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:49:22,825 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:49:22,825 INFO L185 Difference]: Start difference. First operand has 54 places, 49 transitions, 353 flow. Second operand 7 states and 1036 transitions. [2021-03-25 04:49:22,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 419 flow [2021-03-25 04:49:22,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 377 flow, removed 10 selfloop flow, removed 5 redundant places. [2021-03-25 04:49:22,829 INFO L241 Difference]: Finished difference. Result has 58 places, 50 transitions, 362 flow [2021-03-25 04:49:22,829 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2021-03-25 04:49:22,829 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2021-03-25 04:49:22,829 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:22,830 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 50 transitions, 362 flow [2021-03-25 04:49:22,830 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 50 transitions, 362 flow [2021-03-25 04:49:22,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 50 transitions, 362 flow [2021-03-25 04:49:22,850 INFO L129 PetriNetUnfolder]: 60/190 cut-off events. [2021-03-25 04:49:22,850 INFO L130 PetriNetUnfolder]: For 798/933 co-relation queries the response was YES. [2021-03-25 04:49:22,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 190 events. 60/190 cut-off events. For 798/933 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1047 event pairs, 9 based on Foata normal form. 16/198 useless extension candidates. Maximal degree in co-relation 778. Up to 89 conditions per place. [2021-03-25 04:49:22,853 INFO L142 LiptonReduction]: Number of co-enabled transitions 586 [2021-03-25 04:49:22,864 INFO L154 LiptonReduction]: Checked pairs total: 649 [2021-03-25 04:49:22,864 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:49:22,864 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-25 04:49:22,864 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 346 flow [2021-03-25 04:49:22,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:49:22,866 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:22,866 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:22,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:49:22,866 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:22,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1642518268, now seen corresponding path program 1 times [2021-03-25 04:49:22,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:22,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355807640] [2021-03-25 04:49:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:22,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:22,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:22,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:22,943 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:49:22,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:49:22,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:22,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:22,951 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:49:22,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355807640] [2021-03-25 04:49:22,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:22,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:49:22,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38976333] [2021-03-25 04:49:22,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:49:22,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:22,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:49:22,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:49:22,953 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 175 [2021-03-25 04:49:22,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 346 flow. Second operand has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 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:49:22,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:22,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 175 [2021-03-25 04:49:22,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:23,022 INFO L129 PetriNetUnfolder]: 65/161 cut-off events. [2021-03-25 04:49:23,022 INFO L130 PetriNetUnfolder]: For 569/758 co-relation queries the response was YES. [2021-03-25 04:49:23,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 161 events. 65/161 cut-off events. For 569/758 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 705 event pairs, 4 based on Foata normal form. 24/162 useless extension candidates. Maximal degree in co-relation 629. Up to 74 conditions per place. [2021-03-25 04:49:23,024 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 5 selfloop transitions, 11 changer transitions 4/49 dead transitions. [2021-03-25 04:49:23,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 365 flow [2021-03-25 04:49:23,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:49:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:49:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1030 transitions. [2021-03-25 04:49:23,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8408163265306122 [2021-03-25 04:49:23,027 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1030 transitions. [2021-03-25 04:49:23,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1030 transitions. [2021-03-25 04:49:23,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:23,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1030 transitions. [2021-03-25 04:49:23,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.14285714285714) internal successors, (1030), 7 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:49:23,031 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:49:23,032 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:49:23,032 INFO L185 Difference]: Start difference. First operand has 58 places, 48 transitions, 346 flow. Second operand 7 states and 1030 transitions. [2021-03-25 04:49:23,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 365 flow [2021-03-25 04:49:23,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 323 flow, removed 16 selfloop flow, removed 5 redundant places. [2021-03-25 04:49:23,035 INFO L241 Difference]: Finished difference. Result has 57 places, 43 transitions, 289 flow [2021-03-25 04:49:23,036 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2021-03-25 04:49:23,036 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2021-03-25 04:49:23,036 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:23,036 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 43 transitions, 289 flow [2021-03-25 04:49:23,036 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 43 transitions, 289 flow [2021-03-25 04:49:23,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 43 transitions, 289 flow [2021-03-25 04:49:23,049 INFO L129 PetriNetUnfolder]: 32/105 cut-off events. [2021-03-25 04:49:23,049 INFO L130 PetriNetUnfolder]: For 234/269 co-relation queries the response was YES. [2021-03-25 04:49:23,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 105 events. 32/105 cut-off events. For 234/269 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 397 event pairs, 1 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 379. Up to 31 conditions per place. [2021-03-25 04:49:23,051 INFO L142 LiptonReduction]: Number of co-enabled transitions 374 [2021-03-25 04:49:23,320 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 04:49:23,462 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 04:49:24,114 WARN L205 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 192 [2021-03-25 04:49:24,327 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 04:49:26,350 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 347 DAG size of output: 272 [2021-03-25 04:49:26,860 WARN L205 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 04:49:26,867 INFO L154 LiptonReduction]: Checked pairs total: 544 [2021-03-25 04:49:26,867 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:49:26,867 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3831 [2021-03-25 04:49:26,867 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 275 flow [2021-03-25 04:49:26,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 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:49:26,868 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:26,868 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:26,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:49:26,868 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:26,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:26,869 INFO L82 PathProgramCache]: Analyzing trace with hash 332065678, now seen corresponding path program 1 times [2021-03-25 04:49:26,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:26,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637477593] [2021-03-25 04:49:26,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:26,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:26,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:26,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:26,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:26,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:26,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:26,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:49:26,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637477593] [2021-03-25 04:49:26,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:26,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:49:26,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617668460] [2021-03-25 04:49:26,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:49:26,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:26,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:49:26,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:49:26,916 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 177 [2021-03-25 04:49:26,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 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:49:26,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:26,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 177 [2021-03-25 04:49:26,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:26,952 INFO L129 PetriNetUnfolder]: 53/151 cut-off events. [2021-03-25 04:49:26,952 INFO L130 PetriNetUnfolder]: For 461/537 co-relation queries the response was YES. [2021-03-25 04:49:26,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 151 events. 53/151 cut-off events. For 461/537 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 678 event pairs, 4 based on Foata normal form. 25/168 useless extension candidates. Maximal degree in co-relation 557. Up to 50 conditions per place. [2021-03-25 04:49:26,954 INFO L132 encePairwiseOnDemand]: 174/177 looper letters, 3 selfloop transitions, 2 changer transitions 1/41 dead transitions. [2021-03-25 04:49:26,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 287 flow [2021-03-25 04:49:26,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:49:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:49:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2021-03-25 04:49:26,956 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-03-25 04:49:26,956 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2021-03-25 04:49:26,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2021-03-25 04:49:26,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:26,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2021-03-25 04:49:26,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 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:49:26,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 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:49:26,959 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 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:49:26,959 INFO L185 Difference]: Start difference. First operand has 53 places, 40 transitions, 275 flow. Second operand 4 states and 590 transitions. [2021-03-25 04:49:26,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 287 flow [2021-03-25 04:49:26,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 245 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-25 04:49:26,962 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 241 flow [2021-03-25 04:49:26,963 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2021-03-25 04:49:26,963 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2021-03-25 04:49:26,963 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:26,963 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 241 flow [2021-03-25 04:49:26,963 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 241 flow [2021-03-25 04:49:26,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 241 flow [2021-03-25 04:49:26,978 INFO L129 PetriNetUnfolder]: 51/146 cut-off events. [2021-03-25 04:49:26,978 INFO L130 PetriNetUnfolder]: For 248/286 co-relation queries the response was YES. [2021-03-25 04:49:26,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 146 events. 51/146 cut-off events. For 248/286 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 668 event pairs, 1 based on Foata normal form. 11/153 useless extension candidates. Maximal degree in co-relation 473. Up to 49 conditions per place. [2021-03-25 04:49:26,980 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-25 04:49:26,982 INFO L154 LiptonReduction]: Checked pairs total: 78 [2021-03-25 04:49:26,983 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:49:26,983 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-25 04:49:26,983 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 241 flow [2021-03-25 04:49:26,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 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:49:26,983 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:26,984 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:49:26,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:49:26,984 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:26,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1446367577, now seen corresponding path program 1 times [2021-03-25 04:49:26,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:26,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043615878] [2021-03-25 04:49:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:27,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:27,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:49:27,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:27,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:49:27,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:27,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:49:27,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:27,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:49:27,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:27,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:49:27,066 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:49:27,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043615878] [2021-03-25 04:49:27,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:27,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:49:27,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635958338] [2021-03-25 04:49:27,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:49:27,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:27,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:49:27,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:49:27,068 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 177 [2021-03-25 04:49:27,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 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:49:27,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:27,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 177 [2021-03-25 04:49:27,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:27,269 INFO L129 PetriNetUnfolder]: 144/363 cut-off events. [2021-03-25 04:49:27,270 INFO L130 PetriNetUnfolder]: For 806/868 co-relation queries the response was YES. [2021-03-25 04:49:27,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 363 events. 144/363 cut-off events. For 806/868 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2097 event pairs, 3 based on Foata normal form. 39/385 useless extension candidates. Maximal degree in co-relation 1367. Up to 122 conditions per place. [2021-03-25 04:49:27,272 INFO L132 encePairwiseOnDemand]: 170/177 looper letters, 16 selfloop transitions, 3 changer transitions 39/75 dead transitions. [2021-03-25 04:49:27,272 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 607 flow [2021-03-25 04:49:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 04:49:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 04:49:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1150 transitions. [2021-03-25 04:49:27,276 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7219083490269931 [2021-03-25 04:49:27,276 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1150 transitions. [2021-03-25 04:49:27,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1150 transitions. [2021-03-25 04:49:27,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:27,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1150 transitions. [2021-03-25 04:49:27,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.77777777777777) internal successors, (1150), 9 states have internal predecessors, (1150), 0 states have call successors, (0), 0 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:49:27,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 177.0) internal successors, (1770), 10 states have internal predecessors, (1770), 0 states have call successors, (0), 0 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:49:27,281 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 177.0) internal successors, (1770), 10 states have internal predecessors, (1770), 0 states have call successors, (0), 0 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:49:27,281 INFO L185 Difference]: Start difference. First operand has 51 places, 40 transitions, 241 flow. Second operand 9 states and 1150 transitions. [2021-03-25 04:49:27,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 607 flow [2021-03-25 04:49:27,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 606 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:49:27,288 INFO L241 Difference]: Finished difference. Result has 63 places, 32 transitions, 207 flow [2021-03-25 04:49:27,288 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=207, PETRI_PLACES=63, PETRI_TRANSITIONS=32} [2021-03-25 04:49:27,288 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2021-03-25 04:49:27,288 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:27,289 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 32 transitions, 207 flow [2021-03-25 04:49:27,289 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 32 transitions, 207 flow [2021-03-25 04:49:27,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 32 transitions, 207 flow [2021-03-25 04:49:27,298 INFO L129 PetriNetUnfolder]: 24/88 cut-off events. [2021-03-25 04:49:27,299 INFO L130 PetriNetUnfolder]: For 193/203 co-relation queries the response was YES. [2021-03-25 04:49:27,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 88 events. 24/88 cut-off events. For 193/203 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 302 event pairs, 3 based on Foata normal form. 8/95 useless extension candidates. Maximal degree in co-relation 300. Up to 28 conditions per place. [2021-03-25 04:49:27,300 INFO L142 LiptonReduction]: Number of co-enabled transitions 198 [2021-03-25 04:49:27,349 INFO L154 LiptonReduction]: Checked pairs total: 40 [2021-03-25 04:49:27,350 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:49:27,350 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 62 [2021-03-25 04:49:27,351 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 31 transitions, 208 flow [2021-03-25 04:49:27,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 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:49:27,352 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:27,352 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:49:27,352 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:49:27,352 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash -419777191, now seen corresponding path program 2 times [2021-03-25 04:49:27,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:27,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254501044] [2021-03-25 04:49:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:49:27,387 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:49:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:49:27,416 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:49:27,457 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:49:27,457 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:49:27,458 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:49:27,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:49:27 BasicIcfg [2021-03-25 04:49:27,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:49:27,554 INFO L168 Benchmark]: Toolchain (without parser) took 20705.76 ms. Allocated memory was 255.9 MB in the beginning and 599.8 MB in the end (delta: 343.9 MB). Free memory was 232.2 MB in the beginning and 475.9 MB in the end (delta: -243.7 MB). Peak memory consumption was 101.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:49:27,554 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:49:27,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.15 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 232.2 MB in the beginning and 305.7 MB in the end (delta: -73.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 04:49:27,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.71 ms. Allocated memory is still 346.0 MB. Free memory was 305.7 MB in the beginning and 302.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:49:27,555 INFO L168 Benchmark]: Boogie Preprocessor took 58.22 ms. Allocated memory is still 346.0 MB. Free memory was 302.8 MB in the beginning and 300.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:49:27,558 INFO L168 Benchmark]: RCFGBuilder took 1615.36 ms. Allocated memory was 346.0 MB in the beginning and 415.2 MB in the end (delta: 69.2 MB). Free memory was 300.6 MB in the beginning and 388.5 MB in the end (delta: -88.0 MB). Peak memory consumption was 64.9 MB. Max. memory is 16.0 GB. [2021-03-25 04:49:27,559 INFO L168 Benchmark]: TraceAbstraction took 18470.91 ms. Allocated memory was 415.2 MB in the beginning and 599.8 MB in the end (delta: 184.5 MB). Free memory was 387.5 MB in the beginning and 475.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 96.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:49:27,563 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.46 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 498.15 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 232.2 MB in the beginning and 305.7 MB in the end (delta: -73.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 57.71 ms. Allocated memory is still 346.0 MB. Free memory was 305.7 MB in the beginning and 302.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 58.22 ms. Allocated memory is still 346.0 MB. Free memory was 302.8 MB in the beginning and 300.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1615.36 ms. Allocated memory was 346.0 MB in the beginning and 415.2 MB in the end (delta: 69.2 MB). Free memory was 300.6 MB in the beginning and 388.5 MB in the end (delta: -88.0 MB). Peak memory consumption was 64.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18470.91 ms. Allocated memory was 415.2 MB in the beginning and 599.8 MB in the end (delta: 184.5 MB). Free memory was 387.5 MB in the beginning and 475.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 96.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7293.8ms, 103 PlacesBefore, 47 PlacesAfterwards, 95 TransitionsBefore, 38 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 3192 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1478, positive: 1393, positive conditional: 0, positive unconditional: 1393, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 797, positive: 775, positive conditional: 0, positive unconditional: 775, 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: 797, positive: 775, positive conditional: 0, positive unconditional: 775, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1478, positive: 618, positive conditional: 0, positive unconditional: 618, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 797, unknown conditional: 0, unknown unconditional: 797] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2505.6ms, 44 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1218 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 323, positive: 236, positive conditional: 0, positive unconditional: 236, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 36, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 323, positive: 206, positive conditional: 0, positive unconditional: 206, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 36, unknown conditional: 0, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1253.8ms, 36 PlacesBefore, 34 PlacesAfterwards, 31 TransitionsBefore, 29 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 582 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 238, positive: 205, positive conditional: 0, positive unconditional: 205, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 238, positive: 200, positive conditional: 0, positive unconditional: 200, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.8ms, 38 PlacesBefore, 38 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 235 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 85, positive conditional: 0, positive unconditional: 85, 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: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 98, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.7ms, 40 PlacesBefore, 40 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 227 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 123, positive: 112, positive conditional: 0, positive unconditional: 112, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 123, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.1ms, 43 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 243 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, positive: 89, positive conditional: 0, positive unconditional: 89, 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: 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: 101, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.8ms, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 325 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 146, positive: 131, positive conditional: 0, positive unconditional: 131, negative: 15, negative conditional: 0, negative unconditional: 15, 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: 146, positive: 131, positive conditional: 0, positive unconditional: 131, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 57.1ms, 48 PlacesBefore, 48 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 456 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 194, positive: 175, positive conditional: 0, positive unconditional: 175, negative: 19, negative conditional: 0, negative unconditional: 19, 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: 194, positive: 172, positive conditional: 0, positive unconditional: 172, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.5ms, 54 PlacesBefore, 54 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 295 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 204, positive: 193, positive conditional: 0, positive unconditional: 193, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 204, positive: 192, positive conditional: 0, positive unconditional: 192, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.1ms, 58 PlacesBefore, 58 PlacesAfterwards, 50 TransitionsBefore, 48 TransitionsAfterwards, 586 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 389, positive: 367, positive conditional: 0, positive unconditional: 367, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 389, positive: 365, positive conditional: 0, positive unconditional: 365, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3830.5ms, 57 PlacesBefore, 53 PlacesAfterwards, 43 TransitionsBefore, 40 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 544 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 279, positive: 252, positive conditional: 0, positive unconditional: 252, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 279, positive: 245, positive conditional: 0, positive unconditional: 245, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.4ms, 51 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 4, negative conditional: 0, negative unconditional: 4, 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: 32, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.8ms, 63 PlacesBefore, 54 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 40 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 29, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L843] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L844] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L845] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L847] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L848] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __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=54, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18266.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1321.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7363.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 51 SDtfs, 45 SDslu, 30 SDs, 0 SdLazy, 353 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 427.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 436.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=362occurred in iteration=9, InterpolantAutomatonStates: 61, 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: 40.2ms SsaConstructionTime, 361.5ms SatisfiabilityAnalysisTime, 968.3ms InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1025 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...