/usr/bin/java -Xmx8000000000 -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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:13:43,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:13:43,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:13:43,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:13:43,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:13:43,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:13:43,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:13:43,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:13:43,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:13:43,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:13:43,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:13:43,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:13:43,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:13:43,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:13:43,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:13:43,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:13:43,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:13:43,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:13:43,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:13:43,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:13:43,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:13:43,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:13:43,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:13:43,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:13:43,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:13:43,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:13:43,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:13:43,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:13:43,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:13:43,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:13:43,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:13:43,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:13:43,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:13:43,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:13:43,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:13:43,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:13:43,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:13:43,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:13:43,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:13:43,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:13:43,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:13:43,665 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:13:43,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:13:43,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:13:43,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:13:43,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:13:43,696 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:13:43,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:13:43,697 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:13:43,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:13:43,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:13:43,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:13:43,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:13:43,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:13:43,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:13:43,698 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:13:43,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:13:43,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:13:43,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:13:43,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:13:43,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:13:43,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:13:43,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:13:43,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:13:43,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:13:43,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:13:43,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:13:43,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:13:43,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:13:43,699 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:13:43,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-06 04:13:43,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:13:43,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:13:43,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:13:43,989 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:13:43,989 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:13:43,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-06 04:13:44,929 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:13:45,160 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:13:45,160 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-06 04:13:45,170 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed51b21e/2a33d91171f3499b98639f6402e75440/FLAG4e6313f02 [2022-12-06 04:13:45,185 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed51b21e/2a33d91171f3499b98639f6402e75440 [2022-12-06 04:13:45,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:13:45,188 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:13:45,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:13:45,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:13:45,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:13:45,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6675c208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45, skipping insertion in model container [2022-12-06 04:13:45,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:13:45,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:13:45,388 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-06 04:13:45,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:13:45,593 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:13:45,605 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-06 04:13:45,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:45,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:45,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:13:45,691 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:13:45,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45 WrapperNode [2022-12-06 04:13:45,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:13:45,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:13:45,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:13:45,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:13:45,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,751 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2022-12-06 04:13:45,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:13:45,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:13:45,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:13:45,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:13:45,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,790 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:13:45,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:13:45,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:13:45,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:13:45,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (1/1) ... [2022-12-06 04:13:45,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:13:45,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:13:45,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:13:45,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:13:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:13:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:13:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:13:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:13:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:13:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:13:45,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:13:45,866 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:13:45,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:13:45,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:13:45,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:13:45,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:13:45,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:13:45,868 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:13:46,034 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:13:46,036 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:13:46,266 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:13:46,378 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:13:46,379 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:13:46,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:13:46 BoogieIcfgContainer [2022-12-06 04:13:46,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:13:46,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:13:46,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:13:46,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:13:46,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:13:45" (1/3) ... [2022-12-06 04:13:46,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2a4602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:13:46, skipping insertion in model container [2022-12-06 04:13:46,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:45" (2/3) ... [2022-12-06 04:13:46,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2a4602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:13:46, skipping insertion in model container [2022-12-06 04:13:46,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:13:46" (3/3) ... [2022-12-06 04:13:46,387 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-06 04:13:46,400 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:13:46,400 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:13:46,400 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:13:46,447 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:13:46,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-06 04:13:46,508 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-06 04:13:46,508 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:46,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 04:13:46,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-06 04:13:46,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-06 04:13:46,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:46,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-06 04:13:46,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2022-12-06 04:13:46,562 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-06 04:13:46,562 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:46,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 04:13:46,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-06 04:13:46,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-06 04:13:49,682 INFO L203 LiptonReduction]: Total number of compositions: 72 [2022-12-06 04:13:49,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:13:49,704 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54ab346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:13:49,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:13:49,707 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:13:49,707 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:49,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:49,708 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:13:49,709 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:13:49,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:49,712 INFO L85 PathProgramCache]: Analyzing trace with hash 404667, now seen corresponding path program 1 times [2022-12-06 04:13:49,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:49,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983855589] [2022-12-06 04:13:49,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:49,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:13:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:50,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983855589] [2022-12-06 04:13:50,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983855589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:50,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:50,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:13:50,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082284318] [2022-12-06 04:13:50,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:50,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:13:50,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:50,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:13:50,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:13:50,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 04:13:50,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:50,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:50,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 04:13:50,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:50,168 INFO L130 PetriNetUnfolder]: 214/410 cut-off events. [2022-12-06 04:13:50,168 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:13:50,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 410 events. 214/410 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1816 event pairs, 25 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 785. Up to 307 conditions per place. [2022-12-06 04:13:50,172 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 23 selfloop transitions, 2 changer transitions 6/32 dead transitions. [2022-12-06 04:13:50,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 135 flow [2022-12-06 04:13:50,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:13:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:13:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 04:13:50,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2022-12-06 04:13:50,181 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 39 transitions. [2022-12-06 04:13:50,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 135 flow [2022-12-06 04:13:50,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:13:50,185 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 40 flow [2022-12-06 04:13:50,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2022-12-06 04:13:50,188 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-06 04:13:50,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:50,189 INFO L89 Accepts]: Start accepts. Operand has 26 places, 16 transitions, 40 flow [2022-12-06 04:13:50,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:50,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:50,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 16 transitions, 40 flow [2022-12-06 04:13:50,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-06 04:13:50,195 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 04:13:50,195 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:50,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:13:50,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-06 04:13:50,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 04:13:50,275 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:13:50,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 04:13:50,277 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-06 04:13:50,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:50,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:50,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:50,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:13:50,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:13:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash 84158392, now seen corresponding path program 1 times [2022-12-06 04:13:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:50,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303088698] [2022-12-06 04:13:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:50,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:13:50,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:50,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303088698] [2022-12-06 04:13:50,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303088698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:50,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:50,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:13:50,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643504286] [2022-12-06 04:13:50,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:50,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:13:50,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:50,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:13:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:13:50,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 04:13:50,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:50,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:50,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 04:13:50,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:50,493 INFO L130 PetriNetUnfolder]: 140/249 cut-off events. [2022-12-06 04:13:50,493 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 04:13:50,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 249 events. 140/249 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 830 event pairs, 56 based on Foata normal form. 2/251 useless extension candidates. Maximal degree in co-relation 525. Up to 235 conditions per place. [2022-12-06 04:13:50,495 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 19 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2022-12-06 04:13:50,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 100 flow [2022-12-06 04:13:50,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:13:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:13:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 04:13:50,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-06 04:13:50,496 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 23 transitions. [2022-12-06 04:13:50,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 100 flow [2022-12-06 04:13:50,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:13:50,497 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2022-12-06 04:13:50,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2022-12-06 04:13:50,498 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -5 predicate places. [2022-12-06 04:13:50,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:50,498 INFO L89 Accepts]: Start accepts. Operand has 23 places, 17 transitions, 53 flow [2022-12-06 04:13:50,498 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:50,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:50,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-06 04:13:50,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 17 transitions, 53 flow [2022-12-06 04:13:50,503 INFO L130 PetriNetUnfolder]: 3/27 cut-off events. [2022-12-06 04:13:50,503 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:50,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 27 events. 3/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2022-12-06 04:13:50,503 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-06 04:13:50,503 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-06 04:13:50,548 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:13:50,549 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 04:13:50,549 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2022-12-06 04:13:50,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:50,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:50,549 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:50,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:13:50,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:13:50,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:50,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1686056336, now seen corresponding path program 1 times [2022-12-06 04:13:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:50,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936481251] [2022-12-06 04:13:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:13:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:50,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936481251] [2022-12-06 04:13:50,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936481251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:50,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:50,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:13:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403614384] [2022-12-06 04:13:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:50,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:13:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:50,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:13:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:13:50,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 04:13:50,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:50,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:50,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 04:13:50,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:50,735 INFO L130 PetriNetUnfolder]: 67/153 cut-off events. [2022-12-06 04:13:50,736 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-12-06 04:13:50,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 153 events. 67/153 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 530 event pairs, 13 based on Foata normal form. 24/176 useless extension candidates. Maximal degree in co-relation 338. Up to 68 conditions per place. [2022-12-06 04:13:50,737 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 26 selfloop transitions, 5 changer transitions 9/42 dead transitions. [2022-12-06 04:13:50,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 42 transitions, 194 flow [2022-12-06 04:13:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:13:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:13:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 04:13:50,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 04:13:50,739 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 5 states and 45 transitions. [2022-12-06 04:13:50,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 42 transitions, 194 flow [2022-12-06 04:13:50,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 42 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:13:50,740 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 87 flow [2022-12-06 04:13:50,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-06 04:13:50,741 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2022-12-06 04:13:50,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:50,741 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 87 flow [2022-12-06 04:13:50,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:50,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:50,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 87 flow [2022-12-06 04:13:50,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 87 flow [2022-12-06 04:13:50,746 INFO L130 PetriNetUnfolder]: 6/42 cut-off events. [2022-12-06 04:13:50,746 INFO L131 PetriNetUnfolder]: For 11/12 co-relation queries the response was YES. [2022-12-06 04:13:50,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 42 events. 6/42 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 2 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 86. Up to 12 conditions per place. [2022-12-06 04:13:50,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 87 flow [2022-12-06 04:13:50,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 04:13:50,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L820-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [386] L800-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-06 04:13:50,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:13:50,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 04:13:50,781 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 85 flow [2022-12-06 04:13:50,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:50,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:50,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:50,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:13:50,782 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:13:50,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:50,782 INFO L85 PathProgramCache]: Analyzing trace with hash -659898499, now seen corresponding path program 1 times [2022-12-06 04:13:50,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:50,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982782241] [2022-12-06 04:13:50,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:50,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:13:50,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:50,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982782241] [2022-12-06 04:13:50,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982782241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:50,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:50,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:13:50,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887685209] [2022-12-06 04:13:50,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:50,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:13:50,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:50,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:13:50,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:13:50,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:13:50,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 85 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:50,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:50,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:13:50,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:50,918 INFO L130 PetriNetUnfolder]: 50/117 cut-off events. [2022-12-06 04:13:50,918 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-06 04:13:50,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 117 events. 50/117 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 338 event pairs, 11 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 343. Up to 92 conditions per place. [2022-12-06 04:13:50,919 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 21 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2022-12-06 04:13:50,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 154 flow [2022-12-06 04:13:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:13:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:13:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 04:13:50,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-06 04:13:50,920 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 85 flow. Second operand 3 states and 23 transitions. [2022-12-06 04:13:50,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 154 flow [2022-12-06 04:13:50,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 152 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 04:13:50,922 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 86 flow [2022-12-06 04:13:50,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-12-06 04:13:50,923 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2022-12-06 04:13:50,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:50,923 INFO L89 Accepts]: Start accepts. Operand has 31 places, 19 transitions, 86 flow [2022-12-06 04:13:50,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:50,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:50,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 19 transitions, 86 flow [2022-12-06 04:13:50,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 19 transitions, 86 flow [2022-12-06 04:13:50,928 INFO L130 PetriNetUnfolder]: 4/32 cut-off events. [2022-12-06 04:13:50,928 INFO L131 PetriNetUnfolder]: For 12/13 co-relation queries the response was YES. [2022-12-06 04:13:50,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 32 events. 4/32 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 71. Up to 10 conditions per place. [2022-12-06 04:13:50,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 19 transitions, 86 flow [2022-12-06 04:13:50,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-06 04:13:50,937 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:13:50,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:13:50,939 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 86 flow [2022-12-06 04:13:50,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:50,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:50,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:50,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:13:50,939 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:13:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1766545883, now seen corresponding path program 1 times [2022-12-06 04:13:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:50,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853077525] [2022-12-06 04:13:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:13:51,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:51,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853077525] [2022-12-06 04:13:51,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853077525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:51,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:51,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:13:51,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205822374] [2022-12-06 04:13:51,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:51,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:13:51,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:51,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:13:51,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:13:51,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 04:13:51,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:51,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:51,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 04:13:51,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:51,182 INFO L130 PetriNetUnfolder]: 25/72 cut-off events. [2022-12-06 04:13:51,182 INFO L131 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2022-12-06 04:13:51,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 72 events. 25/72 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 183 event pairs, 10 based on Foata normal form. 9/80 useless extension candidates. Maximal degree in co-relation 206. Up to 32 conditions per place. [2022-12-06 04:13:51,183 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 20 selfloop transitions, 6 changer transitions 6/34 dead transitions. [2022-12-06 04:13:51,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 200 flow [2022-12-06 04:13:51,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:13:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:13:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-06 04:13:51,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 04:13:51,186 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 86 flow. Second operand 6 states and 39 transitions. [2022-12-06 04:13:51,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 200 flow [2022-12-06 04:13:51,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 175 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 04:13:51,189 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 97 flow [2022-12-06 04:13:51,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=97, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2022-12-06 04:13:51,191 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2022-12-06 04:13:51,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:51,192 INFO L89 Accepts]: Start accepts. Operand has 34 places, 20 transitions, 97 flow [2022-12-06 04:13:51,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:51,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:51,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 20 transitions, 97 flow [2022-12-06 04:13:51,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 20 transitions, 97 flow [2022-12-06 04:13:51,202 INFO L130 PetriNetUnfolder]: 2/25 cut-off events. [2022-12-06 04:13:51,203 INFO L131 PetriNetUnfolder]: For 17/18 co-relation queries the response was YES. [2022-12-06 04:13:51,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 25 events. 2/25 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 60. Up to 9 conditions per place. [2022-12-06 04:13:51,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 20 transitions, 97 flow [2022-12-06 04:13:51,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-06 04:13:51,531 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:13:51,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 341 [2022-12-06 04:13:51,533 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 85 flow [2022-12-06 04:13:51,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:51,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:51,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:51,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:13:51,533 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:13:51,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2106435815, now seen corresponding path program 1 times [2022-12-06 04:13:51,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:51,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556851787] [2022-12-06 04:13:51,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:51,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:13:52,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:52,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556851787] [2022-12-06 04:13:52,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556851787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:52,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:52,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:13:52,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865546785] [2022-12-06 04:13:52,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:52,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:13:52,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:52,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:13:52,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:13:52,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:13:52,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 85 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:52,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:52,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:13:52,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:52,129 INFO L130 PetriNetUnfolder]: 25/68 cut-off events. [2022-12-06 04:13:52,130 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 04:13:52,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 68 events. 25/68 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 179 event pairs, 0 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 212. Up to 24 conditions per place. [2022-12-06 04:13:52,130 INFO L137 encePairwiseOnDemand]: 6/13 looper letters, 20 selfloop transitions, 8 changer transitions 9/37 dead transitions. [2022-12-06 04:13:52,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 243 flow [2022-12-06 04:13:52,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:13:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:13:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-12-06 04:13:52,131 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2022-12-06 04:13:52,131 INFO L175 Difference]: Start difference. First operand has 30 places, 17 transitions, 85 flow. Second operand 8 states and 34 transitions. [2022-12-06 04:13:52,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 243 flow [2022-12-06 04:13:52,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 210 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-06 04:13:52,133 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 92 flow [2022-12-06 04:13:52,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=92, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2022-12-06 04:13:52,133 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2022-12-06 04:13:52,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:52,133 INFO L89 Accepts]: Start accepts. Operand has 32 places, 19 transitions, 92 flow [2022-12-06 04:13:52,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:52,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:52,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 19 transitions, 92 flow [2022-12-06 04:13:52,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 92 flow [2022-12-06 04:13:52,137 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2022-12-06 04:13:52,137 INFO L131 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2022-12-06 04:13:52,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 23 events. 3/23 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 51. Up to 6 conditions per place. [2022-12-06 04:13:52,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 19 transitions, 92 flow [2022-12-06 04:13:52,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 04:13:52,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [393] $Ultimate##0-->L793: Formula: (let ((.cse3 (= (mod v_~z$r_buff1_thd2~0_218 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd2~0_213 256) 0))) (let ((.cse9 (not .cse7)) (.cse8 (and .cse3 .cse7)) (.cse10 (and (= (mod v_~z$w_buff1_used~0_364 256) 0) .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_412 256) 0))) (let ((.cse1 (= (mod v_~z$w_buff1_used~0_363 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_83 256) 0))) (.cse4 (= (mod v_~z$w_buff0_used~0_411 256) 0)) (.cse5 (or .cse8 .cse10 .cse11)) (.cse6 (and .cse9 (not .cse11)))) (and (= v_~z$mem_tmp~0_73 v_~z~0_319) (= v_~y~0_44 v_~__unbuffered_p1_EAX~0_83) (= v_P1Thread1of1ForFork1_~arg.base_23 |v_P1Thread1of1ForFork1_#in~arg.base_23|) (= v_~z$w_buff1~0_217 v_~z$w_buff1~0_216) (= v_~z$r_buff1_thd2~0_217 (ite .cse0 v_~z$r_buff1_thd2~0_218 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd2~0_212 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~z$r_buff1_thd2~0_218 0))) (= (ite .cse0 v_~z$w_buff0_used~0_412 (ite .cse5 v_~z$w_buff0_used~0_412 (ite .cse6 0 v_~z$w_buff0_used~0_412))) v_~z$w_buff0_used~0_411) (= v_~z$r_buff0_thd2~0_212 (ite .cse0 v_~z$r_buff0_thd2~0_213 (ite (or (and .cse1 .cse7) .cse8 .cse4) v_~z$r_buff0_thd2~0_213 (ite (and .cse9 (not .cse4)) 0 v_~z$r_buff0_thd2~0_213)))) (= v_~z$flush_delayed~0_84 0) (= v_~y~0_44 1) (= v_~z$w_buff0~0_261 v_~z$w_buff0~0_260) (= v_~weak$$choice0~0_54 |v_P1Thread1of1ForFork1_#t~nondet3_80|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_23| v_P1Thread1of1ForFork1_~arg.offset_23) (= v_~z~0_318 (ite .cse0 v_~z$mem_tmp~0_73 v_~__unbuffered_p1_EBX~0_104)) (= v_~z$w_buff1_used~0_363 (ite .cse0 v_~z$w_buff1_used~0_364 (ite (or .cse8 .cse10 .cse4) v_~z$w_buff1_used~0_364 0))) (= (ite .cse5 v_~z~0_319 (ite .cse6 v_~z$w_buff0~0_261 v_~z$w_buff1~0_217)) v_~__unbuffered_p1_EBX~0_104) (= v_~x~0_40 1) (= v_~weak$$choice2~0_83 |v_P1Thread1of1ForFork1_#t~nondet4_80|))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_412, ~z$w_buff0~0=v_~z$w_buff0~0_261, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_218, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_80|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_364, ~z$w_buff1~0=v_~z$w_buff1~0_217, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~z~0=v_~z~0_319, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_73, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_104, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_411, ~z$w_buff0~0=v_~z$w_buff0~0_260, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_217, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_363, ~z$w_buff1~0=v_~z$w_buff1~0_216, ~z$flush_delayed~0=v_~z$flush_delayed~0_84, ~weak$$choice0~0=v_~weak$$choice0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_83, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~z~0=v_~z~0_318, ~weak$$choice2~0=v_~weak$$choice2~0_83, ~y~0=v_~y~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_212, ~x~0=v_~x~0_40} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet4, ~z$r_buff1_thd2~0, P1Thread1of1ForFork1_#t~nondet3, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, ~z~0, ~weak$$choice2~0, ~y~0, ~z$r_buff0_thd2~0, ~x~0] and [287] L754-->L761: Formula: (let ((.cse1 (not (= (mod v_~z$w_buff0_used~0_105 256) 0))) (.cse0 (not (= (mod v_~z$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_27 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_106 256) 0)))) (.cse3 (and (not (= (mod v_~z$w_buff1_used~0_99 256) 0)) .cse0)) (.cse4 (and .cse1 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_98 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_26 256) 0)))) 0 v_~z$r_buff1_thd1~0_18) v_~z$r_buff1_thd1~0_17) (= v_~z$w_buff0_used~0_105 (ite .cse2 0 v_~z$w_buff0_used~0_106)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_99) v_~z$w_buff1_used~0_98) (= v_~z~0_74 (ite .cse2 v_~z$w_buff0~0_54 (ite .cse3 v_~z$w_buff1~0_43 v_~z~0_75))) (= v_~z$r_buff0_thd1~0_26 (ite .cse4 0 v_~z$r_buff0_thd1~0_27))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_54, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_99, ~z$w_buff1~0=v_~z$w_buff1~0_43, ~z~0=v_~z~0_75, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_54, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_98, ~z$w_buff1~0=v_~z$w_buff1~0_43, ~z~0=v_~z~0_74, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-06 04:13:54,194 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] $Ultimate##0-->L751: Formula: (and (= |v_P0Thread1of1ForFork0_~arg#1.offset_7| |v_P0Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_176 256) 0)) (not (= (mod v_~z$w_buff0_used~0_196 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~z$w_buff0_used~0_197 v_~z$w_buff1_used~0_176) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~z$w_buff0~0_116 1) (= v_~z$w_buff0~0_117 v_~z$w_buff1~0_94) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= |v_P0Thread1of1ForFork0_~arg#1.base_7| |v_P0Thread1of1ForFork0_#in~arg#1.base_7|) (= v_~z$w_buff0_used~0_196 1) (= v_~z$r_buff0_thd0~0_81 v_~z$r_buff1_thd0~0_80) (= v_~z$r_buff0_thd1~0_56 1) (= v_~z$r_buff0_thd1~0_57 v_~z$r_buff1_thd1~0_39) (= v_~z$r_buff0_thd2~0_105 v_~z$r_buff1_thd2~0_105)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_197, ~z$w_buff0~0=v_~z$w_buff0~0_117, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_105} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_196, ~z$w_buff0~0=v_~z$w_buff0~0_116, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_105, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_176, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_7|, ~z$w_buff1~0=v_~z$w_buff1~0_94, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_80, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_56, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_105} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0_~arg#1.base, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg#1.offset, ~z$r_buff0_thd1~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [394] $Ultimate##0-->L761: Formula: (let ((.cse6 (= (mod v_~z$r_buff1_thd2~0_229 256) 0)) (.cse12 (= (mod v_~z$r_buff0_thd2~0_224 256) 0))) (let ((.cse13 (not .cse12)) (.cse20 (= (mod v_~z$w_buff0_used~0_426 256) 0)) (.cse19 (and .cse12 (= (mod v_~z$w_buff1_used~0_377 256) 0))) (.cse11 (and .cse12 .cse6))) (let ((.cse2 (not (= (mod v_~weak$$choice2~0_85 256) 0))) (.cse9 (or .cse20 .cse19 .cse11)) (.cse10 (and .cse13 (not .cse20)))) (let ((.cse1 (ite .cse2 v_~z$w_buff0_used~0_426 (ite .cse9 v_~z$w_buff0_used~0_426 (ite .cse10 0 v_~z$w_buff0_used~0_426))))) (let ((.cse3 (= (mod .cse1 256) 0))) (let ((.cse15 (ite .cse2 v_~z$w_buff1_used~0_377 (ite (or .cse3 .cse19 .cse11) v_~z$w_buff1_used~0_377 0)))) (let ((.cse16 (not (= (mod v_~z$w_buff0_used~0_424 256) 0))) (.cse17 (not (= (mod v_~z$r_buff1_thd1~0_117 256) 0))) (.cse4 (= (mod .cse15 256) 0)) (.cse14 (not .cse3)) (.cse18 (not (= (mod v_~z$r_buff0_thd1~0_174 256) 0)))) (let ((.cse0 (and .cse14 .cse18)) (.cse7 (and .cse17 (not .cse4))) (.cse8 (and .cse16 .cse18))) (and (= v_~z$w_buff0~0_269 v_~z$w_buff0~0_268) (= v_~y~0_46 v_~__unbuffered_p1_EAX~0_85) (= |v_P1Thread1of1ForFork1_#in~arg.offset_25| v_P1Thread1of1ForFork1_~arg.offset_25) (= v_~z$w_buff0_used~0_424 (ite .cse0 0 .cse1)) (= v_~y~0_46 1) (= v_~weak$$choice0~0_56 |v_P1Thread1of1ForFork1_#t~nondet3_84|) (= v_~x~0_42 1) (= v_~z$r_buff1_thd2~0_228 (ite .cse2 v_~z$r_buff1_thd2~0_229 (ite (let ((.cse5 (= (mod v_~z$r_buff0_thd2~0_223 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse6 .cse5))) v_~z$r_buff1_thd2~0_229 0))) (= v_~z~0_330 (ite .cse0 v_~z$w_buff0~0_268 (ite .cse7 v_~z$w_buff1~0_223 (ite .cse2 v_~z$mem_tmp~0_75 v_~__unbuffered_p1_EBX~0_106)))) (= v_~z$flush_delayed~0_86 0) (= v_~z$w_buff1~0_224 v_~z$w_buff1~0_223) (= (ite .cse8 0 v_~z$r_buff0_thd1~0_174) v_~z$r_buff0_thd1~0_173) (= v_~z$mem_tmp~0_75 v_~z~0_332) (= (ite .cse9 v_~z~0_332 (ite .cse10 v_~z$w_buff0~0_269 v_~z$w_buff1~0_224)) v_~__unbuffered_p1_EBX~0_106) (= v_~weak$$choice2~0_85 |v_P1Thread1of1ForFork1_#t~nondet4_84|) (= v_~z$r_buff0_thd2~0_223 (ite .cse2 v_~z$r_buff0_thd2~0_224 (ite (or .cse3 .cse11 (and .cse4 .cse12)) v_~z$r_buff0_thd2~0_224 (ite (and .cse13 .cse14) 0 v_~z$r_buff0_thd2~0_224)))) (= (ite (or .cse7 .cse8) 0 .cse15) v_~z$w_buff1_used~0_375) (= v_P1Thread1of1ForFork1_~arg.base_25 |v_P1Thread1of1ForFork1_#in~arg.base_25|) (= v_~z$r_buff1_thd1~0_116 (ite (or (and .cse16 (not (= (mod v_~z$r_buff0_thd1~0_173 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_375 256) 0)) .cse17)) 0 v_~z$r_buff1_thd1~0_117))))))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_426, ~z$w_buff0~0=v_~z$w_buff0~0_269, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_84|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_229, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_84|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_377, ~z$w_buff1~0=v_~z$w_buff1~0_224, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_117, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|, ~z~0=v_~z~0_332, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_224} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_75, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_106, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_424, ~z$w_buff0~0=v_~z$w_buff0~0_268, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_25, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_228, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_375, ~z$w_buff1~0=v_~z$w_buff1~0_223, ~z$flush_delayed~0=v_~z$flush_delayed~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_56, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_85, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_116, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_25|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_25|, ~z~0=v_~z~0_330, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_223, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet4, ~z$r_buff1_thd2~0, P1Thread1of1ForFork1_#t~nondet3, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd1~0, ~z~0, ~z$r_buff0_thd1~0, ~weak$$choice2~0, ~y~0, ~z$r_buff0_thd2~0, ~x~0] [2022-12-06 04:13:54,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L761: Formula: (let ((.cse10 (= (mod v_~z$w_buff0_used~0_456 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd2~0_249 256) 0))) (let ((.cse14 (and .cse10 .cse6))) (let ((.cse2 (not (= (mod v_~weak$$choice2~0_90 256) 0))) (.cse11 (or .cse14 .cse6)) (.cse9 (not .cse6))) (let ((.cse13 (ite .cse2 1 (ite .cse11 1 (ite .cse9 0 1))))) (let ((.cse3 (= (mod .cse13 256) 0))) (let ((.cse8 (ite .cse2 v_~z$w_buff0_used~0_456 (ite (or .cse3 .cse14 .cse6) v_~z$w_buff0_used~0_456 0)))) (let ((.cse12 (not (= (mod v_~z$r_buff0_thd1~0_197 256) 0))) (.cse5 (= (mod .cse8 256) 0))) (let ((.cse1 (and .cse12 (not .cse5))) (.cse0 (not .cse3)) (.cse7 (not (= (mod v_~z$w_buff0_used~0_454 256) 0)))) (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_27| v_P1Thread1of1ForFork1_~arg.offset_27) (= v_~z~0_354 (ite .cse0 v_~z$w_buff0~0_292 (ite .cse1 v_~z$w_buff1~0_243 (ite .cse2 v_~z$mem_tmp~0_80 v_~__unbuffered_p1_EBX~0_111)))) (= v_~z$r_buff1_thd2~0_252 (ite .cse2 v_~z$r_buff0_thd2~0_249 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd2~0_248 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff0_thd2~0_249 0))) (= v_~z$w_buff0~0_294 v_~z$w_buff1~0_243) (= v_~z$w_buff1_used~0_401 (ite (or .cse7 .cse1) 0 .cse8)) (= v_~z$r_buff0_thd0~0_192 v_~z$r_buff1_thd0~0_196) (= v_~z$r_buff0_thd2~0_248 (ite .cse2 v_~z$r_buff0_thd2~0_249 (ite (or .cse3 (and .cse5 .cse6) .cse6) v_~z$r_buff0_thd2~0_249 (ite (and .cse9 .cse0) 0 v_~z$r_buff0_thd2~0_249)))) (= (ite .cse10 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61|) (= v_~weak$$choice2~0_90 |v_P1Thread1of1ForFork1_#t~nondet4_94|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_61| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61|) (= (ite .cse11 v_~z~0_355 (ite .cse9 1 v_~z$w_buff0~0_294)) v_~__unbuffered_p1_EBX~0_111) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_61| 0)) (= v_~weak$$choice0~0_61 |v_P1Thread1of1ForFork1_#t~nondet3_94|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_57| |v_P0Thread1of1ForFork0_~arg#1.offset_57|) (= v_P1Thread1of1ForFork1_~arg.base_27 |v_P1Thread1of1ForFork1_#in~arg.base_27|) (= v_~z$r_buff1_thd1~0_129 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_401 256) 0)) .cse12) (and (not (= (mod v_~z$r_buff0_thd1~0_195 256) 0)) .cse7)) 0 v_~z$r_buff0_thd1~0_197)) (= v_~z$w_buff0~0_292 1) (= v_~z$mem_tmp~0_80 v_~z~0_355) (= v_~y~0_48 v_~__unbuffered_p1_EAX~0_87) (= |v_P0Thread1of1ForFork0_~arg#1.base_57| |v_P0Thread1of1ForFork0_#in~arg#1.base_57|) (= v_~z$w_buff0_used~0_454 (ite .cse0 0 .cse13)) (= v_~x~0_44 1) (= v_~z$flush_delayed~0_91 0) (= v_~y~0_48 1) (= (ite .cse7 0 1) v_~z$r_buff0_thd1~0_195)))))))))) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_57|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_456, ~z$w_buff0~0=v_~z$w_buff0~0_294, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_94|, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_94|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_57|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_192, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_27|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_27|, ~z~0=v_~z~0_355, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_197, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_249} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_252, ~z$w_buff1~0=v_~z$w_buff1~0_243, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_57|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_57|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_192, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_196, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_27|, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_61|, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_248, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_61|, ~z$mem_tmp~0=v_~z$mem_tmp~0_80, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_111, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_57|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_454, ~z$w_buff0~0=v_~z$w_buff0~0_292, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_401, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_57|, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~weak$$choice0~0=v_~weak$$choice0~0_61, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_27, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_129, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_27|, ~z~0=v_~z~0_354, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_195, ~weak$$choice2~0=v_~weak$$choice2~0_90, ~x~0=v_~x~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y~0, ~z$r_buff0_thd2~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, ~z$w_buff1_used~0, P0Thread1of1ForFork0_~arg#1.base, ~z$flush_delayed~0, ~weak$$choice0~0, P1Thread1of1ForFork1_~arg.offset, ~z$r_buff1_thd1~0, ~z~0, ~z$r_buff0_thd1~0, ~weak$$choice2~0, ~x~0] and [286] L751-->L754: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 04:13:55,150 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:13:55,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3017 [2022-12-06 04:13:55,151 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 93 flow [2022-12-06 04:13:55,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:55,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:55,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:55,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:13:55,151 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:13:55,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 805906377, now seen corresponding path program 1 times [2022-12-06 04:13:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:55,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236432879] [2022-12-06 04:13:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:13:55,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:13:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:13:55,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:13:55,213 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:13:55,214 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 04:13:55,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 04:13:55,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 04:13:55,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 04:13:55,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 04:13:55,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:13:55,215 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:55,219 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:13:55,219 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:13:55,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:13:55 BasicIcfg [2022-12-06 04:13:55,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:13:55,247 INFO L158 Benchmark]: Toolchain (without parser) took 10059.87ms. Allocated memory was 212.9MB in the beginning and 502.3MB in the end (delta: 289.4MB). Free memory was 187.0MB in the beginning and 213.2MB in the end (delta: -26.3MB). Peak memory consumption was 264.1MB. Max. memory is 8.0GB. [2022-12-06 04:13:55,247 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory was 189.4MB in the beginning and 189.4MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:13:55,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.03ms. Allocated memory is still 212.9MB. Free memory was 186.5MB in the beginning and 161.7MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 04:13:55,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.23ms. Allocated memory is still 212.9MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:13:55,248 INFO L158 Benchmark]: Boogie Preprocessor took 41.63ms. Allocated memory is still 212.9MB. Free memory was 159.1MB in the beginning and 157.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:13:55,248 INFO L158 Benchmark]: RCFGBuilder took 586.51ms. Allocated memory is still 212.9MB. Free memory was 157.0MB in the beginning and 126.1MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 04:13:55,248 INFO L158 Benchmark]: TraceAbstraction took 8864.67ms. Allocated memory was 212.9MB in the beginning and 502.3MB in the end (delta: 289.4MB). Free memory was 125.5MB in the beginning and 213.2MB in the end (delta: -87.7MB). Peak memory consumption was 203.3MB. Max. memory is 8.0GB. [2022-12-06 04:13:55,249 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.10ms. Allocated memory is still 212.9MB. Free memory was 189.4MB in the beginning and 189.4MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 503.03ms. Allocated memory is still 212.9MB. Free memory was 186.5MB in the beginning and 161.7MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.23ms. Allocated memory is still 212.9MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.63ms. Allocated memory is still 212.9MB. Free memory was 159.1MB in the beginning and 157.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 586.51ms. Allocated memory is still 212.9MB. Free memory was 157.0MB in the beginning and 126.1MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8864.67ms. Allocated memory was 212.9MB in the beginning and 502.3MB in the end (delta: 289.4MB). Free memory was 125.5MB in the beginning and 213.2MB in the end (delta: -87.7MB). Peak memory consumption was 203.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 95 PlacesBefore, 28 PlacesAfterwards, 90 TransitionsBefore, 22 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 33 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 945, independent: 898, independent conditional: 898, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 945, independent: 898, independent conditional: 0, independent unconditional: 898, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 945, independent: 898, independent conditional: 0, independent unconditional: 898, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 945, independent: 898, independent conditional: 0, independent unconditional: 898, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 749, independent: 717, independent conditional: 0, independent unconditional: 717, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 749, independent: 709, independent conditional: 0, independent unconditional: 709, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 198, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 945, independent: 181, independent conditional: 0, independent unconditional: 181, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 749, unknown conditional: 0, unknown unconditional: 749] , Statistics on independence cache: Total cache size (in pairs): 1118, Positive cache size: 1086, Positive conditional cache size: 0, Positive unconditional cache size: 1086, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 97, independent: 64, independent conditional: 18, independent unconditional: 46, dependent: 33, dependent conditional: 14, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, independent: 64, independent conditional: 18, independent unconditional: 46, dependent: 33, dependent conditional: 14, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, independent: 64, independent conditional: 18, independent unconditional: 46, dependent: 33, dependent conditional: 14, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, independent: 39, independent conditional: 10, independent unconditional: 29, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 56, dependent conditional: 28, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, independent: 25, independent conditional: 8, independent unconditional: 17, dependent: 17, dependent conditional: 8, dependent unconditional: 9, unknown: 55, unknown conditional: 16, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 41, Positive conditional cache size: 12, Positive unconditional cache size: 29, Negative cache size: 16, Negative conditional cache size: 6, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 2, independent unconditional: 31, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 51, Positive conditional cache size: 12, Positive unconditional cache size: 39, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 35, independent conditional: 21, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 58, Positive conditional cache size: 16, Positive unconditional cache size: 42, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 63, Positive conditional cache size: 16, Positive unconditional cache size: 47, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 33 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 17 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 42, independent conditional: 10, independent unconditional: 32, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 42, independent conditional: 6, independent unconditional: 36, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 42, independent conditional: 6, independent unconditional: 36, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 39, independent conditional: 3, independent unconditional: 36, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 68, Positive conditional cache size: 19, Positive unconditional cache size: 49, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 31 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 26, independent conditional: 20, independent unconditional: 6, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 26, independent conditional: 20, independent unconditional: 6, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 26, independent conditional: 20, independent unconditional: 6, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 12, unknown conditional: 9, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 78, Positive conditional cache size: 24, Positive unconditional cache size: 54, Negative cache size: 30, Negative conditional cache size: 10, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$read_delayed; [L732] 0 int *z$read_delayed_var; [L733] 0 int z$w_buff0; [L734] 0 _Bool z$w_buff0_used; [L735] 0 int z$w_buff1; [L736] 0 _Bool z$w_buff1_used; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L817] 0 pthread_t t897; [L818] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t897, ((void *)0), P0, ((void *)0))=-1, t897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 pthread_t t898; [L820] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t898, ((void *)0), P1, ((void *)0))=0, t897={5:0}, t898={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z$w_buff1 = z$w_buff0 [L743] 1 z$w_buff0 = 1 [L744] 1 z$w_buff1_used = z$w_buff0_used [L745] 1 z$w_buff0_used = (_Bool)1 [L746] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L746] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L747] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L748] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L749] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L750] 1 z$r_buff0_thd1 = (_Bool)1 [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 1 [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 z$flush_delayed = weak$$choice2 [L782] 2 z$mem_tmp = z [L783] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L784] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L786] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = z [L791] 2 z = z$flush_delayed ? z$mem_tmp : z [L792] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L796] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L797] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L798] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L799] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L835] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 282 IncrementalHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 3 mSDtfsCounter, 282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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! [2022-12-06 04:13:55,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...