/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:06:58,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:06:58,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:06:58,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:06:58,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:06:58,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:06:58,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:06:58,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:06:58,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:06:58,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:06:58,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:06:58,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:06:58,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:06:58,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:06:58,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:06:58,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:06:58,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:06:58,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:06:58,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:06:58,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:06:58,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:06:58,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:06:58,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:06:58,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:06:58,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:06:58,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:06:58,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:06:58,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:06:58,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:06:58,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:06:58,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:06:58,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:06:58,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:06:58,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:06:58,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:06:58,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:06:58,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:06:58,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:06:58,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:06:58,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:06:58,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:06:58,531 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:06:58,545 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:06:58,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:06:58,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:06:58,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:06:58,546 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:06:58,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:06:58,546 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:06:58,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:06:58,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:06:58,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:06:58,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:06:58,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:06:58,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:06:58,547 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:06:58,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:06:58,547 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:06:58,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:06:58,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:06:58,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:06:58,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:06:58,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:06:58,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:06:58,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:06:58,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:06:58,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:06:58,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:06:58,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:06:58,548 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:06:58,549 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:06:58,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:06:58,549 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:06:58,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:06:58,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:06:58,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:06:58,816 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:06:58,816 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:06:58,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i [2021-03-26 10:06:58,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2efb985e/fb3145158a7b47e5b17a599f6ad3cae8/FLAGed54bad09 [2021-03-26 10:06:59,258 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:06:59,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i [2021-03-26 10:06:59,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2efb985e/fb3145158a7b47e5b17a599f6ad3cae8/FLAGed54bad09 [2021-03-26 10:06:59,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2efb985e/fb3145158a7b47e5b17a599f6ad3cae8 [2021-03-26 10:06:59,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:06:59,608 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:06:59,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:06:59,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:06:59,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:06:59,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:06:59" (1/1) ... [2021-03-26 10:06:59,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32cf33d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59, skipping insertion in model container [2021-03-26 10:06:59,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:06:59" (1/1) ... [2021-03-26 10:06:59,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:06:59,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:06:59,726 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/mix038_power.oepc.i[951,964] [2021-03-26 10:06:59,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:06:59,828 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:06:59,868 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/mix038_power.oepc.i[951,964] [2021-03-26 10:06:59,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:06:59,972 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:06:59,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59 WrapperNode [2021-03-26 10:06:59,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:06:59,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:06:59,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:06:59,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:06:59,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59" (1/1) ... [2021-03-26 10:07:00,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59" (1/1) ... [2021-03-26 10:07:00,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:07:00,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:07:00,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:07:00,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:07:00,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59" (1/1) ... [2021-03-26 10:07:00,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59" (1/1) ... [2021-03-26 10:07:00,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59" (1/1) ... [2021-03-26 10:07:00,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59" (1/1) ... [2021-03-26 10:07:00,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59" (1/1) ... [2021-03-26 10:07:00,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59" (1/1) ... [2021-03-26 10:07:00,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59" (1/1) ... [2021-03-26 10:07:00,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:07:00,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:07:00,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:07:00,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:07:00,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:07:00,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:07:00,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:07:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:07:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:07:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:07:00,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:07:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:07:00,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:07:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:07:00,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:07:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:07:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:07:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:07:00,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:07:00,108 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:07:01,382 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:07:01,383 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:07:01,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:07:01 BoogieIcfgContainer [2021-03-26 10:07:01,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:07:01,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:07:01,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:07:01,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:07:01,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:06:59" (1/3) ... [2021-03-26 10:07:01,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3ac50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:07:01, skipping insertion in model container [2021-03-26 10:07:01,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:59" (2/3) ... [2021-03-26 10:07:01,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3ac50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:07:01, skipping insertion in model container [2021-03-26 10:07:01,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:07:01" (3/3) ... [2021-03-26 10:07:01,389 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc.i [2021-03-26 10:07:01,393 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:07:01,396 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:07:01,397 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:07:01,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,426 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,426 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,429 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,433 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,434 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,434 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,434 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,451 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,451 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:01,466 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:07:01,478 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:07:01,489 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:07:01,490 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:07:01,490 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:07:01,490 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:07:01,490 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:07:01,490 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:07:01,490 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:07:01,490 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:07:01,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 219 flow [2021-03-26 10:07:01,531 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-03-26 10:07:01,532 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:01,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-26 10:07:01,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 102 transitions, 219 flow [2021-03-26 10:07:01,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 99 transitions, 207 flow [2021-03-26 10:07:01,546 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:01,557 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 207 flow [2021-03-26 10:07:01,560 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 207 flow [2021-03-26 10:07:01,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 207 flow [2021-03-26 10:07:01,584 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-03-26 10:07:01,584 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:01,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-26 10:07:01,611 INFO L142 LiptonReduction]: Number of co-enabled transitions 1862 [2021-03-26 10:07:02,705 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:07:03,051 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:07:03,160 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:07:04,116 INFO L154 LiptonReduction]: Checked pairs total: 3648 [2021-03-26 10:07:04,116 INFO L156 LiptonReduction]: Total number of compositions: 72 [2021-03-26 10:07:04,118 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2573 [2021-03-26 10:07:04,124 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-26 10:07:04,124 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:04,124 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:04,124 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:04,125 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:04,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:04,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1038582934, now seen corresponding path program 1 times [2021-03-26 10:07:04,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:04,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637856247] [2021-03-26 10:07:04,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:04,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:04,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:04,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:04,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:04,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637856247] [2021-03-26 10:07:04,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:04,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:07:04,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228747105] [2021-03-26 10:07:04,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:07:04,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:04,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:07:04,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:07:04,301 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 174 [2021-03-26 10:07:04,303 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:04,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:04,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 174 [2021-03-26 10:07:04,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:04,364 INFO L129 PetriNetUnfolder]: 49/162 cut-off events. [2021-03-26 10:07:04,364 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:04,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 162 events. 49/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 721 event pairs, 38 based on Foata normal form. 16/163 useless extension candidates. Maximal degree in co-relation 239. Up to 65 conditions per place. [2021-03-26 10:07:04,366 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 9 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2021-03-26 10:07:04,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 109 flow [2021-03-26 10:07:04,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:07:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:07:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2021-03-26 10:07:04,381 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8946360153256705 [2021-03-26 10:07:04,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2021-03-26 10:07:04,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2021-03-26 10:07:04,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:04,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2021-03-26 10:07:04,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:04,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:04,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:04,400 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 467 transitions. [2021-03-26 10:07:04,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 109 flow [2021-03-26 10:07:04,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:07:04,403 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-26 10:07:04,404 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, 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=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-26 10:07:04,405 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 10:07:04,405 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:04,405 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 10:07:04,406 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 10:07:04,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-26 10:07:04,413 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 10:07:04,413 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:04,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:07:04,414 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-26 10:07:05,268 INFO L154 LiptonReduction]: Checked pairs total: 1636 [2021-03-26 10:07:05,268 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 10:07:05,269 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 864 [2021-03-26 10:07:05,269 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 62 flow [2021-03-26 10:07:05,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:05,270 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:05,270 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:05,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:07:05,270 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:05,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:05,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1196975917, now seen corresponding path program 1 times [2021-03-26 10:07:05,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:05,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286761985] [2021-03-26 10:07:05,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:05,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:05,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:05,357 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:07:05,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:07:05,366 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:07:05,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:07:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:05,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286761985] [2021-03-26 10:07:05,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:05,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:05,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194796183] [2021-03-26 10:07:05,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:05,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:05,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:05,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:05,372 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 183 [2021-03-26 10:07:05,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:05,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:05,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 183 [2021-03-26 10:07:05,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:05,445 INFO L129 PetriNetUnfolder]: 101/279 cut-off events. [2021-03-26 10:07:05,446 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:05,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 279 events. 101/279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1521 event pairs, 20 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 464. Up to 82 conditions per place. [2021-03-26 10:07:05,448 INFO L132 encePairwiseOnDemand]: 175/183 looper letters, 8 selfloop transitions, 6 changer transitions 12/42 dead transitions. [2021-03-26 10:07:05,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 146 flow [2021-03-26 10:07:05,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:07:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:07:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2021-03-26 10:07:05,451 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7945355191256831 [2021-03-26 10:07:05,451 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 727 transitions. [2021-03-26 10:07:05,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 727 transitions. [2021-03-26 10:07:05,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:05,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 727 transitions. [2021-03-26 10:07:05,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:05,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:05,457 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:05,457 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 62 flow. Second operand 5 states and 727 transitions. [2021-03-26 10:07:05,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 146 flow [2021-03-26 10:07:05,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:07:05,458 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 112 flow [2021-03-26 10:07:05,458 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-26 10:07:05,458 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2021-03-26 10:07:05,459 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:05,459 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 112 flow [2021-03-26 10:07:05,459 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 112 flow [2021-03-26 10:07:05,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 112 flow [2021-03-26 10:07:05,476 INFO L129 PetriNetUnfolder]: 48/184 cut-off events. [2021-03-26 10:07:05,476 INFO L130 PetriNetUnfolder]: For 33/35 co-relation queries the response was YES. [2021-03-26 10:07:05,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 184 events. 48/184 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1040 event pairs, 20 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 362. Up to 81 conditions per place. [2021-03-26 10:07:05,479 INFO L142 LiptonReduction]: Number of co-enabled transitions 316 [2021-03-26 10:07:06,071 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 10:07:06,191 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:07:06,508 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 10:07:06,645 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:07:06,649 INFO L154 LiptonReduction]: Checked pairs total: 795 [2021-03-26 10:07:06,649 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:07:06,649 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1190 [2021-03-26 10:07:06,650 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 108 flow [2021-03-26 10:07:06,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,651 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:06,651 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:06,651 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:07:06,651 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:06,651 INFO L82 PathProgramCache]: Analyzing trace with hash -160316233, now seen corresponding path program 1 times [2021-03-26 10:07:06,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:06,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089934450] [2021-03-26 10:07:06,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:06,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:06,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:06,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:06,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:06,693 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:07:06,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:07:06,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-26 10:07:06,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089934450] [2021-03-26 10:07:06,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:06,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:06,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538176038] [2021-03-26 10:07:06,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:06,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:06,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:06,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:06,701 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 185 [2021-03-26 10:07:06,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:06,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 185 [2021-03-26 10:07:06,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:06,728 INFO L129 PetriNetUnfolder]: 39/139 cut-off events. [2021-03-26 10:07:06,728 INFO L130 PetriNetUnfolder]: For 60/138 co-relation queries the response was YES. [2021-03-26 10:07:06,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 139 events. 39/139 cut-off events. For 60/138 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 612 event pairs, 6 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 375. Up to 68 conditions per place. [2021-03-26 10:07:06,729 INFO L132 encePairwiseOnDemand]: 178/185 looper letters, 9 selfloop transitions, 7 changer transitions 0/32 dead transitions. [2021-03-26 10:07:06,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 164 flow [2021-03-26 10:07:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:07:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:07:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2021-03-26 10:07:06,731 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7972972972972973 [2021-03-26 10:07:06,731 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2021-03-26 10:07:06,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2021-03-26 10:07:06,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:06,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2021-03-26 10:07:06,732 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-26 10:07:06,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,733 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,734 INFO L185 Difference]: Start difference. First operand has 36 places, 28 transitions, 108 flow. Second operand 4 states and 590 transitions. [2021-03-26 10:07:06,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 164 flow [2021-03-26 10:07:06,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 134 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-26 10:07:06,735 INFO L241 Difference]: Finished difference. Result has 38 places, 31 transitions, 134 flow [2021-03-26 10:07:06,735 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2021-03-26 10:07:06,736 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -9 predicate places. [2021-03-26 10:07:06,736 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:06,736 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 31 transitions, 134 flow [2021-03-26 10:07:06,736 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 31 transitions, 134 flow [2021-03-26 10:07:06,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 134 flow [2021-03-26 10:07:06,747 INFO L129 PetriNetUnfolder]: 39/159 cut-off events. [2021-03-26 10:07:06,747 INFO L130 PetriNetUnfolder]: For 66/69 co-relation queries the response was YES. [2021-03-26 10:07:06,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 159 events. 39/159 cut-off events. For 66/69 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 838 event pairs, 14 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 328. Up to 68 conditions per place. [2021-03-26 10:07:06,749 INFO L142 LiptonReduction]: Number of co-enabled transitions 344 [2021-03-26 10:07:06,751 INFO L154 LiptonReduction]: Checked pairs total: 341 [2021-03-26 10:07:06,751 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:06,751 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 10:07:06,752 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 134 flow [2021-03-26 10:07:06,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,752 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:06,752 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:06,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:07:06,753 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:06,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:06,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1251777627, now seen corresponding path program 1 times [2021-03-26 10:07:06,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:06,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729053006] [2021-03-26 10:07:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:06,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:06,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:06,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729053006] [2021-03-26 10:07:06,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:06,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:07:06,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302964118] [2021-03-26 10:07:06,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:07:06,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:06,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:07:06,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:07:06,812 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 185 [2021-03-26 10:07:06,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:06,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 185 [2021-03-26 10:07:06,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:06,832 INFO L129 PetriNetUnfolder]: 33/129 cut-off events. [2021-03-26 10:07:06,833 INFO L130 PetriNetUnfolder]: For 114/151 co-relation queries the response was YES. [2021-03-26 10:07:06,833 INFO L84 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 129 events. 33/129 cut-off events. For 114/151 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 575 event pairs, 13 based on Foata normal form. 3/127 useless extension candidates. Maximal degree in co-relation 309. Up to 60 conditions per place. [2021-03-26 10:07:06,833 INFO L132 encePairwiseOnDemand]: 181/185 looper letters, 6 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2021-03-26 10:07:06,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 174 flow [2021-03-26 10:07:06,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:07:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:07:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2021-03-26 10:07:06,835 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8612612612612612 [2021-03-26 10:07:06,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2021-03-26 10:07:06,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2021-03-26 10:07:06,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:06,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2021-03-26 10:07:06,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 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-26 10:07:06,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 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-26 10:07:06,837 INFO L185 Difference]: Start difference. First operand has 38 places, 31 transitions, 134 flow. Second operand 3 states and 478 transitions. [2021-03-26 10:07:06,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 174 flow [2021-03-26 10:07:06,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:07:06,839 INFO L241 Difference]: Finished difference. Result has 40 places, 34 transitions, 172 flow [2021-03-26 10:07:06,839 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2021-03-26 10:07:06,839 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2021-03-26 10:07:06,839 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:06,839 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 34 transitions, 172 flow [2021-03-26 10:07:06,839 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 34 transitions, 172 flow [2021-03-26 10:07:06,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 172 flow [2021-03-26 10:07:06,849 INFO L129 PetriNetUnfolder]: 33/137 cut-off events. [2021-03-26 10:07:06,849 INFO L130 PetriNetUnfolder]: For 96/108 co-relation queries the response was YES. [2021-03-26 10:07:06,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 137 events. 33/137 cut-off events. For 96/108 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 675 event pairs, 9 based on Foata normal form. 1/135 useless extension candidates. Maximal degree in co-relation 319. Up to 60 conditions per place. [2021-03-26 10:07:06,851 INFO L142 LiptonReduction]: Number of co-enabled transitions 376 [2021-03-26 10:07:06,853 INFO L154 LiptonReduction]: Checked pairs total: 396 [2021-03-26 10:07:06,853 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:06,853 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-26 10:07:06,854 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 172 flow [2021-03-26 10:07:06,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,854 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:06,854 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:06,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:07:06,854 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:06,855 INFO L82 PathProgramCache]: Analyzing trace with hash -993688119, now seen corresponding path program 1 times [2021-03-26 10:07:06,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:06,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232841189] [2021-03-26 10:07:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:06,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:06,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:06,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:06,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:06,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:06,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:06,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232841189] [2021-03-26 10:07:06,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:06,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:06,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276217664] [2021-03-26 10:07:06,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:06,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:06,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:06,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:06,895 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2021-03-26 10:07:06,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:06,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2021-03-26 10:07:06,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:06,962 INFO L129 PetriNetUnfolder]: 188/451 cut-off events. [2021-03-26 10:07:06,962 INFO L130 PetriNetUnfolder]: For 131/158 co-relation queries the response was YES. [2021-03-26 10:07:06,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 451 events. 188/451 cut-off events. For 131/158 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 2917 event pairs, 57 based on Foata normal form. 36/408 useless extension candidates. Maximal degree in co-relation 998. Up to 280 conditions per place. [2021-03-26 10:07:06,965 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 10 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2021-03-26 10:07:06,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 230 flow [2021-03-26 10:07:06,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:07:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:07:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 785 transitions. [2021-03-26 10:07:06,967 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8486486486486486 [2021-03-26 10:07:06,967 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 785 transitions. [2021-03-26 10:07:06,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 785 transitions. [2021-03-26 10:07:06,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:06,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 785 transitions. [2021-03-26 10:07:06,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,970 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:06,970 INFO L185 Difference]: Start difference. First operand has 40 places, 34 transitions, 172 flow. Second operand 5 states and 785 transitions. [2021-03-26 10:07:06,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 230 flow [2021-03-26 10:07:06,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 223 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:07:06,974 INFO L241 Difference]: Finished difference. Result has 46 places, 41 transitions, 225 flow [2021-03-26 10:07:06,974 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2021-03-26 10:07:06,974 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2021-03-26 10:07:06,974 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:06,974 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 225 flow [2021-03-26 10:07:06,975 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 225 flow [2021-03-26 10:07:06,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 225 flow [2021-03-26 10:07:06,997 INFO L129 PetriNetUnfolder]: 134/356 cut-off events. [2021-03-26 10:07:06,997 INFO L130 PetriNetUnfolder]: For 300/368 co-relation queries the response was YES. [2021-03-26 10:07:06,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 356 events. 134/356 cut-off events. For 300/368 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2287 event pairs, 49 based on Foata normal form. 8/337 useless extension candidates. Maximal degree in co-relation 1004. Up to 184 conditions per place. [2021-03-26 10:07:07,000 INFO L142 LiptonReduction]: Number of co-enabled transitions 528 [2021-03-26 10:07:07,012 INFO L154 LiptonReduction]: Checked pairs total: 879 [2021-03-26 10:07:07,012 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:07:07,012 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-26 10:07:07,015 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 219 flow [2021-03-26 10:07:07,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,016 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:07,016 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:07,016 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:07:07,016 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:07,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:07,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1472509081, now seen corresponding path program 1 times [2021-03-26 10:07:07,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:07,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326313178] [2021-03-26 10:07:07,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:07,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:07,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:07,078 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:07:07,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:07:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:07,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326313178] [2021-03-26 10:07:07,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:07,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:07,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978346626] [2021-03-26 10:07:07,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:07,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:07,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:07,090 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 185 [2021-03-26 10:07:07,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:07,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 185 [2021-03-26 10:07:07,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:07,135 INFO L129 PetriNetUnfolder]: 144/372 cut-off events. [2021-03-26 10:07:07,135 INFO L130 PetriNetUnfolder]: For 463/609 co-relation queries the response was YES. [2021-03-26 10:07:07,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 372 events. 144/372 cut-off events. For 463/609 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2274 event pairs, 66 based on Foata normal form. 25/368 useless extension candidates. Maximal degree in co-relation 1107. Up to 210 conditions per place. [2021-03-26 10:07:07,137 INFO L132 encePairwiseOnDemand]: 180/185 looper letters, 9 selfloop transitions, 9 changer transitions 4/41 dead transitions. [2021-03-26 10:07:07,137 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 267 flow [2021-03-26 10:07:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:07:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:07:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2021-03-26 10:07:07,139 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7986486486486486 [2021-03-26 10:07:07,139 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 591 transitions. [2021-03-26 10:07:07,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 591 transitions. [2021-03-26 10:07:07,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:07,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 591 transitions. [2021-03-26 10:07:07,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,141 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,141 INFO L185 Difference]: Start difference. First operand has 46 places, 40 transitions, 219 flow. Second operand 4 states and 591 transitions. [2021-03-26 10:07:07,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 267 flow [2021-03-26 10:07:07,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 261 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:07:07,144 INFO L241 Difference]: Finished difference. Result has 47 places, 36 transitions, 222 flow [2021-03-26 10:07:07,144 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2021-03-26 10:07:07,145 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2021-03-26 10:07:07,145 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:07,145 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 36 transitions, 222 flow [2021-03-26 10:07:07,145 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 36 transitions, 222 flow [2021-03-26 10:07:07,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 222 flow [2021-03-26 10:07:07,169 INFO L129 PetriNetUnfolder]: 134/342 cut-off events. [2021-03-26 10:07:07,169 INFO L130 PetriNetUnfolder]: For 371/411 co-relation queries the response was YES. [2021-03-26 10:07:07,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 342 events. 134/342 cut-off events. For 371/411 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2087 event pairs, 60 based on Foata normal form. 1/325 useless extension candidates. Maximal degree in co-relation 934. Up to 192 conditions per place. [2021-03-26 10:07:07,171 INFO L142 LiptonReduction]: Number of co-enabled transitions 382 [2021-03-26 10:07:07,176 INFO L154 LiptonReduction]: Checked pairs total: 259 [2021-03-26 10:07:07,176 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:07,176 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-03-26 10:07:07,181 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 222 flow [2021-03-26 10:07:07,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,182 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:07,182 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:07,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:07:07,182 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1741468862, now seen corresponding path program 1 times [2021-03-26 10:07:07,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:07,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876125804] [2021-03-26 10:07:07,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:07,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:07,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:07,237 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:07:07,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:07:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:07,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876125804] [2021-03-26 10:07:07,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:07,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:07,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368350262] [2021-03-26 10:07:07,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:07,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:07,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:07,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:07,248 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 185 [2021-03-26 10:07:07,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:07,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 185 [2021-03-26 10:07:07,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:07,306 INFO L129 PetriNetUnfolder]: 185/471 cut-off events. [2021-03-26 10:07:07,306 INFO L130 PetriNetUnfolder]: For 740/894 co-relation queries the response was YES. [2021-03-26 10:07:07,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 471 events. 185/471 cut-off events. For 740/894 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3064 event pairs, 81 based on Foata normal form. 22/460 useless extension candidates. Maximal degree in co-relation 1364. Up to 279 conditions per place. [2021-03-26 10:07:07,308 INFO L132 encePairwiseOnDemand]: 177/185 looper letters, 10 selfloop transitions, 16 changer transitions 0/44 dead transitions. [2021-03-26 10:07:07,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 334 flow [2021-03-26 10:07:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:07:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:07:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2021-03-26 10:07:07,310 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7816216216216216 [2021-03-26 10:07:07,310 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2021-03-26 10:07:07,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2021-03-26 10:07:07,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:07,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2021-03-26 10:07:07,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,312 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,312 INFO L185 Difference]: Start difference. First operand has 47 places, 36 transitions, 222 flow. Second operand 5 states and 723 transitions. [2021-03-26 10:07:07,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 334 flow [2021-03-26 10:07:07,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 313 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 10:07:07,315 INFO L241 Difference]: Finished difference. Result has 52 places, 43 transitions, 319 flow [2021-03-26 10:07:07,315 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2021-03-26 10:07:07,316 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2021-03-26 10:07:07,316 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:07,316 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 43 transitions, 319 flow [2021-03-26 10:07:07,316 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 43 transitions, 319 flow [2021-03-26 10:07:07,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 319 flow [2021-03-26 10:07:07,364 INFO L129 PetriNetUnfolder]: 175/452 cut-off events. [2021-03-26 10:07:07,364 INFO L130 PetriNetUnfolder]: For 655/761 co-relation queries the response was YES. [2021-03-26 10:07:07,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1355 conditions, 452 events. 175/452 cut-off events. For 655/761 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2973 event pairs, 74 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 1332. Up to 266 conditions per place. [2021-03-26 10:07:07,368 INFO L142 LiptonReduction]: Number of co-enabled transitions 472 [2021-03-26 10:07:07,380 INFO L154 LiptonReduction]: Checked pairs total: 383 [2021-03-26 10:07:07,380 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:07,380 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 64 [2021-03-26 10:07:07,382 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 319 flow [2021-03-26 10:07:07,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,382 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:07,382 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:07,383 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:07:07,383 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1870044474, now seen corresponding path program 2 times [2021-03-26 10:07:07,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:07,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693298566] [2021-03-26 10:07:07,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:07,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:07,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:07,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:07,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:07,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693298566] [2021-03-26 10:07:07,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:07,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:07:07,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871368826] [2021-03-26 10:07:07,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:07:07,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:07,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:07:07,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:07:07,435 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2021-03-26 10:07:07,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:07,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2021-03-26 10:07:07,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:07,497 INFO L129 PetriNetUnfolder]: 197/492 cut-off events. [2021-03-26 10:07:07,497 INFO L130 PetriNetUnfolder]: For 629/894 co-relation queries the response was YES. [2021-03-26 10:07:07,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 492 events. 197/492 cut-off events. For 629/894 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3128 event pairs, 12 based on Foata normal form. 97/548 useless extension candidates. Maximal degree in co-relation 1687. Up to 313 conditions per place. [2021-03-26 10:07:07,499 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 8 selfloop transitions, 11 changer transitions 3/55 dead transitions. [2021-03-26 10:07:07,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 425 flow [2021-03-26 10:07:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:07:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:07:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 942 transitions. [2021-03-26 10:07:07,501 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8486486486486486 [2021-03-26 10:07:07,501 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 942 transitions. [2021-03-26 10:07:07,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 942 transitions. [2021-03-26 10:07:07,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:07,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 942 transitions. [2021-03-26 10:07:07,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,505 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,505 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 319 flow. Second operand 6 states and 942 transitions. [2021-03-26 10:07:07,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 425 flow [2021-03-26 10:07:07,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 423 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 10:07:07,508 INFO L241 Difference]: Finished difference. Result has 60 places, 50 transitions, 405 flow [2021-03-26 10:07:07,509 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=405, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2021-03-26 10:07:07,509 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2021-03-26 10:07:07,509 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:07,509 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 50 transitions, 405 flow [2021-03-26 10:07:07,509 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 50 transitions, 405 flow [2021-03-26 10:07:07,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 50 transitions, 405 flow [2021-03-26 10:07:07,532 INFO L129 PetriNetUnfolder]: 100/330 cut-off events. [2021-03-26 10:07:07,532 INFO L130 PetriNetUnfolder]: For 787/831 co-relation queries the response was YES. [2021-03-26 10:07:07,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 330 events. 100/330 cut-off events. For 787/831 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2145 event pairs, 11 based on Foata normal form. 1/326 useless extension candidates. Maximal degree in co-relation 1310. Up to 206 conditions per place. [2021-03-26 10:07:07,535 INFO L142 LiptonReduction]: Number of co-enabled transitions 560 [2021-03-26 10:07:07,551 INFO L154 LiptonReduction]: Checked pairs total: 999 [2021-03-26 10:07:07,551 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:07:07,551 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-26 10:07:07,552 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 397 flow [2021-03-26 10:07:07,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,552 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:07,552 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:07,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:07:07,552 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:07,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:07,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2027308544, now seen corresponding path program 1 times [2021-03-26 10:07:07,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:07,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157141950] [2021-03-26 10:07:07,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:07,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:07,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:07,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:07,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:07,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:07,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:07,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157141950] [2021-03-26 10:07:07,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:07,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:07:07,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528567686] [2021-03-26 10:07:07,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:07:07,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:07,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:07:07,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:07:07,648 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2021-03-26 10:07:07,648 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 397 flow. Second operand has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,648 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:07,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2021-03-26 10:07:07,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:07,706 INFO L129 PetriNetUnfolder]: 143/356 cut-off events. [2021-03-26 10:07:07,706 INFO L130 PetriNetUnfolder]: For 899/1100 co-relation queries the response was YES. [2021-03-26 10:07:07,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 356 events. 143/356 cut-off events. For 899/1100 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 1985 event pairs, 0 based on Foata normal form. 65/382 useless extension candidates. Maximal degree in co-relation 1492. Up to 211 conditions per place. [2021-03-26 10:07:07,708 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 5 selfloop transitions, 11 changer transitions 9/53 dead transitions. [2021-03-26 10:07:07,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 443 flow [2021-03-26 10:07:07,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:07:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:07:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1093 transitions. [2021-03-26 10:07:07,710 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.844015444015444 [2021-03-26 10:07:07,710 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1093 transitions. [2021-03-26 10:07:07,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1093 transitions. [2021-03-26 10:07:07,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:07,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1093 transitions. [2021-03-26 10:07:07,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.14285714285714) internal successors, (1093), 7 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,715 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:07,715 INFO L185 Difference]: Start difference. First operand has 60 places, 49 transitions, 397 flow. Second operand 7 states and 1093 transitions. [2021-03-26 10:07:07,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 443 flow [2021-03-26 10:07:07,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 414 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-26 10:07:07,720 INFO L241 Difference]: Finished difference. Result has 63 places, 42 transitions, 319 flow [2021-03-26 10:07:07,720 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2021-03-26 10:07:07,720 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2021-03-26 10:07:07,720 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:07,720 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 42 transitions, 319 flow [2021-03-26 10:07:07,720 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 42 transitions, 319 flow [2021-03-26 10:07:07,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 42 transitions, 319 flow [2021-03-26 10:07:07,730 INFO L129 PetriNetUnfolder]: 25/118 cut-off events. [2021-03-26 10:07:07,730 INFO L130 PetriNetUnfolder]: For 216/218 co-relation queries the response was YES. [2021-03-26 10:07:07,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 118 events. 25/118 cut-off events. For 216/218 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 509 event pairs, 1 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 441. Up to 39 conditions per place. [2021-03-26 10:07:07,731 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-26 10:07:07,992 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 10:07:08,106 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 10:07:08,405 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:07:08,561 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:07:08,567 INFO L154 LiptonReduction]: Checked pairs total: 731 [2021-03-26 10:07:08,567 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:07:08,567 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 847 [2021-03-26 10:07:08,567 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 305 flow [2021-03-26 10:07:08,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:07:08,568 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:08,568 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:08,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:07:08,568 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:08,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:08,568 INFO L82 PathProgramCache]: Analyzing trace with hash -381113634, now seen corresponding path program 1 times [2021-03-26 10:07:08,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:08,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913636853] [2021-03-26 10:07:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:07:08,608 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:07:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:07:08,642 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:07:08,661 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:07:08,661 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:07:08,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:07:08,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:07:08 BasicIcfg [2021-03-26 10:07:08,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:07:08,724 INFO L168 Benchmark]: Toolchain (without parser) took 9116.65 ms. Allocated memory was 255.9 MB in the beginning and 629.1 MB in the end (delta: 373.3 MB). Free memory was 235.5 MB in the beginning and 528.8 MB in the end (delta: -293.2 MB). Peak memory consumption was 81.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:07:08,724 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 238.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:07:08,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.33 ms. Allocated memory was 255.9 MB in the beginning and 413.1 MB in the end (delta: 157.3 MB). Free memory was 234.9 MB in the beginning and 375.8 MB in the end (delta: -140.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:07:08,725 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.47 ms. Allocated memory is still 413.1 MB. Free memory was 375.8 MB in the beginning and 373.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:07:08,725 INFO L168 Benchmark]: Boogie Preprocessor took 22.06 ms. Allocated memory is still 413.1 MB. Free memory was 373.0 MB in the beginning and 370.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:07:08,725 INFO L168 Benchmark]: RCFGBuilder took 1339.78 ms. Allocated memory is still 413.1 MB. Free memory was 370.9 MB in the beginning and 198.5 MB in the end (delta: 172.4 MB). Peak memory consumption was 173.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:07:08,725 INFO L168 Benchmark]: TraceAbstraction took 7338.29 ms. Allocated memory was 413.1 MB in the beginning and 629.1 MB in the end (delta: 216.0 MB). Free memory was 197.4 MB in the beginning and 528.8 MB in the end (delta: -331.3 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:07:08,726 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.10 ms. Allocated memory is still 255.9 MB. Free memory is still 238.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 366.33 ms. Allocated memory was 255.9 MB in the beginning and 413.1 MB in the end (delta: 157.3 MB). Free memory was 234.9 MB in the beginning and 375.8 MB in the end (delta: -140.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.47 ms. Allocated memory is still 413.1 MB. Free memory was 375.8 MB in the beginning and 373.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 22.06 ms. Allocated memory is still 413.1 MB. Free memory was 373.0 MB in the beginning and 370.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1339.78 ms. Allocated memory is still 413.1 MB. Free memory was 370.9 MB in the beginning and 198.5 MB in the end (delta: 172.4 MB). Peak memory consumption was 173.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 7338.29 ms. Allocated memory was 413.1 MB in the beginning and 629.1 MB in the end (delta: 216.0 MB). Free memory was 197.4 MB in the beginning and 528.8 MB in the end (delta: -331.3 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2556.8ms, 107 PlacesBefore, 47 PlacesAfterwards, 99 TransitionsBefore, 38 TransitionsAfterwards, 1862 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 3648 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1920, positive: 1816, positive conditional: 1816, positive unconditional: 0, negative: 104, negative conditional: 104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1920, positive: 1816, positive conditional: 0, positive unconditional: 1816, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1920, positive: 1816, positive conditional: 0, positive unconditional: 1816, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1343, positive: 1305, positive conditional: 0, positive unconditional: 1305, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1343, positive: 1298, positive conditional: 0, positive unconditional: 1298, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 442, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 425, negative conditional: 0, negative unconditional: 425, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1920, positive: 511, positive conditional: 0, positive unconditional: 511, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 1343, unknown conditional: 0, unknown unconditional: 1343] , Statistics on independence cache: Total cache size (in pairs): 1343, Positive cache size: 1305, Positive conditional cache size: 0, Positive unconditional cache size: 1305, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 862.7ms, 44 PlacesBefore, 35 PlacesAfterwards, 35 TransitionsBefore, 26 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 1636 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 426, positive: 320, positive conditional: 320, positive unconditional: 0, negative: 106, negative conditional: 106, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 426, positive: 320, positive conditional: 21, positive unconditional: 299, negative: 106, negative conditional: 4, negative unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 426, positive: 320, positive conditional: 21, positive unconditional: 299, negative: 106, negative conditional: 4, negative unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 84, positive: 66, positive conditional: 3, positive unconditional: 63, negative: 18, negative conditional: 1, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 84, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 18, negative conditional: 1, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 150, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 130, negative conditional: 34, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 426, positive: 254, positive conditional: 18, positive unconditional: 236, negative: 88, negative conditional: 3, negative unconditional: 85, unknown: 84, unknown conditional: 4, unknown unconditional: 80] , Statistics on independence cache: Total cache size (in pairs): 1427, Positive cache size: 1371, Positive conditional cache size: 3, Positive unconditional cache size: 1368, Negative cache size: 56, Negative conditional cache size: 1, Negative unconditional cache size: 55, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1190.2ms, 41 PlacesBefore, 36 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 795 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 218, positive: 173, positive conditional: 173, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 218, positive: 173, positive conditional: 0, positive unconditional: 173, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 218, positive: 173, positive conditional: 0, positive unconditional: 173, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 218, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1440, Positive cache size: 1383, Positive conditional cache size: 3, Positive unconditional cache size: 1380, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 44 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.0ms, 38 PlacesBefore, 38 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 341 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1443, Positive cache size: 1386, Positive conditional cache size: 3, Positive unconditional cache size: 1383, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.6ms, 40 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 396 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1443, Positive cache size: 1386, Positive conditional cache size: 3, Positive unconditional cache size: 1383, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.4ms, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 879 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, positive: 150, positive conditional: 150, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 186, positive: 150, positive conditional: 56, positive unconditional: 94, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 186, positive: 150, positive conditional: 56, positive unconditional: 94, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 12, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 186, positive: 135, positive conditional: 44, positive unconditional: 91, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 15, unknown conditional: 12, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1458, Positive cache size: 1401, Positive conditional cache size: 15, Positive unconditional cache size: 1386, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.0ms, 47 PlacesBefore, 47 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 259 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, positive: 45, positive conditional: 2, positive unconditional: 43, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 45, positive conditional: 2, positive unconditional: 43, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, positive: 42, positive conditional: 2, positive unconditional: 40, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1461, Positive cache size: 1404, Positive conditional cache size: 15, Positive unconditional cache size: 1389, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.1ms, 52 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 383 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, positive: 93, positive conditional: 93, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, positive: 93, positive conditional: 16, positive unconditional: 77, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 93, positive conditional: 16, positive unconditional: 77, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, positive: 88, positive conditional: 16, positive unconditional: 72, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1466, Positive cache size: 1409, Positive conditional cache size: 15, Positive unconditional cache size: 1394, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.1ms, 60 PlacesBefore, 60 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 999 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 327, positive: 291, positive conditional: 291, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 327, positive: 291, positive conditional: 91, positive unconditional: 200, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 327, positive: 291, positive conditional: 91, positive unconditional: 200, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 327, positive: 283, positive conditional: 84, positive unconditional: 199, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1474, Positive cache size: 1417, Positive conditional cache size: 22, Positive unconditional cache size: 1395, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 120 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 846.5ms, 63 PlacesBefore, 59 PlacesAfterwards, 42 TransitionsBefore, 39 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 731 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 231, positive: 192, positive conditional: 192, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 231, positive: 192, positive conditional: 57, positive unconditional: 135, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 231, positive: 192, positive conditional: 57, positive unconditional: 135, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 231, positive: 187, positive conditional: 52, positive unconditional: 135, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1479, Positive cache size: 1422, Positive conditional cache size: 27, Positive unconditional cache size: 1395, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 87 - 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; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L810] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L810] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L811] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L811] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L812] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L812] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L813] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L814] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L814] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L782] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L821] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L821] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L821] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L854] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L854] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L854] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 7174.5ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 609.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2631.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 63 SDtfs, 39 SDslu, 33 SDs, 0 SdLazy, 151 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 121.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 86.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=8, InterpolantAutomatonStates: 42, 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: 25.6ms SsaConstructionTime, 236.6ms SatisfiabilityAnalysisTime, 368.6ms InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...