/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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:05:54,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:05:54,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:05:54,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:05:54,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:05:54,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:05:54,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:05:54,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:05:54,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:05:54,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:05:54,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:05:54,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:05:54,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:05:54,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:05:54,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:05:54,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:05:54,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:05:54,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:05:54,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:05:54,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:05:54,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:05:54,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:05:54,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:05:54,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:05:54,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:05:54,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:05:54,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:05:54,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:05:54,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:05:54,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:05:54,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:05:54,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:05:54,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:05:54,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:05:54,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:05:54,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:05:54,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:05:54,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:05:54,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:05:54,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:05:54,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:05:54,097 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-13 12:05:54,112 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:05:54,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:05:54,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:05:54,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:05:54,114 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:05:54,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:05:54,115 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:05:54,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:05:54,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:05:54,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:05:54,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:05:54,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:05:54,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:05:54,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:05:54,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:05:54,116 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:05:54,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:05:54,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:05:54,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:05:54,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:05:54,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:05:54,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:05:54,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:05:54,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:05:54,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:05:54,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:05:54,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:05:54,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:05:54,117 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-13 12:05:54,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:05:54,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:05:54,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:05:54,633 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:05:54,633 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:05:54,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:05:55,597 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:05:56,094 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:05:56,095 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:05:56,113 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f74bfb71/c429eebc4faa40539d76cd7827627c4d/FLAGa693db992 [2022-12-13 12:05:56,241 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f74bfb71/c429eebc4faa40539d76cd7827627c4d [2022-12-13 12:05:56,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:05:56,244 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:05:56,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:05:56,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:05:56,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:05:56,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38bb8397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56, skipping insertion in model container [2022-12-13 12:05:56,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:05:56,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:05:56,442 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 12:05:56,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:05:56,649 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:05:56,660 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 12:05:56,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:56,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:56,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:05:56,745 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:05:56,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56 WrapperNode [2022-12-13 12:05:56,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:05:56,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:05:56,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:05:56,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:05:56,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,805 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2022-12-13 12:05:56,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:05:56,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:05:56,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:05:56,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:05:56,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,852 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:05:56,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:05:56,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:05:56,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:05:56,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (1/1) ... [2022-12-13 12:05:56,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:05:56,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:05:56,902 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-13 12:05:56,928 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-13 12:05:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:05:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:05:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:05:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:05:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:05:56,958 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:05:56,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:05:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:05:56,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:05:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:05:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:05:56,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:05:56,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:05:56,962 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:05:57,053 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:05:57,055 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:05:57,251 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:05:57,489 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:05:57,490 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:05:57,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:05:57 BoogieIcfgContainer [2022-12-13 12:05:57,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:05:57,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:05:57,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:05:57,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:05:57,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:05:56" (1/3) ... [2022-12-13 12:05:57,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e04490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:05:57, skipping insertion in model container [2022-12-13 12:05:57,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:56" (2/3) ... [2022-12-13 12:05:57,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e04490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:05:57, skipping insertion in model container [2022-12-13 12:05:57,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:05:57" (3/3) ... [2022-12-13 12:05:57,518 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 12:05:57,534 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:05:57,535 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 12:05:57,535 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:05:57,606 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:05:57,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2022-12-13 12:05:57,656 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-13 12:05:57,657 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:05:57,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2022-12-13 12:05:57,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2022-12-13 12:05:57,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2022-12-13 12:05:57,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:57,674 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-13 12:05:57,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2022-12-13 12:05:57,692 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-13 12:05:57,692 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:05:57,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2022-12-13 12:05:57,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-13 12:05:57,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 936 [2022-12-13 12:06:01,055 INFO L241 LiptonReduction]: Total number of compositions: 70 [2022-12-13 12:06:01,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:06:01,072 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;@40a34c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:06:01,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 12:06:01,092 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2022-12-13 12:06:01,092 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:06:01,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:01,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:06:01,093 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:06:01,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash 393766178, now seen corresponding path program 1 times [2022-12-13 12:06:01,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:01,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625792114] [2022-12-13 12:06:01,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:01,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:01,453 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-13 12:06:01,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:01,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625792114] [2022-12-13 12:06:01,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625792114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:01,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:01,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:06:01,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011865274] [2022-12-13 12:06:01,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:01,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:06:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:01,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:06:01,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:06:01,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2022-12-13 12:06:01,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 12:06:01,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:01,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2022-12-13 12:06:01,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:01,742 INFO L130 PetriNetUnfolder]: 904/1733 cut-off events. [2022-12-13 12:06:01,743 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 12:06:01,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 1733 events. 904/1733 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 11173 event pairs, 96 based on Foata normal form. 0/1026 useless extension candidates. Maximal degree in co-relation 3229. Up to 1269 conditions per place. [2022-12-13 12:06:01,749 INFO L137 encePairwiseOnDemand]: 39/44 looper letters, 20 selfloop transitions, 2 changer transitions 38/67 dead transitions. [2022-12-13 12:06:01,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 260 flow [2022-12-13 12:06:01,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:06:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:06:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 12:06:01,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2022-12-13 12:06:01,759 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 94 flow. Second operand 3 states and 86 transitions. [2022-12-13 12:06:01,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 260 flow [2022-12-13 12:06:01,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:06:01,763 INFO L231 Difference]: Finished difference. Result has 48 places, 22 transitions, 52 flow [2022-12-13 12:06:01,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=48, PETRI_TRANSITIONS=22} [2022-12-13 12:06:01,767 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2022-12-13 12:06:01,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:01,767 INFO L89 Accepts]: Start accepts. Operand has 48 places, 22 transitions, 52 flow [2022-12-13 12:06:01,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:01,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:01,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 22 transitions, 52 flow [2022-12-13 12:06:01,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2022-12-13 12:06:01,773 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-13 12:06:01,773 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:06:01,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 51 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 12:06:01,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 52 flow [2022-12-13 12:06:01,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 12:06:01,849 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:06:01,851 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-13 12:06:01,851 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 52 flow [2022-12-13 12:06:01,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 12:06:01,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:01,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:01,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:06:01,852 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:06:01,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:01,852 INFO L85 PathProgramCache]: Analyzing trace with hash 452173715, now seen corresponding path program 1 times [2022-12-13 12:06:01,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:01,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389709928] [2022-12-13 12:06:01,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:01,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:01,982 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-13 12:06:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389709928] [2022-12-13 12:06:01,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389709928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:01,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:01,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:06:01,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232992476] [2022-12-13 12:06:01,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:01,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:06:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:01,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:06:01,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:06:01,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2022-12-13 12:06:01,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 12:06:01,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:01,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2022-12-13 12:06:01,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:02,066 INFO L130 PetriNetUnfolder]: 220/412 cut-off events. [2022-12-13 12:06:02,066 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 12:06:02,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 412 events. 220/412 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1777 event pairs, 88 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 821. Up to 366 conditions per place. [2022-12-13 12:06:02,085 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 20 selfloop transitions, 3 changer transitions 2/30 dead transitions. [2022-12-13 12:06:02,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 122 flow [2022-12-13 12:06:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:06:02,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:06:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-13 12:06:02,086 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2022-12-13 12:06:02,086 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 52 flow. Second operand 3 states and 41 transitions. [2022-12-13 12:06:02,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 122 flow [2022-12-13 12:06:02,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:06:02,087 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 65 flow [2022-12-13 12:06:02,087 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2022-12-13 12:06:02,088 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, -20 predicate places. [2022-12-13 12:06:02,088 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:02,088 INFO L89 Accepts]: Start accepts. Operand has 30 places, 23 transitions, 65 flow [2022-12-13 12:06:02,089 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:02,089 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:02,089 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 23 transitions, 65 flow [2022-12-13 12:06:02,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 23 transitions, 65 flow [2022-12-13 12:06:02,114 INFO L130 PetriNetUnfolder]: 3/35 cut-off events. [2022-12-13 12:06:02,114 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:06:02,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 94 event pairs, 1 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2022-12-13 12:06:02,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 23 transitions, 65 flow [2022-12-13 12:06:02,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-13 12:06:02,185 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:06:02,186 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 12:06:02,186 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 65 flow [2022-12-13 12:06:02,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 12:06:02,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:02,186 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:02,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:06:02,187 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:06:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1132480866, now seen corresponding path program 1 times [2022-12-13 12:06:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:02,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980110720] [2022-12-13 12:06:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:02,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:02,354 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-13 12:06:02,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:02,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980110720] [2022-12-13 12:06:02,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980110720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:02,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:02,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:06:02,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579476562] [2022-12-13 12:06:02,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:02,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:06:02,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:02,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:06:02,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:06:02,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-13 12:06:02,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-13 12:06:02,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:02,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-13 12:06:02,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:02,470 INFO L130 PetriNetUnfolder]: 167/349 cut-off events. [2022-12-13 12:06:02,470 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-13 12:06:02,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 349 events. 167/349 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1609 event pairs, 37 based on Foata normal form. 41/295 useless extension candidates. Maximal degree in co-relation 763. Up to 235 conditions per place. [2022-12-13 12:06:02,472 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 23 selfloop transitions, 7 changer transitions 22/57 dead transitions. [2022-12-13 12:06:02,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 57 transitions, 248 flow [2022-12-13 12:06:02,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:06:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:06:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 12:06:02,475 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 12:06:02,475 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 65 flow. Second operand 5 states and 72 transitions. [2022-12-13 12:06:02,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 57 transitions, 248 flow [2022-12-13 12:06:02,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 57 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:06:02,479 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 125 flow [2022-12-13 12:06:02,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2022-12-13 12:06:02,484 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, -15 predicate places. [2022-12-13 12:06:02,484 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:02,484 INFO L89 Accepts]: Start accepts. Operand has 35 places, 29 transitions, 125 flow [2022-12-13 12:06:02,485 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:02,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:02,485 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 125 flow [2022-12-13 12:06:02,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 125 flow [2022-12-13 12:06:02,500 INFO L130 PetriNetUnfolder]: 61/153 cut-off events. [2022-12-13 12:06:02,501 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-13 12:06:02,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 153 events. 61/153 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 738 event pairs, 30 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 382. Up to 91 conditions per place. [2022-12-13 12:06:02,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 29 transitions, 125 flow [2022-12-13 12:06:02,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-13 12:06:02,507 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:06:02,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 12:06:02,508 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 125 flow [2022-12-13 12:06:02,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-13 12:06:02,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:02,508 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:02,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:06:02,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:06:02,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1886412831, now seen corresponding path program 1 times [2022-12-13 12:06:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:02,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950030080] [2022-12-13 12:06:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:02,665 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-13 12:06:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950030080] [2022-12-13 12:06:02,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950030080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:02,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:02,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:06:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543241581] [2022-12-13 12:06:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:02,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:06:02,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:02,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:06:02,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:06:02,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-13 12:06:02,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 12:06:02,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:02,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-13 12:06:02,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:02,755 INFO L130 PetriNetUnfolder]: 57/168 cut-off events. [2022-12-13 12:06:02,755 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-13 12:06:02,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 168 events. 57/168 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 706 event pairs, 7 based on Foata normal form. 27/153 useless extension candidates. Maximal degree in co-relation 525. Up to 88 conditions per place. [2022-12-13 12:06:02,756 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 17 selfloop transitions, 13 changer transitions 12/46 dead transitions. [2022-12-13 12:06:02,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 273 flow [2022-12-13 12:06:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:06:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:06:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 12:06:02,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-13 12:06:02,758 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 125 flow. Second operand 6 states and 66 transitions. [2022-12-13 12:06:02,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 273 flow [2022-12-13 12:06:02,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 238 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 12:06:02,760 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 144 flow [2022-12-13 12:06:02,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2022-12-13 12:06:02,761 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2022-12-13 12:06:02,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:02,761 INFO L89 Accepts]: Start accepts. Operand has 39 places, 28 transitions, 144 flow [2022-12-13 12:06:02,761 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:02,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:02,762 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 144 flow [2022-12-13 12:06:02,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 144 flow [2022-12-13 12:06:02,768 INFO L130 PetriNetUnfolder]: 10/68 cut-off events. [2022-12-13 12:06:02,768 INFO L131 PetriNetUnfolder]: For 39/45 co-relation queries the response was YES. [2022-12-13 12:06:02,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 68 events. 10/68 cut-off events. For 39/45 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 253 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 189. Up to 37 conditions per place. [2022-12-13 12:06:02,769 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 144 flow [2022-12-13 12:06:02,769 INFO L226 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-13 12:06:03,143 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:06:03,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-13 12:06:03,144 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 140 flow [2022-12-13 12:06:03,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 12:06:03,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:03,145 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:03,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:06:03,145 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:06:03,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1588938241, now seen corresponding path program 1 times [2022-12-13 12:06:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:03,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766957421] [2022-12-13 12:06:03,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:03,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:03,247 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-13 12:06:03,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:03,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766957421] [2022-12-13 12:06:03,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766957421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:03,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:03,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:06:03,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536757635] [2022-12-13 12:06:03,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:03,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:06:03,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:03,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:06:03,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:06:03,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2022-12-13 12:06:03,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 12:06:03,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:03,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2022-12-13 12:06:03,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:03,288 INFO L130 PetriNetUnfolder]: 46/133 cut-off events. [2022-12-13 12:06:03,288 INFO L131 PetriNetUnfolder]: For 252/257 co-relation queries the response was YES. [2022-12-13 12:06:03,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 133 events. 46/133 cut-off events. For 252/257 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 544 event pairs, 0 based on Foata normal form. 14/122 useless extension candidates. Maximal degree in co-relation 485. Up to 81 conditions per place. [2022-12-13 12:06:03,289 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 22 selfloop transitions, 5 changer transitions 7/39 dead transitions. [2022-12-13 12:06:03,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 274 flow [2022-12-13 12:06:03,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:06:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:06:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-13 12:06:03,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2022-12-13 12:06:03,290 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 140 flow. Second operand 3 states and 37 transitions. [2022-12-13 12:06:03,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 274 flow [2022-12-13 12:06:03,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 226 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-13 12:06:03,292 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 127 flow [2022-12-13 12:06:03,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2022-12-13 12:06:03,293 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, -18 predicate places. [2022-12-13 12:06:03,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:03,293 INFO L89 Accepts]: Start accepts. Operand has 32 places, 26 transitions, 127 flow [2022-12-13 12:06:03,294 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:03,294 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:03,294 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 127 flow [2022-12-13 12:06:03,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 26 transitions, 127 flow [2022-12-13 12:06:03,300 INFO L130 PetriNetUnfolder]: 19/77 cut-off events. [2022-12-13 12:06:03,300 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 12:06:03,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 77 events. 19/77 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 313 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 185. Up to 46 conditions per place. [2022-12-13 12:06:03,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 26 transitions, 127 flow [2022-12-13 12:06:03,301 INFO L226 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-13 12:06:03,302 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:06:03,302 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 12:06:03,302 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 127 flow [2022-12-13 12:06:03,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 12:06:03,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:03,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:03,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:06:03,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:06:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1311485283, now seen corresponding path program 2 times [2022-12-13 12:06:03,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:03,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454115915] [2022-12-13 12:06:03,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:03,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:03,405 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-13 12:06:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:03,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454115915] [2022-12-13 12:06:03,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454115915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:03,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:03,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:06:03,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527685942] [2022-12-13 12:06:03,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:03,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:06:03,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:03,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:06:03,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:06:03,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2022-12-13 12:06:03,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-13 12:06:03,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:03,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2022-12-13 12:06:03,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:03,449 INFO L130 PetriNetUnfolder]: 56/161 cut-off events. [2022-12-13 12:06:03,449 INFO L131 PetriNetUnfolder]: For 147/152 co-relation queries the response was YES. [2022-12-13 12:06:03,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 161 events. 56/161 cut-off events. For 147/152 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 733 event pairs, 5 based on Foata normal form. 13/140 useless extension candidates. Maximal degree in co-relation 514. Up to 70 conditions per place. [2022-12-13 12:06:03,450 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 18 selfloop transitions, 3 changer transitions 12/38 dead transitions. [2022-12-13 12:06:03,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 243 flow [2022-12-13 12:06:03,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:06:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:06:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 12:06:03,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2022-12-13 12:06:03,452 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 127 flow. Second operand 4 states and 38 transitions. [2022-12-13 12:06:03,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 243 flow [2022-12-13 12:06:03,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 236 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 12:06:03,454 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 116 flow [2022-12-13 12:06:03,454 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-13 12:06:03,454 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, -16 predicate places. [2022-12-13 12:06:03,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:03,454 INFO L89 Accepts]: Start accepts. Operand has 34 places, 23 transitions, 116 flow [2022-12-13 12:06:03,455 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:03,455 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:03,455 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 116 flow [2022-12-13 12:06:03,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 116 flow [2022-12-13 12:06:03,460 INFO L130 PetriNetUnfolder]: 9/43 cut-off events. [2022-12-13 12:06:03,460 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-13 12:06:03,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 43 events. 9/43 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 147 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 116. Up to 28 conditions per place. [2022-12-13 12:06:03,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 116 flow [2022-12-13 12:06:03,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 12:06:03,463 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L776-->L779: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] and [289] $Ultimate##0-->L738: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 2 v_~y~0_5)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 12:06:03,573 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:06:03,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 12:06:03,574 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 110 flow [2022-12-13 12:06:03,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-13 12:06:03,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:03,574 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:03,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:06:03,574 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:06:03,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:03,575 INFO L85 PathProgramCache]: Analyzing trace with hash -417834614, now seen corresponding path program 1 times [2022-12-13 12:06:03,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:03,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644716181] [2022-12-13 12:06:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:03,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:03,859 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-13 12:06:03,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:03,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644716181] [2022-12-13 12:06:03,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644716181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:03,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:03,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:06:03,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885774317] [2022-12-13 12:06:03,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:03,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:06:03,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:03,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:06:03,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:06:03,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 15 [2022-12-13 12:06:03,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-13 12:06:03,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:06:03,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 15 [2022-12-13 12:06:03,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:06:03,926 INFO L130 PetriNetUnfolder]: 22/75 cut-off events. [2022-12-13 12:06:03,926 INFO L131 PetriNetUnfolder]: For 155/157 co-relation queries the response was YES. [2022-12-13 12:06:03,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 75 events. 22/75 cut-off events. For 155/157 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 329 event pairs, 0 based on Foata normal form. 11/68 useless extension candidates. Maximal degree in co-relation 244. Up to 46 conditions per place. [2022-12-13 12:06:03,927 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 14 selfloop transitions, 4 changer transitions 9/32 dead transitions. [2022-12-13 12:06:03,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 220 flow [2022-12-13 12:06:03,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:06:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:06:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-12-13 12:06:03,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 12:06:03,929 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 110 flow. Second operand 6 states and 38 transitions. [2022-12-13 12:06:03,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 220 flow [2022-12-13 12:06:03,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 200 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-13 12:06:03,931 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 104 flow [2022-12-13 12:06:03,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-13 12:06:03,933 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, -19 predicate places. [2022-12-13 12:06:03,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:06:03,933 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 104 flow [2022-12-13 12:06:03,933 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:06:03,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:03,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 104 flow [2022-12-13 12:06:03,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 104 flow [2022-12-13 12:06:03,940 INFO L130 PetriNetUnfolder]: 9/45 cut-off events. [2022-12-13 12:06:03,940 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-13 12:06:03,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 45 events. 9/45 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 153 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 132. Up to 28 conditions per place. [2022-12-13 12:06:03,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 104 flow [2022-12-13 12:06:03,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-13 12:06:04,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] $Ultimate##0-->L756: Formula: (let ((.cse8 (= (mod v_~x$w_buff0_used~0_296 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_133 256) 0))) (let ((.cse9 (and .cse8 .cse3))) (let ((.cse6 (or .cse3 .cse9)) (.cse7 (not .cse3))) (let ((.cse0 (ite .cse6 v_~x~0_205 (ite .cse7 v_~x$w_buff0~0_203 v_~x$w_buff0~0_205))) (.cse5 (= (mod v_~x$w_buff1_used~0_259 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_76 256) 0))) (.cse2 (= 0 (mod v_~x$w_buff0_used~0_294 256)))) (and (= v_~x$flush_delayed~0_69 0) (= .cse0 v_~__unbuffered_p0_EAX~0_104) (= v_~x$w_buff0~0_203 1) (= v_~x$mem_tmp~0_60 v_~x~0_205) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_30| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_30|) (= v_~x$w_buff0~0_205 v_~x$w_buff1~0_173) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= |v_P1Thread1of1ForFork0_~arg#1.base_28| |v_P1Thread1of1ForFork0_#in~arg#1.base_28|) (= (ite .cse1 v_~x$r_buff0_thd1~0_133 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd1~0_132 256) 0))) (or .cse2 (and .cse3 .cse4) (and .cse5 .cse4))) v_~x$r_buff0_thd1~0_133 0)) v_~x$r_buff1_thd1~0_133) (= v_~x$r_buff0_thd0~0_120 v_~x$r_buff1_thd0~0_125) (= (ite .cse1 1 (ite .cse6 1 (ite .cse7 0 1))) v_~x$w_buff0_used~0_294) (= (ite .cse8 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_30|) (= v_~x$r_buff0_thd2~0_120 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= (ite .cse1 v_~x$mem_tmp~0_60 .cse0) v_~x~0_204) (= v_~x$r_buff0_thd1~0_132 (ite .cse1 v_~x$r_buff0_thd1~0_133 (ite (or .cse2 .cse3 (and .cse3 .cse5)) v_~x$r_buff0_thd1~0_133 (ite (and (not .cse2) .cse7) 0 v_~x$r_buff0_thd1~0_133)))) (= |v_P0Thread1of1ForFork1_#t~nondet4_66| v_~weak$$choice2~0_76) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_30| 0)) (= |v_P0Thread1of1ForFork1_#t~nondet3_66| v_~weak$$choice0~0_49) (= v_~y~0_93 2) (= v_~x$r_buff1_thd2~0_86 v_~x$r_buff0_thd2~0_121) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_28| |v_P1Thread1of1ForFork0_~arg#1.offset_28|) (= v_~x$w_buff1_used~0_259 (ite .cse1 v_~x$w_buff0_used~0_296 (ite (or .cse2 .cse3 .cse9) v_~x$w_buff0_used~0_296 0)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_205, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_120, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_28|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_133, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_66|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_121, ~x~0=v_~x~0_205, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_66|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_296} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_203, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_132, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_28|, ~x$flush_delayed~0=v_~x$flush_delayed~0_69, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_133, ~x$mem_tmp~0=v_~x$mem_tmp~0_60, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_28|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_28|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, ~y~0=v_~y~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_120, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_30|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_28|, ~x$w_buff1~0=v_~x$w_buff1~0_173, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_259, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_86, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_125, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294, ~weak$$choice0~0=v_~weak$$choice0~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_76, ~x~0=v_~x~0_204} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [272] L779-->L786: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_33 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_82 256) 0)))) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_73 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_72 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd2~0_32 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x$r_buff0_thd2~0_32 (ite .cse3 0 v_~x$r_buff0_thd2~0_33)) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_42 v_~x~0_49))) (= v_~x$w_buff1_used~0_72 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_73))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_33, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_32, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 12:06:04,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [402] $Ultimate##0-->L786: Formula: (let ((.cse1 (= (mod v_~x$r_buff0_thd1~0_137 256) 0)) (.cse6 (= (mod v_~x$w_buff0_used~0_302 256) 0))) (let ((.cse15 (and .cse1 .cse6))) (let ((.cse0 (not (= 0 (mod v_~weak$$choice2~0_78 256)))) (.cse14 (or .cse1 .cse15)) (.cse4 (not .cse1))) (let ((.cse11 (ite .cse0 1 (ite .cse14 1 (ite .cse4 0 1))))) (let ((.cse3 (= (mod .cse11 256) 0))) (let ((.cse10 (ite .cse0 v_~x$w_buff0_used~0_302 (ite (or .cse1 .cse3 .cse15) v_~x$w_buff0_used~0_302 0)))) (let ((.cse8 (not (= (mod v_~x$r_buff0_thd2~0_126 256) 0))) (.cse2 (= 0 (mod .cse10 256)))) (let ((.cse5 (not .cse3)) (.cse9 (and .cse8 (not .cse2))) (.cse12 (ite .cse14 v_~x~0_210 (ite .cse4 v_~x$w_buff0~0_209 v_~x$w_buff0~0_210))) (.cse7 (not (= (mod v_~x$w_buff0_used~0_300 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_137 (ite (or (and .cse1 .cse2) .cse1 .cse3) v_~x$r_buff0_thd1~0_137 (ite (and .cse4 .cse5) 0 v_~x$r_buff0_thd1~0_137))) v_~x$r_buff0_thd1~0_136) (= (ite .cse6 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|) (= v_~x$r_buff0_thd0~0_122 v_~x$r_buff1_thd0~0_127) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_177) (= v_~x$mem_tmp~0_62 v_~x~0_210) (= v_~y~0_95 2) (= v_~x$r_buff1_thd2~0_88 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_124 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_263 256) 0)))) 0 v_~x$r_buff0_thd2~0_126)) (= |v_P1Thread1of1ForFork0_~arg#1.base_30| |v_P1Thread1of1ForFork0_#in~arg#1.base_30|) (= |v_P0Thread1of1ForFork1_#t~nondet4_70| v_~weak$$choice2~0_78) (= (ite (or .cse7 .cse9) 0 .cse10) v_~x$w_buff1_used~0_263) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= (ite .cse5 0 .cse11) v_~x$w_buff0_used~0_300) (= (ite .cse5 v_~x$w_buff0~0_209 (ite .cse9 v_~x$w_buff1~0_177 (ite .cse0 v_~x$mem_tmp~0_62 .cse12))) v_~x~0_208) (= v_~x$flush_delayed~0_71 0) (= .cse12 v_~__unbuffered_p0_EAX~0_106) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32| 0)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_30| |v_P1Thread1of1ForFork0_~arg#1.offset_30|) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~x$w_buff0~0_209 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|) (= v_~x$r_buff1_thd1~0_137 (ite .cse0 v_~x$r_buff0_thd1~0_137 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd1~0_136 256) 0))) (or (and .cse13 .cse1) .cse3 (and .cse13 .cse2))) v_~x$r_buff0_thd1~0_137 0))) (= (ite .cse7 0 1) v_~x$r_buff0_thd2~0_124) (= |v_P0Thread1of1ForFork1_#t~nondet3_70| v_~weak$$choice0~0_51)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_122, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_137, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_70|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_126, ~x~0=v_~x~0_210, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_70|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_302} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_136, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_71, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_137, ~x$mem_tmp~0=v_~x$mem_tmp~0_62, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_122, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_30|, ~x$w_buff1~0=v_~x$w_buff1~0_177, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_263, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_124, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_300, ~weak$$choice0~0=v_~weak$$choice0~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~x~0=v_~x~0_208} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [265] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 12:06:05,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [402] $Ultimate##0-->L786: Formula: (let ((.cse1 (= (mod v_~x$r_buff0_thd1~0_137 256) 0)) (.cse6 (= (mod v_~x$w_buff0_used~0_302 256) 0))) (let ((.cse15 (and .cse1 .cse6))) (let ((.cse0 (not (= 0 (mod v_~weak$$choice2~0_78 256)))) (.cse14 (or .cse1 .cse15)) (.cse4 (not .cse1))) (let ((.cse11 (ite .cse0 1 (ite .cse14 1 (ite .cse4 0 1))))) (let ((.cse3 (= (mod .cse11 256) 0))) (let ((.cse10 (ite .cse0 v_~x$w_buff0_used~0_302 (ite (or .cse1 .cse3 .cse15) v_~x$w_buff0_used~0_302 0)))) (let ((.cse8 (not (= (mod v_~x$r_buff0_thd2~0_126 256) 0))) (.cse2 (= 0 (mod .cse10 256)))) (let ((.cse5 (not .cse3)) (.cse9 (and .cse8 (not .cse2))) (.cse12 (ite .cse14 v_~x~0_210 (ite .cse4 v_~x$w_buff0~0_209 v_~x$w_buff0~0_210))) (.cse7 (not (= (mod v_~x$w_buff0_used~0_300 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_137 (ite (or (and .cse1 .cse2) .cse1 .cse3) v_~x$r_buff0_thd1~0_137 (ite (and .cse4 .cse5) 0 v_~x$r_buff0_thd1~0_137))) v_~x$r_buff0_thd1~0_136) (= (ite .cse6 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|) (= v_~x$r_buff0_thd0~0_122 v_~x$r_buff1_thd0~0_127) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_177) (= v_~x$mem_tmp~0_62 v_~x~0_210) (= v_~y~0_95 2) (= v_~x$r_buff1_thd2~0_88 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_124 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_263 256) 0)))) 0 v_~x$r_buff0_thd2~0_126)) (= |v_P1Thread1of1ForFork0_~arg#1.base_30| |v_P1Thread1of1ForFork0_#in~arg#1.base_30|) (= |v_P0Thread1of1ForFork1_#t~nondet4_70| v_~weak$$choice2~0_78) (= (ite (or .cse7 .cse9) 0 .cse10) v_~x$w_buff1_used~0_263) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= (ite .cse5 0 .cse11) v_~x$w_buff0_used~0_300) (= (ite .cse5 v_~x$w_buff0~0_209 (ite .cse9 v_~x$w_buff1~0_177 (ite .cse0 v_~x$mem_tmp~0_62 .cse12))) v_~x~0_208) (= v_~x$flush_delayed~0_71 0) (= .cse12 v_~__unbuffered_p0_EAX~0_106) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32| 0)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_30| |v_P1Thread1of1ForFork0_~arg#1.offset_30|) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~x$w_buff0~0_209 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|) (= v_~x$r_buff1_thd1~0_137 (ite .cse0 v_~x$r_buff0_thd1~0_137 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd1~0_136 256) 0))) (or (and .cse13 .cse1) .cse3 (and .cse13 .cse2))) v_~x$r_buff0_thd1~0_137 0))) (= (ite .cse7 0 1) v_~x$r_buff0_thd2~0_124) (= |v_P0Thread1of1ForFork1_#t~nondet3_70| v_~weak$$choice0~0_51)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_122, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_137, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_70|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_126, ~x~0=v_~x~0_210, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_70|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_302} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_136, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_71, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_137, ~x$mem_tmp~0=v_~x$mem_tmp~0_62, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_122, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_30|, ~x$w_buff1~0=v_~x$w_buff1~0_177, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_263, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_124, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_300, ~weak$$choice0~0=v_~weak$$choice0~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~x~0=v_~x~0_208} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [343] L756-->P0FINAL: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 12:06:05,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [402] $Ultimate##0-->L786: Formula: (let ((.cse1 (= (mod v_~x$r_buff0_thd1~0_137 256) 0)) (.cse6 (= (mod v_~x$w_buff0_used~0_302 256) 0))) (let ((.cse15 (and .cse1 .cse6))) (let ((.cse0 (not (= 0 (mod v_~weak$$choice2~0_78 256)))) (.cse14 (or .cse1 .cse15)) (.cse4 (not .cse1))) (let ((.cse11 (ite .cse0 1 (ite .cse14 1 (ite .cse4 0 1))))) (let ((.cse3 (= (mod .cse11 256) 0))) (let ((.cse10 (ite .cse0 v_~x$w_buff0_used~0_302 (ite (or .cse1 .cse3 .cse15) v_~x$w_buff0_used~0_302 0)))) (let ((.cse8 (not (= (mod v_~x$r_buff0_thd2~0_126 256) 0))) (.cse2 (= 0 (mod .cse10 256)))) (let ((.cse5 (not .cse3)) (.cse9 (and .cse8 (not .cse2))) (.cse12 (ite .cse14 v_~x~0_210 (ite .cse4 v_~x$w_buff0~0_209 v_~x$w_buff0~0_210))) (.cse7 (not (= (mod v_~x$w_buff0_used~0_300 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_137 (ite (or (and .cse1 .cse2) .cse1 .cse3) v_~x$r_buff0_thd1~0_137 (ite (and .cse4 .cse5) 0 v_~x$r_buff0_thd1~0_137))) v_~x$r_buff0_thd1~0_136) (= (ite .cse6 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|) (= v_~x$r_buff0_thd0~0_122 v_~x$r_buff1_thd0~0_127) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_177) (= v_~x$mem_tmp~0_62 v_~x~0_210) (= v_~y~0_95 2) (= v_~x$r_buff1_thd2~0_88 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_124 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_263 256) 0)))) 0 v_~x$r_buff0_thd2~0_126)) (= |v_P1Thread1of1ForFork0_~arg#1.base_30| |v_P1Thread1of1ForFork0_#in~arg#1.base_30|) (= |v_P0Thread1of1ForFork1_#t~nondet4_70| v_~weak$$choice2~0_78) (= (ite (or .cse7 .cse9) 0 .cse10) v_~x$w_buff1_used~0_263) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= (ite .cse5 0 .cse11) v_~x$w_buff0_used~0_300) (= (ite .cse5 v_~x$w_buff0~0_209 (ite .cse9 v_~x$w_buff1~0_177 (ite .cse0 v_~x$mem_tmp~0_62 .cse12))) v_~x~0_208) (= v_~x$flush_delayed~0_71 0) (= .cse12 v_~__unbuffered_p0_EAX~0_106) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32| 0)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_30| |v_P1Thread1of1ForFork0_~arg#1.offset_30|) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~x$w_buff0~0_209 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|) (= v_~x$r_buff1_thd1~0_137 (ite .cse0 v_~x$r_buff0_thd1~0_137 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd1~0_136 256) 0))) (or (and .cse13 .cse1) .cse3 (and .cse13 .cse2))) v_~x$r_buff0_thd1~0_137 0))) (= (ite .cse7 0 1) v_~x$r_buff0_thd2~0_124) (= |v_P0Thread1of1ForFork1_#t~nondet3_70| v_~weak$$choice0~0_51)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_122, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_137, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_70|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_126, ~x~0=v_~x~0_210, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_70|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_302} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_136, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_71, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_137, ~x$mem_tmp~0=v_~x$mem_tmp~0_62, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_122, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_30|, ~x$w_buff1~0=v_~x$w_buff1~0_177, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_263, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_124, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_300, ~weak$$choice0~0=v_~weak$$choice0~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~x~0=v_~x~0_208} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [344] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 12:06:05,799 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 12:06:05,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1867 [2022-12-13 12:06:05,800 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 111 flow [2022-12-13 12:06:05,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-13 12:06:05,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:05,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:05,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:06:05,801 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:06:05,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:05,801 INFO L85 PathProgramCache]: Analyzing trace with hash 452250180, now seen corresponding path program 1 times [2022-12-13 12:06:05,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:05,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757330301] [2022-12-13 12:06:05,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:05,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:05,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:06:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:05,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:06:05,847 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:06:05,847 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 12:06:05,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 12:06:05,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 12:06:05,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 12:06:05,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 12:06:05,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:06:05,849 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:05,853 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:06:05,853 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:06:05,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:06:05 BasicIcfg [2022-12-13 12:06:05,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:06:05,876 INFO L158 Benchmark]: Toolchain (without parser) took 9631.61ms. Allocated memory was 195.0MB in the beginning and 354.4MB in the end (delta: 159.4MB). Free memory was 169.9MB in the beginning and 217.9MB in the end (delta: -48.0MB). Peak memory consumption was 111.9MB. Max. memory is 8.0GB. [2022-12-13 12:06:05,876 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:06:05,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.90ms. Allocated memory is still 195.0MB. Free memory was 169.9MB in the beginning and 145.2MB in the end (delta: 24.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-13 12:06:05,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.18ms. Allocated memory is still 195.0MB. Free memory was 145.2MB in the beginning and 143.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:06:05,876 INFO L158 Benchmark]: Boogie Preprocessor took 65.40ms. Allocated memory is still 195.0MB. Free memory was 142.6MB in the beginning and 141.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 12:06:05,877 INFO L158 Benchmark]: RCFGBuilder took 622.66ms. Allocated memory is still 195.0MB. Free memory was 141.1MB in the beginning and 113.2MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 12:06:05,877 INFO L158 Benchmark]: TraceAbstraction took 8378.70ms. Allocated memory was 195.0MB in the beginning and 354.4MB in the end (delta: 159.4MB). Free memory was 112.2MB in the beginning and 217.9MB in the end (delta: -105.7MB). Peak memory consumption was 54.2MB. Max. memory is 8.0GB. [2022-12-13 12:06:05,878 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.09ms. Allocated memory is still 195.0MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 500.90ms. Allocated memory is still 195.0MB. Free memory was 169.9MB in the beginning and 145.2MB in the end (delta: 24.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.18ms. Allocated memory is still 195.0MB. Free memory was 145.2MB in the beginning and 143.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.40ms. Allocated memory is still 195.0MB. Free memory was 142.6MB in the beginning and 141.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 622.66ms. Allocated memory is still 195.0MB. Free memory was 141.1MB in the beginning and 113.2MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 8378.70ms. Allocated memory was 195.0MB in the beginning and 354.4MB in the end (delta: 159.4MB). Free memory was 112.2MB in the beginning and 217.9MB in the end (delta: -105.7MB). Peak memory consumption was 54.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 89 PlacesBefore, 50 PlacesAfterwards, 84 TransitionsBefore, 44 TransitionsAfterwards, 936 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 32 ConcurrentYvCompositions, 3 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1743, independent: 1653, independent conditional: 1653, independent unconditional: 0, dependent: 90, dependent conditional: 90, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1743, independent: 1653, independent conditional: 0, independent unconditional: 1653, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1743, independent: 1653, independent conditional: 0, independent unconditional: 1653, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1743, independent: 1653, independent conditional: 0, independent unconditional: 1653, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 921, independent: 893, independent conditional: 0, independent unconditional: 893, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 921, independent: 888, independent conditional: 0, independent unconditional: 888, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 146, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1743, independent: 760, independent conditional: 0, independent unconditional: 760, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 921, unknown conditional: 0, unknown unconditional: 921] , Statistics on independence cache: Total cache size (in pairs): 1882, Positive cache size: 1854, Positive conditional cache size: 0, Positive unconditional cache size: 1854, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, independent: 97, independent conditional: 97, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 121, independent: 97, independent conditional: 3, independent unconditional: 94, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, independent: 97, independent conditional: 3, independent unconditional: 94, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, independent: 97, independent conditional: 3, independent unconditional: 94, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 96, independent: 81, independent conditional: 3, independent unconditional: 78, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 96, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 54, dependent conditional: 7, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 96, unknown conditional: 4, unknown unconditional: 92] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 81, Positive conditional cache size: 3, Positive unconditional cache size: 78, Negative cache size: 15, Negative conditional cache size: 1, Negative unconditional cache size: 14, 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, 29 PlacesBefore, 29 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 71, independent: 52, independent conditional: 3, independent unconditional: 49, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 86, Positive conditional cache size: 3, Positive unconditional cache size: 83, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 56, independent conditional: 2, independent unconditional: 54, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 95, Positive conditional cache size: 3, Positive unconditional cache size: 92, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 36 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 26 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 116, independent conditional: 52, independent unconditional: 64, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 116, independent conditional: 48, independent unconditional: 68, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 116, independent conditional: 48, independent unconditional: 68, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 113, independent conditional: 45, independent unconditional: 68, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 102, Positive conditional cache size: 6, Positive unconditional cache size: 96, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 10, dependent conditional: 8, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 102, Positive conditional cache size: 6, Positive unconditional cache size: 96, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 34 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 20, independent conditional: 20, 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: 48, independent: 20, independent conditional: 5, independent unconditional: 15, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 20, independent conditional: 3, independent unconditional: 17, 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: 48, independent: 20, independent conditional: 3, independent unconditional: 17, 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: 5, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 109, Positive conditional cache size: 9, Positive unconditional cache size: 100, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 30 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 114, Positive conditional cache size: 14, Positive unconditional cache size: 100, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2561, ((void *)0), P0, ((void *)0))=-2, t2561={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2562, ((void *)0), P1, ((void *)0))=-1, t2561={5:0}, t2562={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 [L778] 2 y = 1 [L737] 2 y = 2 [L742] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 2 x$flush_delayed = weak$$choice2 [L745] 2 x$mem_tmp = x [L746] 2 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 2 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 2 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 2 __unbuffered_p0_EAX = x [L754] 2 x = x$flush_delayed ? x$mem_tmp : x [L755] 2 x$flush_delayed = (_Bool)0 [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: 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: 806]: 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: 804]: 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, 103 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 367 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 3 mSDtfsCounter, 367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-13 12:06:05,893 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...