/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:20:03,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:20:03,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:20:03,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:20:03,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:20:03,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:20:03,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:20:03,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:20:03,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:20:03,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:20:03,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:20:03,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:20:03,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:20:03,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:20:03,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:20:03,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:20:03,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:20:03,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:20:03,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:20:03,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:20:03,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:20:03,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:20:03,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:20:03,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:20:03,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:20:03,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:20:03,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:20:03,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:20:03,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:20:03,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:20:03,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:20:03,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:20:03,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:20:03,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:20:03,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:20:03,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:20:03,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:20:03,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:20:03,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:20:03,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:20:03,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:20:03,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:20:03,718 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:20:03,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:20:03,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:20:03,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:20:03,720 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:20:03,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:20:03,721 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:20:03,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:20:03,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:20:03,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:20:03,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:20:03,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:20:03,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:20:03,722 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:20:03,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:20:03,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:20:03,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:20:03,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:20:03,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:20:03,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:20:03,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:20:03,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:20:03,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:20:03,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:20:03,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:20:03,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:20:03,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:20:03,724 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:20:03,724 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 06:20:04,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:20:04,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:20:04,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:20:04,117 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:20:04,117 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:20:04,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:20:05,314 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:20:05,567 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:20:05,567 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:20:05,610 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbe09caa/e31527bc3b3d4055851341c261ea5d32/FLAG0b5955727 [2022-12-06 06:20:05,626 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbe09caa/e31527bc3b3d4055851341c261ea5d32 [2022-12-06 06:20:05,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:20:05,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:20:05,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:20:05,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:20:05,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:20:05,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:20:05" (1/1) ... [2022-12-06 06:20:05,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12107f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:05, skipping insertion in model container [2022-12-06 06:20:05,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:20:05" (1/1) ... [2022-12-06 06:20:05,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:20:05,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:20:05,877 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-12-06 06:20:06,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:20:06,099 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:20:06,112 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2022-12-06 06:20:06,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:20:06,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:20:06,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:20:06,187 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:20:06,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06 WrapperNode [2022-12-06 06:20:06,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:20:06,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:20:06,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:20:06,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:20:06,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (1/1) ... [2022-12-06 06:20:06,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (1/1) ... [2022-12-06 06:20:06,255 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2022-12-06 06:20:06,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:20:06,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:20:06,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:20:06,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:20:06,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (1/1) ... [2022-12-06 06:20:06,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (1/1) ... [2022-12-06 06:20:06,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (1/1) ... [2022-12-06 06:20:06,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (1/1) ... [2022-12-06 06:20:06,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (1/1) ... [2022-12-06 06:20:06,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (1/1) ... [2022-12-06 06:20:06,294 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (1/1) ... [2022-12-06 06:20:06,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (1/1) ... [2022-12-06 06:20:06,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:20:06,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:20:06,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:20:06,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:20:06,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (1/1) ... [2022-12-06 06:20:06,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:20:06,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:20:06,366 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 06:20:06,431 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 06:20:06,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:20:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:20:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:20:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:20:06,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:20:06,462 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:20:06,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:20:06,463 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:20:06,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:20:06,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:20:06,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:20:06,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:20:06,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:20:06,465 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 06:20:06,643 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:20:06,645 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:20:06,897 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:20:07,014 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:20:07,015 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:20:07,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:20:07 BoogieIcfgContainer [2022-12-06 06:20:07,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:20:07,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:20:07,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:20:07,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:20:07,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:20:05" (1/3) ... [2022-12-06 06:20:07,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a060374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:20:07, skipping insertion in model container [2022-12-06 06:20:07,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:06" (2/3) ... [2022-12-06 06:20:07,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a060374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:20:07, skipping insertion in model container [2022-12-06 06:20:07,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:20:07" (3/3) ... [2022-12-06 06:20:07,027 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:20:07,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:20:07,042 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:20:07,042 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:20:07,096 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:20:07,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2022-12-06 06:20:07,186 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-06 06:20:07,186 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:07,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 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/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 06:20:07,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2022-12-06 06:20:07,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2022-12-06 06:20:07,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:07,210 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-06 06:20:07,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2022-12-06 06:20:07,240 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-06 06:20:07,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:07,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 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/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 06:20:07,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-06 06:20:07,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 1104 [2022-12-06 06:20:10,427 INFO L203 LiptonReduction]: Total number of compositions: 69 [2022-12-06 06:20:10,438 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:20:10,442 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;@146383b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:20:10,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:20:10,444 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 06:20:10,444 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:10,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:10,445 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:20:10,445 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 06:20:10,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash 405418, now seen corresponding path program 1 times [2022-12-06 06:20:10,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:10,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642922679] [2022-12-06 06:20:10,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:10,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:10,728 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 06:20:10,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:10,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642922679] [2022-12-06 06:20:10,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642922679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:10,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:10,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:20:10,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124775466] [2022-12-06 06:20:10,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:10,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:20:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:10,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:20:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:20:10,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 06:20:10,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 06:20:10,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:10,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 06:20:10,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:10,879 INFO L130 PetriNetUnfolder]: 176/345 cut-off events. [2022-12-06 06:20:10,883 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:20:10,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 345 events. 176/345 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1560 event pairs, 20 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 658. Up to 256 conditions per place. [2022-12-06 06:20:10,887 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 21 selfloop transitions, 2 changer transitions 6/31 dead transitions. [2022-12-06 06:20:10,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 129 flow [2022-12-06 06:20:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:20:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:20:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 06:20:10,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-06 06:20:10,896 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 40 transitions. [2022-12-06 06:20:10,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 129 flow [2022-12-06 06:20:10,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:20:10,900 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 40 flow [2022-12-06 06:20:10,902 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 06:20:10,904 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-06 06:20:10,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:10,905 INFO L89 Accepts]: Start accepts. Operand has 26 places, 16 transitions, 40 flow [2022-12-06 06:20:10,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:10,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:10,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 16 transitions, 40 flow [2022-12-06 06:20:10,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-06 06:20:10,918 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 06:20:10,918 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:10,918 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 15 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 06:20:10,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-06 06:20:10,918 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 06:20:10,982 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:10,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 06:20:10,985 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2022-12-06 06:20:10,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 06:20:10,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:10,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:10,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:20:10,988 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 06:20:10,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash 768299595, now seen corresponding path program 1 times [2022-12-06 06:20:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:10,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779791919] [2022-12-06 06:20:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:10,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:11,194 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 06:20:11,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:11,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779791919] [2022-12-06 06:20:11,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779791919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:11,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:11,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:20:11,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785288925] [2022-12-06 06:20:11,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:11,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:20:11,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:11,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:20:11,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:20:11,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 06:20:11,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 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 06:20:11,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:11,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 06:20:11,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:11,245 INFO L130 PetriNetUnfolder]: 171/300 cut-off events. [2022-12-06 06:20:11,245 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 06:20:11,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 300 events. 171/300 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 988 event pairs, 69 based on Foata normal form. 2/302 useless extension candidates. Maximal degree in co-relation 631. Up to 286 conditions per place. [2022-12-06 06:20:11,247 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2022-12-06 06:20:11,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 104 flow [2022-12-06 06:20:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:20:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:20:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 06:20:11,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:20:11,249 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 24 transitions. [2022-12-06 06:20:11,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 104 flow [2022-12-06 06:20:11,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:20:11,250 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2022-12-06 06:20:11,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2022-12-06 06:20:11,250 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -4 predicate places. [2022-12-06 06:20:11,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:11,250 INFO L89 Accepts]: Start accepts. Operand has 24 places, 18 transitions, 55 flow [2022-12-06 06:20:11,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:11,251 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:11,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 55 flow [2022-12-06 06:20:11,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 55 flow [2022-12-06 06:20:11,254 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-06 06:20:11,254 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:11,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 30 events. 3/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 41. Up to 10 conditions per place. [2022-12-06 06:20:11,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 55 flow [2022-12-06 06:20:11,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 06:20:11,327 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:11,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 06:20:11,329 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2022-12-06 06:20:11,329 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 06:20:11,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:11,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:11,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:20:11,329 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 06:20:11,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1952515831, now seen corresponding path program 1 times [2022-12-06 06:20:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:11,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617622346] [2022-12-06 06:20:11,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:11,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:11,441 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 06:20:11,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:11,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617622346] [2022-12-06 06:20:11,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617622346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:11,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:11,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:20:11,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594076980] [2022-12-06 06:20:11,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:11,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:20:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:11,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:20:11,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:20:11,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 06:20:11,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 3 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 06:20:11,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:11,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 06:20:11,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:11,494 INFO L130 PetriNetUnfolder]: 139/256 cut-off events. [2022-12-06 06:20:11,494 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 06:20:11,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 256 events. 139/256 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 838 event pairs, 46 based on Foata normal form. 8/263 useless extension candidates. Maximal degree in co-relation 558. Up to 184 conditions per place. [2022-12-06 06:20:11,498 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 19 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2022-12-06 06:20:11,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 107 flow [2022-12-06 06:20:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:20:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:20:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 06:20:11,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:20:11,500 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 24 transitions. [2022-12-06 06:20:11,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 107 flow [2022-12-06 06:20:11,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:20:11,502 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 60 flow [2022-12-06 06:20:11,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2022-12-06 06:20:11,503 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-06 06:20:11,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:11,503 INFO L89 Accepts]: Start accepts. Operand has 26 places, 18 transitions, 60 flow [2022-12-06 06:20:11,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:11,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:11,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 18 transitions, 60 flow [2022-12-06 06:20:11,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 60 flow [2022-12-06 06:20:11,506 INFO L130 PetriNetUnfolder]: 2/24 cut-off events. [2022-12-06 06:20:11,507 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:20:11,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 24 events. 2/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 37. Up to 8 conditions per place. [2022-12-06 06:20:11,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 60 flow [2022-12-06 06:20:11,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 06:20:11,522 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:11,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:20:11,523 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 60 flow [2022-12-06 06:20:11,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 06:20:11,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:11,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:11,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:20:11,523 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 06:20:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash -397874400, now seen corresponding path program 1 times [2022-12-06 06:20:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:11,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963034278] [2022-12-06 06:20:11,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:11,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:11,656 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 06:20:11,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:11,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963034278] [2022-12-06 06:20:11,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963034278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:11,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:11,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:20:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610745939] [2022-12-06 06:20:11,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:20:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:11,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:20:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:20:11,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-06 06:20:11,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 06:20:11,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:11,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-06 06:20:11,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:11,725 INFO L130 PetriNetUnfolder]: 67/159 cut-off events. [2022-12-06 06:20:11,725 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:20:11,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 159 events. 67/159 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 568 event pairs, 30 based on Foata normal form. 24/182 useless extension candidates. Maximal degree in co-relation 358. Up to 67 conditions per place. [2022-12-06 06:20:11,726 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 28 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-06 06:20:11,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 164 flow [2022-12-06 06:20:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:20:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:20:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 06:20:11,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.640625 [2022-12-06 06:20:11,727 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 60 flow. Second operand 4 states and 41 transitions. [2022-12-06 06:20:11,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 164 flow [2022-12-06 06:20:11,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 35 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:20:11,728 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 86 flow [2022-12-06 06:20:11,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-06 06:20:11,728 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2022-12-06 06:20:11,729 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:11,729 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 86 flow [2022-12-06 06:20:11,729 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:11,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:11,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 86 flow [2022-12-06 06:20:11,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 86 flow [2022-12-06 06:20:11,733 INFO L130 PetriNetUnfolder]: 6/41 cut-off events. [2022-12-06 06:20:11,734 INFO L131 PetriNetUnfolder]: For 11/14 co-relation queries the response was YES. [2022-12-06 06:20:11,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 41 events. 6/41 cut-off events. For 11/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 114 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 89. Up to 17 conditions per place. [2022-12-06 06:20:11,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 86 flow [2022-12-06 06:20:11,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:20:11,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:20:11,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-06 06:20:11,861 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 88 flow [2022-12-06 06:20:11,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 06:20:11,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:11,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:11,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:20:11,861 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 06:20:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:11,862 INFO L85 PathProgramCache]: Analyzing trace with hash -777903119, now seen corresponding path program 1 times [2022-12-06 06:20:11,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:11,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704193575] [2022-12-06 06:20:11,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:11,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:12,001 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 06:20:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:12,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704193575] [2022-12-06 06:20:12,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704193575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:12,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:12,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:20:12,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620915225] [2022-12-06 06:20:12,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:12,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:20:12,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:12,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:20:12,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:20:12,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 06:20:12,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 06:20:12,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:12,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 06:20:12,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:12,058 INFO L130 PetriNetUnfolder]: 25/75 cut-off events. [2022-12-06 06:20:12,059 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 06:20:12,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 75 events. 25/75 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 10 based on Foata normal form. 9/83 useless extension candidates. Maximal degree in co-relation 206. Up to 32 conditions per place. [2022-12-06 06:20:12,059 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 19 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2022-12-06 06:20:12,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 155 flow [2022-12-06 06:20:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:20:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:20:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:20:12,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2022-12-06 06:20:12,061 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 88 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:20:12,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 155 flow [2022-12-06 06:20:12,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 140 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 06:20:12,062 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 97 flow [2022-12-06 06:20:12,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 06:20:12,063 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2022-12-06 06:20:12,063 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:12,063 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 97 flow [2022-12-06 06:20:12,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:12,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:12,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 97 flow [2022-12-06 06:20:12,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 97 flow [2022-12-06 06:20:12,068 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-06 06:20:12,068 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 06:20:12,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 29 events. 3/29 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 62. Up to 9 conditions per place. [2022-12-06 06:20:12,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 97 flow [2022-12-06 06:20:12,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 06:20:12,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [358] L793-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_11| 0) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49) (= |v_P1Thread1of1ForFork1_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [386] L813-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_425 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_189 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_188 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_426 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_375 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_65|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_101 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_92) (= v_~y~0_317 (ite .cse0 v_~y$w_buff0~0_264 (ite .cse1 v_~y$w_buff1~0_206 v_~y~0_318))) (= v_~y$w_buff0_used~0_425 (ite .cse0 0 v_~y$w_buff0_used~0_426)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| 0)) (= v_~y$r_buff0_thd0~0_187 (ite .cse2 0 v_~y$r_buff0_thd0~0_188)) (= (mod v_~main$tmp_guard0~0_92 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|) (= v_~main$tmp_guard1~0_54 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_88 0) (= v_~x~0_97 2) (= 2 v_~__unbuffered_p1_EAX~0_62))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= v_~y$w_buff1_used~0_374 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_375)) (= v_~y$r_buff1_thd0~0_188 (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_187 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_374 256) 0)))) 0 v_~y$r_buff1_thd0~0_189)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_65| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_426, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_206, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, ~y$w_buff0~0=v_~y$w_buff0~0_264, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y~0=v_~y~0_318, ~x~0=v_~x~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_189, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_375} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_65|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_425, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_92, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_206, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_187, ~y$w_buff0~0=v_~y$w_buff0~0_264, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_73|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_41|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_51|, ~y~0=v_~y~0_317, ~x~0=v_~x~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_374, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:20:12,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L757-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_32 1) v_~__unbuffered_cnt~0_31) (= |v_P0Thread1of1ForFork0_#res#1.base_9| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_9|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] and [386] L813-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_425 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_189 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_188 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_426 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_375 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_65|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_101 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_92) (= v_~y~0_317 (ite .cse0 v_~y$w_buff0~0_264 (ite .cse1 v_~y$w_buff1~0_206 v_~y~0_318))) (= v_~y$w_buff0_used~0_425 (ite .cse0 0 v_~y$w_buff0_used~0_426)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| 0)) (= v_~y$r_buff0_thd0~0_187 (ite .cse2 0 v_~y$r_buff0_thd0~0_188)) (= (mod v_~main$tmp_guard0~0_92 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|) (= v_~main$tmp_guard1~0_54 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_88 0) (= v_~x~0_97 2) (= 2 v_~__unbuffered_p1_EAX~0_62))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= v_~y$w_buff1_used~0_374 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_375)) (= v_~y$r_buff1_thd0~0_188 (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_187 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_374 256) 0)))) 0 v_~y$r_buff1_thd0~0_189)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_65| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_73| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_426, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_206, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, ~y$w_buff0~0=v_~y$w_buff0~0_264, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y~0=v_~y~0_318, ~x~0=v_~x~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_189, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_375} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_65|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_88, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_425, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_92, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_206, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_187, ~y$w_buff0~0=v_~y$w_buff0~0_264, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_73|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_41|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_51|, ~y~0=v_~y~0_317, ~x~0=v_~x~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_374, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:20:13,070 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:20:13,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1008 [2022-12-06 06:20:13,071 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 93 flow [2022-12-06 06:20:13,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 06:20:13,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:13,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:13,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:20:13,071 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 06:20:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1451693624, now seen corresponding path program 1 times [2022-12-06 06:20:13,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:13,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371958477] [2022-12-06 06:20:13,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:13,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:13,562 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 06:20:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:13,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371958477] [2022-12-06 06:20:13,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371958477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:13,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:13,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:20:13,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660855685] [2022-12-06 06:20:13,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:13,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:20:13,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:13,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:20:13,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:20:13,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-06 06:20:13,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 06:20:13,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:13,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-06 06:20:13,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:13,678 INFO L130 PetriNetUnfolder]: 23/69 cut-off events. [2022-12-06 06:20:13,678 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-12-06 06:20:13,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 69 events. 23/69 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 193 event pairs, 0 based on Foata normal form. 2/71 useless extension candidates. Maximal degree in co-relation 210. Up to 20 conditions per place. [2022-12-06 06:20:13,679 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 19 selfloop transitions, 6 changer transitions 8/36 dead transitions. [2022-12-06 06:20:13,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 252 flow [2022-12-06 06:20:13,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:20:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:20:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-12-06 06:20:13,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 06:20:13,681 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 93 flow. Second operand 7 states and 48 transitions. [2022-12-06 06:20:13,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 252 flow [2022-12-06 06:20:13,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 189 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-06 06:20:13,685 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 101 flow [2022-12-06 06:20:13,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-06 06:20:13,686 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2022-12-06 06:20:13,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:13,687 INFO L89 Accepts]: Start accepts. Operand has 32 places, 20 transitions, 101 flow [2022-12-06 06:20:13,688 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:13,688 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:13,688 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 101 flow [2022-12-06 06:20:13,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 101 flow [2022-12-06 06:20:13,693 INFO L130 PetriNetUnfolder]: 4/29 cut-off events. [2022-12-06 06:20:13,693 INFO L131 PetriNetUnfolder]: For 21/23 co-relation queries the response was YES. [2022-12-06 06:20:13,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 29 events. 4/29 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 2/31 useless extension candidates. Maximal degree in co-relation 63. Up to 10 conditions per place. [2022-12-06 06:20:13,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 101 flow [2022-12-06 06:20:13,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 06:20:14,302 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:20:14,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 617 [2022-12-06 06:20:14,303 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 102 flow [2022-12-06 06:20:14,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 06:20:14,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:14,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:14,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:20:14,303 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 06:20:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2028774230, now seen corresponding path program 2 times [2022-12-06 06:20:14,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:14,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007205978] [2022-12-06 06:20:14,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:14,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:20:14,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:20:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:20:14,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:20:14,367 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:20:14,368 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:20:14,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 06:20:14,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:20:14,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:20:14,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 06:20:14,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:20:14,373 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-12-06 06:20:14,377 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:20:14,377 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:20:14,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:20:14 BasicIcfg [2022-12-06 06:20:14,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:20:14,434 INFO L158 Benchmark]: Toolchain (without parser) took 8805.11ms. Allocated memory was 192.9MB in the beginning and 278.9MB in the end (delta: 86.0MB). Free memory was 167.8MB in the beginning and 150.2MB in the end (delta: 17.6MB). Peak memory consumption was 104.9MB. Max. memory is 8.0GB. [2022-12-06 06:20:14,434 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 108.4MB in the beginning and 108.3MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:20:14,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.07ms. Allocated memory is still 192.9MB. Free memory was 167.8MB in the beginning and 142.7MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 06:20:14,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.12ms. Allocated memory is still 192.9MB. Free memory was 142.7MB in the beginning and 140.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:20:14,435 INFO L158 Benchmark]: Boogie Preprocessor took 41.70ms. Allocated memory is still 192.9MB. Free memory was 140.2MB in the beginning and 138.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:20:14,435 INFO L158 Benchmark]: RCFGBuilder took 723.21ms. Allocated memory is still 192.9MB. Free memory was 138.5MB in the beginning and 144.3MB in the end (delta: -5.8MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-12-06 06:20:14,435 INFO L158 Benchmark]: TraceAbstraction took 7410.93ms. Allocated memory was 192.9MB in the beginning and 278.9MB in the end (delta: 86.0MB). Free memory was 143.8MB in the beginning and 150.2MB in the end (delta: -6.4MB). Peak memory consumption was 79.6MB. Max. memory is 8.0GB. [2022-12-06 06:20:14,436 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 127.9MB. Free memory was 108.4MB in the beginning and 108.3MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 556.07ms. Allocated memory is still 192.9MB. Free memory was 167.8MB in the beginning and 142.7MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.12ms. Allocated memory is still 192.9MB. Free memory was 142.7MB in the beginning and 140.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.70ms. Allocated memory is still 192.9MB. Free memory was 140.2MB in the beginning and 138.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 723.21ms. Allocated memory is still 192.9MB. Free memory was 138.5MB in the beginning and 144.3MB in the end (delta: -5.8MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * TraceAbstraction took 7410.93ms. Allocated memory was 192.9MB in the beginning and 278.9MB in the end (delta: 86.0MB). Free memory was 143.8MB in the beginning and 150.2MB in the end (delta: -6.4MB). Peak memory consumption was 79.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 92 PlacesBefore, 28 PlacesAfterwards, 87 TransitionsBefore, 22 TransitionsAfterwards, 1104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 969, independent: 923, independent conditional: 923, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 969, independent: 923, independent conditional: 0, independent unconditional: 923, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 969, independent: 923, independent conditional: 0, independent unconditional: 923, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 969, independent: 923, independent conditional: 0, independent unconditional: 923, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 763, independent: 731, independent conditional: 0, independent unconditional: 731, 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: 763, independent: 723, independent conditional: 0, independent unconditional: 723, 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: 228, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 969, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 763, unknown conditional: 0, unknown unconditional: 763] , Statistics on independence cache: Total cache size (in pairs): 1136, Positive cache size: 1104, Positive conditional cache size: 0, Positive unconditional cache size: 1104, 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, 23 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 10, independent unconditional: 23, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 33, independent conditional: 10, independent unconditional: 23, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 10, independent unconditional: 23, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 31, independent conditional: 10, independent unconditional: 21, dependent: 15, dependent conditional: 6, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 6, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 60, dependent conditional: 30, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 46, unknown conditional: 16, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 31, Positive conditional cache size: 10, Positive unconditional cache size: 21, Negative cache size: 15, Negative conditional cache size: 6, Negative unconditional cache size: 9, 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.1s, 24 PlacesBefore, 24 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 13, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 67, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 36, Positive conditional cache size: 10, Positive unconditional cache size: 26, Negative cache size: 23, Negative conditional cache size: 6, Negative unconditional cache size: 17, 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.0s, 26 PlacesBefore, 26 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 54, Positive conditional cache size: 10, Positive unconditional cache size: 44, Negative cache size: 27, Negative conditional cache size: 6, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 29, independent conditional: 14, independent unconditional: 15, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 29, independent conditional: 2, independent unconditional: 27, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 29, independent conditional: 2, independent unconditional: 27, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 57, independent: 26, independent conditional: 2, independent unconditional: 24, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 58, Positive conditional cache size: 10, Positive unconditional cache size: 48, Negative cache size: 28, Negative conditional cache size: 6, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 32 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 18 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 79, independent conditional: 27, independent unconditional: 52, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, independent: 79, independent conditional: 16, independent unconditional: 63, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, independent: 79, independent conditional: 16, independent unconditional: 63, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 105, independent: 77, independent conditional: 15, independent unconditional: 62, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 61, Positive conditional cache size: 11, Positive unconditional cache size: 50, Negative cache size: 30, Negative conditional cache size: 6, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 38, independent conditional: 38, 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: 51, independent: 38, independent conditional: 37, independent unconditional: 1, dependent: 13, dependent conditional: 8, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 38, independent conditional: 37, independent unconditional: 1, dependent: 13, dependent conditional: 8, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 38, independent conditional: 37, independent unconditional: 1, dependent: 13, dependent conditional: 8, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 11, dependent conditional: 6, dependent unconditional: 5, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 67, Positive conditional cache size: 15, Positive unconditional cache size: 52, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, 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_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t585; [L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t585, ((void *)0), P0, ((void *)0))=-1, t585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 pthread_t t586; [L813] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t586, ((void *)0), P1, ((void *)0))=0, t585={5:0}, t586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 2 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 2 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 2 !(!cond) [L817] RET 2 assume_abort_if_not(main$tmp_guard0) [L819] 2 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 2 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 2 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 2 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L828] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=65, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$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: 813]: 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: 811]: 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, 108 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: 7.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 3 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=6, InterpolantAutomatonStates: 25, 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.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 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 06:20:14,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...