/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:24:16,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:24:16,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:24:16,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:24:16,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:24:16,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:24:16,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:24:16,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:24:16,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:24:16,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:24:16,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:24:16,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:24:16,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:24:16,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:24:16,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:24:16,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:24:16,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:24:16,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:24:16,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:24:16,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:24:16,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:24:16,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:24:16,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:24:16,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:24:16,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:24:16,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:24:16,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:24:16,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:24:16,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:24:16,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:24:16,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:24:16,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:24:16,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:24:16,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:24:16,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:24:16,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:24:16,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:24:16,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:24:16,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:24:16,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:24:16,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:24:16,187 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-NoLbe.epf [2022-09-20 22:24:16,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:24:16,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:24:16,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:24:16,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:24:16,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:24:16,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:24:16,207 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:24:16,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:24:16,207 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:24:16,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:24:16,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:24:16,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:24:16,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:24:16,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:24:16,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:24:16,209 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:24:16,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:24:16,209 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:24:16,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:24:16,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:24:16,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:24:16,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:24:16,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:24:16,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:24:16,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:24:16,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:24:16,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:24:16,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:24:16,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:24:16,211 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:24:16,211 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:24:16,211 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-09-20 22:24:16,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:24:16,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:24:16,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:24:16,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:24:16,412 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:24:16,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-09-20 22:24:16,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7bb976ad/4e3d2f882f224e7692a233856d8575e7/FLAG1a2ec81df [2022-09-20 22:24:16,975 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:24:16,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-09-20 22:24:17,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7bb976ad/4e3d2f882f224e7692a233856d8575e7/FLAG1a2ec81df [2022-09-20 22:24:17,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7bb976ad/4e3d2f882f224e7692a233856d8575e7 [2022-09-20 22:24:17,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:24:17,304 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:24:17,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:24:17,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:24:17,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:24:17,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:17,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46fe0bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17, skipping insertion in model container [2022-09-20 22:24:17,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:17,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:24:17,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:24:17,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971] [2022-09-20 22:24:17,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:24:17,801 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:24:17,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971] [2022-09-20 22:24:17,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:24:17,920 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:24:17,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17 WrapperNode [2022-09-20 22:24:17,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:24:17,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:24:17,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:24:17,922 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:24:17,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:17,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:18,000 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2022-09-20 22:24:18,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:24:18,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:24:18,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:24:18,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:24:18,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:18,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:18,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:18,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:18,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:18,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:18,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:18,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:24:18,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:24:18,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:24:18,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:24:18,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17" (1/1) ... [2022-09-20 22:24:18,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:24:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:24:18,097 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-09-20 22:24:18,118 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-09-20 22:24:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:24:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 22:24:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:24:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:24:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:24:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 22:24:18,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 22:24:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 22:24:18,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 22:24:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 22:24:18,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 22:24:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-09-20 22:24:18,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-09-20 22:24:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:24:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 22:24:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:24:18,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:24:18,137 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 22:24:18,285 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:24:18,286 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:24:18,727 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:24:19,010 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:24:19,011 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 22:24:19,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:24:19 BoogieIcfgContainer [2022-09-20 22:24:19,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:24:19,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:24:19,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:24:19,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:24:19,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:24:17" (1/3) ... [2022-09-20 22:24:19,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ad2c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:24:19, skipping insertion in model container [2022-09-20 22:24:19,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:24:17" (2/3) ... [2022-09-20 22:24:19,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ad2c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:24:19, skipping insertion in model container [2022-09-20 22:24:19,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:24:19" (3/3) ... [2022-09-20 22:24:19,024 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2022-09-20 22:24:19,038 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:24:19,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 22:24:19,038 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:24:19,098 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 22:24:19,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-09-20 22:24:19,205 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-09-20 22:24:19,205 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:24:19,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-09-20 22:24:19,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-09-20 22:24:19,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-09-20 22:24:19,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:24:19,234 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=PETRI_NET, 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;@50cbc0ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:24:19,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-09-20 22:24:19,258 INFO L130 PetriNetUnfolder]: 0/77 cut-off events. [2022-09-20 22:24:19,259 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:24:19,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:19,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:19,261 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:19,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:19,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1810850912, now seen corresponding path program 1 times [2022-09-20 22:24:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:19,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361974279] [2022-09-20 22:24:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:19,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:19,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:19,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361974279] [2022-09-20 22:24:19,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361974279] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:19,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:19,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:24:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567160257] [2022-09-20 22:24:19,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:19,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:24:19,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:19,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:24:19,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:24:19,609 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2022-09-20 22:24:19,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-09-20 22:24:19,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:19,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2022-09-20 22:24:19,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:19,800 INFO L130 PetriNetUnfolder]: 37/318 cut-off events. [2022-09-20 22:24:19,800 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-09-20 22:24:19,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 318 events. 37/318 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1139 event pairs, 19 based on Foata normal form. 9/305 useless extension candidates. Maximal degree in co-relation 356. Up to 51 conditions per place. [2022-09-20 22:24:19,809 INFO L137 encePairwiseOnDemand]: 132/137 looper letters, 12 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2022-09-20 22:24:19,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 133 transitions, 309 flow [2022-09-20 22:24:19,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:24:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:24:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-09-20 22:24:19,828 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2022-09-20 22:24:19,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-09-20 22:24:19,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-09-20 22:24:19,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:19,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-09-20 22:24:19,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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-09-20 22:24:19,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:24:19,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:24:19,851 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 388 transitions. [2022-09-20 22:24:19,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 133 transitions, 309 flow [2022-09-20 22:24:19,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 133 transitions, 304 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 22:24:19,860 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-09-20 22:24:19,862 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-09-20 22:24:19,867 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-09-20 22:24:19,867 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-09-20 22:24:19,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-09-20 22:24:19,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:19,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:19,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:24:19,869 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:19,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash 544271704, now seen corresponding path program 1 times [2022-09-20 22:24:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:19,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009598393] [2022-09-20 22:24:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:20,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:20,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009598393] [2022-09-20 22:24:20,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009598393] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:20,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:20,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:24:20,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922408612] [2022-09-20 22:24:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:20,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:24:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:20,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:24:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:24:20,138 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2022-09-20 22:24:20,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 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-09-20 22:24:20,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:20,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2022-09-20 22:24:20,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:21,215 INFO L130 PetriNetUnfolder]: 1738/4375 cut-off events. [2022-09-20 22:24:21,216 INFO L131 PetriNetUnfolder]: For 188/188 co-relation queries the response was YES. [2022-09-20 22:24:21,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7115 conditions, 4375 events. 1738/4375 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 36372 event pairs, 266 based on Foata normal form. 0/4273 useless extension candidates. Maximal degree in co-relation 7053. Up to 1300 conditions per place. [2022-09-20 22:24:21,250 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 28 selfloop transitions, 2 changer transitions 62/183 dead transitions. [2022-09-20 22:24:21,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 183 transitions, 550 flow [2022-09-20 22:24:21,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:24:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:24:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1053 transitions. [2022-09-20 22:24:21,254 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8540145985401459 [2022-09-20 22:24:21,254 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1053 transitions. [2022-09-20 22:24:21,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1053 transitions. [2022-09-20 22:24:21,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:21,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1053 transitions. [2022-09-20 22:24:21,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 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-09-20 22:24:21,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-09-20 22:24:21,263 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-09-20 22:24:21,263 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 9 states and 1053 transitions. [2022-09-20 22:24:21,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 183 transitions, 550 flow [2022-09-20 22:24:21,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 183 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:24:21,269 INFO L231 Difference]: Finished difference. Result has 153 places, 115 transitions, 258 flow [2022-09-20 22:24:21,269 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=258, PETRI_PLACES=153, PETRI_TRANSITIONS=115} [2022-09-20 22:24:21,270 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2022-09-20 22:24:21,270 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 115 transitions, 258 flow [2022-09-20 22:24:21,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 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-09-20 22:24:21,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:21,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:21,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:24:21,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:21,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash 910962910, now seen corresponding path program 1 times [2022-09-20 22:24:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:21,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055103353] [2022-09-20 22:24:21,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:21,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055103353] [2022-09-20 22:24:21,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055103353] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:21,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:21,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:24:21,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916042826] [2022-09-20 22:24:21,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:21,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:24:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:24:21,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:24:21,439 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-09-20 22:24:21,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 115 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:24:21,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:21,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-09-20 22:24:21,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:22,218 INFO L130 PetriNetUnfolder]: 2005/3837 cut-off events. [2022-09-20 22:24:22,218 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2022-09-20 22:24:22,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7235 conditions, 3837 events. 2005/3837 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 28294 event pairs, 115 based on Foata normal form. 0/3746 useless extension candidates. Maximal degree in co-relation 7170. Up to 1189 conditions per place. [2022-09-20 22:24:22,246 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 32 selfloop transitions, 7 changer transitions 50/183 dead transitions. [2022-09-20 22:24:22,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 183 transitions, 578 flow [2022-09-20 22:24:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:24:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:24:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1211 transitions. [2022-09-20 22:24:22,250 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8839416058394161 [2022-09-20 22:24:22,250 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1211 transitions. [2022-09-20 22:24:22,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1211 transitions. [2022-09-20 22:24:22,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:22,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1211 transitions. [2022-09-20 22:24:22,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.1) internal successors, (1211), 10 states have internal predecessors, (1211), 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-09-20 22:24:22,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-09-20 22:24:22,257 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-09-20 22:24:22,257 INFO L175 Difference]: Start difference. First operand has 153 places, 115 transitions, 258 flow. Second operand 10 states and 1211 transitions. [2022-09-20 22:24:22,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 183 transitions, 578 flow [2022-09-20 22:24:22,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 183 transitions, 562 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-09-20 22:24:22,276 INFO L231 Difference]: Finished difference. Result has 140 places, 118 transitions, 308 flow [2022-09-20 22:24:22,276 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=308, PETRI_PLACES=140, PETRI_TRANSITIONS=118} [2022-09-20 22:24:22,278 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-09-20 22:24:22,278 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 118 transitions, 308 flow [2022-09-20 22:24:22,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:24:22,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:22,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:22,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:24:22,279 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:22,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash 477172693, now seen corresponding path program 1 times [2022-09-20 22:24:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:22,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072631786] [2022-09-20 22:24:22,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:22,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:22,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072631786] [2022-09-20 22:24:22,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072631786] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:22,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:22,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:24:22,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447986266] [2022-09-20 22:24:22,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:22,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:24:22,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:22,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:24:22,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:24:22,492 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-09-20 22:24:22,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 118 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-09-20 22:24:22,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:22,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-09-20 22:24:22,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:23,056 INFO L130 PetriNetUnfolder]: 1013/2244 cut-off events. [2022-09-20 22:24:23,057 INFO L131 PetriNetUnfolder]: For 2517/2545 co-relation queries the response was YES. [2022-09-20 22:24:23,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6209 conditions, 2244 events. 1013/2244 cut-off events. For 2517/2545 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16090 event pairs, 19 based on Foata normal form. 60/2288 useless extension candidates. Maximal degree in co-relation 6143. Up to 691 conditions per place. [2022-09-20 22:24:23,078 INFO L137 encePairwiseOnDemand]: 127/137 looper letters, 38 selfloop transitions, 11 changer transitions 39/182 dead transitions. [2022-09-20 22:24:23,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 182 transitions, 785 flow [2022-09-20 22:24:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:24:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:24:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1210 transitions. [2022-09-20 22:24:23,082 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8832116788321168 [2022-09-20 22:24:23,083 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1210 transitions. [2022-09-20 22:24:23,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1210 transitions. [2022-09-20 22:24:23,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:23,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1210 transitions. [2022-09-20 22:24:23,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 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-09-20 22:24:23,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-09-20 22:24:23,092 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-09-20 22:24:23,093 INFO L175 Difference]: Start difference. First operand has 140 places, 118 transitions, 308 flow. Second operand 10 states and 1210 transitions. [2022-09-20 22:24:23,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 182 transitions, 785 flow [2022-09-20 22:24:23,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 182 transitions, 760 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-09-20 22:24:23,108 INFO L231 Difference]: Finished difference. Result has 144 places, 122 transitions, 396 flow [2022-09-20 22:24:23,108 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=396, PETRI_PLACES=144, PETRI_TRANSITIONS=122} [2022-09-20 22:24:23,110 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2022-09-20 22:24:23,113 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 122 transitions, 396 flow [2022-09-20 22:24:23,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-09-20 22:24:23,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:23,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:23,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:24:23,116 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:23,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:23,117 INFO L85 PathProgramCache]: Analyzing trace with hash -128221161, now seen corresponding path program 1 times [2022-09-20 22:24:23,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:23,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102861069] [2022-09-20 22:24:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:23,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102861069] [2022-09-20 22:24:23,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102861069] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:23,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:23,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:24:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144564840] [2022-09-20 22:24:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:23,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:24:23,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:23,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:24:23,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:24:23,280 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-09-20 22:24:23,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 122 transitions, 396 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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-09-20 22:24:23,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:23,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-09-20 22:24:23,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:23,691 INFO L130 PetriNetUnfolder]: 424/1105 cut-off events. [2022-09-20 22:24:23,691 INFO L131 PetriNetUnfolder]: For 3366/3374 co-relation queries the response was YES. [2022-09-20 22:24:23,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3681 conditions, 1105 events. 424/1105 cut-off events. For 3366/3374 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6731 event pairs, 38 based on Foata normal form. 32/1115 useless extension candidates. Maximal degree in co-relation 3611. Up to 312 conditions per place. [2022-09-20 22:24:23,702 INFO L137 encePairwiseOnDemand]: 127/137 looper letters, 43 selfloop transitions, 15 changer transitions 39/191 dead transitions. [2022-09-20 22:24:23,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 191 transitions, 1056 flow [2022-09-20 22:24:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:24:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:24:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1331 transitions. [2022-09-20 22:24:23,707 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8832116788321168 [2022-09-20 22:24:23,707 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1331 transitions. [2022-09-20 22:24:23,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1331 transitions. [2022-09-20 22:24:23,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:23,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1331 transitions. [2022-09-20 22:24:23,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 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-09-20 22:24:23,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 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-09-20 22:24:23,715 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 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-09-20 22:24:23,715 INFO L175 Difference]: Start difference. First operand has 144 places, 122 transitions, 396 flow. Second operand 11 states and 1331 transitions. [2022-09-20 22:24:23,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 191 transitions, 1056 flow [2022-09-20 22:24:23,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 191 transitions, 876 flow, removed 79 selfloop flow, removed 9 redundant places. [2022-09-20 22:24:23,727 INFO L231 Difference]: Finished difference. Result has 147 places, 126 transitions, 446 flow [2022-09-20 22:24:23,727 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=446, PETRI_PLACES=147, PETRI_TRANSITIONS=126} [2022-09-20 22:24:23,730 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 3 predicate places. [2022-09-20 22:24:23,730 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 126 transitions, 446 flow [2022-09-20 22:24:23,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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-09-20 22:24:23,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:23,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:23,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:24:23,731 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:23,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1393211575, now seen corresponding path program 1 times [2022-09-20 22:24:23,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:23,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173306707] [2022-09-20 22:24:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:23,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173306707] [2022-09-20 22:24:23,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173306707] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:23,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:23,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:24:23,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613782833] [2022-09-20 22:24:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:23,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:24:23,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:23,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:24:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:24:23,868 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-09-20 22:24:23,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 126 transitions, 446 flow. Second operand has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 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-09-20 22:24:23,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:23,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-09-20 22:24:23,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:24,233 INFO L130 PetriNetUnfolder]: 249/1037 cut-off events. [2022-09-20 22:24:24,234 INFO L131 PetriNetUnfolder]: For 2408/2625 co-relation queries the response was YES. [2022-09-20 22:24:24,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2596 conditions, 1037 events. 249/1037 cut-off events. For 2408/2625 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6686 event pairs, 40 based on Foata normal form. 38/1040 useless extension candidates. Maximal degree in co-relation 2524. Up to 194 conditions per place. [2022-09-20 22:24:24,247 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 39 selfloop transitions, 2 changer transitions 17/165 dead transitions. [2022-09-20 22:24:24,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 165 transitions, 650 flow [2022-09-20 22:24:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:24:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:24:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2022-09-20 22:24:24,251 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.886339937434828 [2022-09-20 22:24:24,251 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2022-09-20 22:24:24,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2022-09-20 22:24:24,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:24,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2022-09-20 22:24:24,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 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-09-20 22:24:24,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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-09-20 22:24:24,256 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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-09-20 22:24:24,257 INFO L175 Difference]: Start difference. First operand has 147 places, 126 transitions, 446 flow. Second operand 7 states and 850 transitions. [2022-09-20 22:24:24,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 165 transitions, 650 flow [2022-09-20 22:24:24,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 165 transitions, 565 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-09-20 22:24:24,268 INFO L231 Difference]: Finished difference. Result has 144 places, 127 transitions, 380 flow [2022-09-20 22:24:24,268 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=380, PETRI_PLACES=144, PETRI_TRANSITIONS=127} [2022-09-20 22:24:24,269 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2022-09-20 22:24:24,269 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 127 transitions, 380 flow [2022-09-20 22:24:24,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 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-09-20 22:24:24,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:24,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:24,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:24:24,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:24,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:24,271 INFO L85 PathProgramCache]: Analyzing trace with hash -353725983, now seen corresponding path program 2 times [2022-09-20 22:24:24,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:24,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329691151] [2022-09-20 22:24:24,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:24,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:24,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-09-20 22:24:24,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:24,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329691151] [2022-09-20 22:24:24,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329691151] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:24,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:24,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:24:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747856642] [2022-09-20 22:24:24,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:24,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:24:24,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:24,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:24:24,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:24:24,412 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-09-20 22:24:24,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 127 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 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-09-20 22:24:24,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:24,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-09-20 22:24:24,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:25,027 INFO L130 PetriNetUnfolder]: 727/2605 cut-off events. [2022-09-20 22:24:25,027 INFO L131 PetriNetUnfolder]: For 2374/2630 co-relation queries the response was YES. [2022-09-20 22:24:25,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5560 conditions, 2605 events. 727/2605 cut-off events. For 2374/2630 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21898 event pairs, 203 based on Foata normal form. 108/2616 useless extension candidates. Maximal degree in co-relation 5486. Up to 503 conditions per place. [2022-09-20 22:24:25,055 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 49 selfloop transitions, 8 changer transitions 31/188 dead transitions. [2022-09-20 22:24:25,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 188 transitions, 738 flow [2022-09-20 22:24:25,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:24:25,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:24:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1254 transitions. [2022-09-20 22:24:25,059 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8321167883211679 [2022-09-20 22:24:25,059 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1254 transitions. [2022-09-20 22:24:25,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1254 transitions. [2022-09-20 22:24:25,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:25,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1254 transitions. [2022-09-20 22:24:25,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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-09-20 22:24:25,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 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-09-20 22:24:25,066 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 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-09-20 22:24:25,066 INFO L175 Difference]: Start difference. First operand has 144 places, 127 transitions, 380 flow. Second operand 11 states and 1254 transitions. [2022-09-20 22:24:25,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 188 transitions, 738 flow [2022-09-20 22:24:25,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 188 transitions, 711 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-09-20 22:24:25,094 INFO L231 Difference]: Finished difference. Result has 155 places, 132 transitions, 457 flow [2022-09-20 22:24:25,094 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=457, PETRI_PLACES=155, PETRI_TRANSITIONS=132} [2022-09-20 22:24:25,095 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 11 predicate places. [2022-09-20 22:24:25,095 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 132 transitions, 457 flow [2022-09-20 22:24:25,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 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-09-20 22:24:25,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:25,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:25,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 22:24:25,098 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:25,098 INFO L85 PathProgramCache]: Analyzing trace with hash 829427219, now seen corresponding path program 3 times [2022-09-20 22:24:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:25,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749805249] [2022-09-20 22:24:25,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:25,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:25,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749805249] [2022-09-20 22:24:25,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749805249] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:25,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:25,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 22:24:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532414394] [2022-09-20 22:24:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:25,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:24:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:24:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:24:25,271 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-09-20 22:24:25,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 132 transitions, 457 flow. Second operand has 9 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 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-09-20 22:24:25,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:25,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-09-20 22:24:25,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:25,632 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([931] L770-->L786: Formula: (let ((.cse23 (= (mod v_~y$r_buff1_thd2~0_129 256) 0)) (.cse26 (= (mod v_~y$r_buff0_thd2~0_176 256) 0)) (.cse31 (= (mod v_~y$w_buff1_used~0_286 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse8 (and .cse26 .cse31)) (.cse10 (and .cse26 .cse23)) (.cse17 (not .cse23)) (.cse2 (not .cse26)) (.cse30 (= (mod v_~y$w_buff0_used~0_366 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_365 256) 0)) (.cse24 (= (mod v_~y$w_buff1_used~0_285 256) 0))) (let ((.cse21 (not .cse24)) (.cse5 (or .cse26 .cse9)) (.cse4 (not .cse9)) (.cse15 (or .cse26 .cse30)) (.cse16 (not .cse30)) (.cse6 (or .cse2 (not .cse31))) (.cse7 (or .cse2 .cse17)) (.cse12 (or .cse30 .cse8 .cse10)) (.cse1 (not .cse11))) (and (= |v_P1Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_84) (let ((.cse0 (= |v_P1Thread1of1ForFork3_#t~ite16_1| |v_P1_#t~ite16_43|))) (or (and (= v_~y$w_buff1_used~0_286 v_~y$w_buff1_used~0_285) .cse0 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite17_1| |v_P1_#t~ite17_39|)) (and (or (and (let ((.cse3 (= |v_P1_#t~ite16_43| 0))) (or (and .cse2 .cse3 .cse4) (and .cse5 .cse3))) (= |v_P1_#t~ite17_39| |v_P1_#t~ite16_43|) .cse6 .cse4 .cse7) (and (or .cse8 .cse9 .cse10) .cse0 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_286))) .cse11 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_285)))) (= 0 v_~y$flush_delayed~0_40) (or (and (= v_~y~0_132 v_~y$mem_tmp~0_28) .cse1) (and (= v_~y~0_132 v_~__unbuffered_p1_EAX~0_16) .cse11)) (let ((.cse13 (= |v_P1_#t~ite7_45| |v_P1Thread1of1ForFork3_#t~ite7_1|))) (or (and (or (and .cse12 (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_86) .cse13) (and (= |v_P1_#t~ite8_43| |v_P1_#t~ite7_45|) (let ((.cse14 (= |v_P1_#t~ite7_45| v_~y$w_buff0~0_86))) (or (and .cse14 .cse15) (and .cse14 .cse2 .cse16))) .cse16 .cse6 .cse7)) (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_85) .cse11) (and (= |v_P1_#t~ite8_43| |v_P1Thread1of1ForFork3_#t~ite8_1|) (= v_~y$w_buff0~0_86 v_~y$w_buff0~0_85) .cse1 .cse13))) (let ((.cse22 (= |v_P1Thread1of1ForFork3_#t~ite22_1| |v_P1_#t~ite22_53|))) (or (and (let ((.cse20 (= (mod v_~y$r_buff0_thd2~0_175 256) 0))) (or (let ((.cse18 (not .cse20))) (and (or .cse17 .cse18) (let ((.cse19 (= |v_P1_#t~ite22_53| 0))) (or (and .cse19 (or .cse20 .cse9)) (and .cse19 .cse18 .cse4))) (or .cse21 .cse18) (= |v_P1_#t~ite22_53| |v_P1_#t~ite23_47|) .cse4)) (and .cse22 (or (and .cse20 .cse23) (and .cse20 .cse24) .cse9) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_129)))) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_128) .cse11) (and .cse22 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite23_1| |v_P1_#t~ite23_47|) (= v_~y$r_buff1_thd2~0_129 v_~y$r_buff1_thd2~0_128)))) (= v_~y~0_134 v_~y$mem_tmp~0_28) (let ((.cse25 (= |v_P1Thread1of1ForFork3_#t~ite19_1| |v_P1_#t~ite19_63|))) (or (and (or (and .cse25 (or .cse9 .cse10 (and .cse26 .cse24)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_176)) (and (= |v_P1_#t~ite19_63| |v_P1_#t~ite20_57|) (or .cse21 .cse2) (or (and .cse5 (= |v_P1_#t~ite19_63| v_~y$r_buff0_thd2~0_176)) (and .cse2 (= |v_P1_#t~ite19_63| 0) .cse4)) .cse4 .cse7)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_175) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite20_1| |v_P1_#t~ite20_57|) .cse25 (= v_~y$r_buff0_thd2~0_176 v_~y$r_buff0_thd2~0_175) .cse1))) (or (and .cse12 (= v_~y~0_134 v_~__unbuffered_p1_EAX~0_16) (= |v_P1_#t~ite5_47| |v_P1Thread1of1ForFork3_#t~ite5_1|)) (and (= |v_P1_#t~ite5_47| v_~__unbuffered_p1_EAX~0_16) .cse16 .cse6 (or (and (= |v_P1_#t~ite5_47| v_~y$w_buff1~0_97) .cse15) (and .cse2 .cse16 (= |v_P1_#t~ite5_47| v_~y$w_buff0~0_86))) .cse7)) (let ((.cse28 (= |v_P1Thread1of1ForFork3_#t~ite10_1| |v_P1_#t~ite10_49|))) (or (and (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_96) .cse11 (or (and (= |v_P1_#t~ite10_49| |v_P1_#t~ite11_45|) .cse16 (let ((.cse27 (= |v_P1_#t~ite10_49| v_~y$w_buff1~0_97))) (or (and .cse27 .cse2 .cse16) (and .cse27 .cse15))) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_97) .cse28))) (and (= v_~y$w_buff1~0_97 v_~y$w_buff1~0_96) .cse28 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite11_1| |v_P1_#t~ite11_45|)))) (= |v_P1Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_13) (let ((.cse29 (= |v_P1Thread1of1ForFork3_#t~ite13_1| |v_P1_#t~ite13_57|))) (or (and (or (and (= |v_P1_#t~ite13_57| |v_P1_#t~ite14_49|) .cse16 (or (and .cse15 (= |v_P1_#t~ite13_57| v_~y$w_buff0_used~0_366)) (and (= |v_P1_#t~ite13_57| 0) .cse2 .cse16)) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_366) .cse29)) (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_365) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite14_1| |v_P1_#t~ite14_49|) .cse29 .cse1 (= v_~y$w_buff0_used~0_366 v_~y$w_buff0_used~0_365)))))))) InVars {P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_1|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_1|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_366, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_1|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_1|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_1|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_1|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_1|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_1|, ~y$w_buff1~0=v_~y$w_buff1~0_97, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_1|, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_176, ~y~0=v_~y~0_134, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{P1Thread1of1ForFork3_#t~ite18=|v_P1Thread1of1ForFork3_#t~ite18_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, P1Thread1of1ForFork3_#t~ite21=|v_P1Thread1of1ForFork3_#t~ite21_1|, P1Thread1of1ForFork3_#t~ite6=|v_P1Thread1of1ForFork3_#t~ite6_1|, P1Thread1of1ForFork3_#t~ite25=|v_P1Thread1of1ForFork3_#t~ite25_1|, P1Thread1of1ForFork3_#t~ite12=|v_P1Thread1of1ForFork3_#t~ite12_1|, P1Thread1of1ForFork3_#t~ite15=|v_P1Thread1of1ForFork3_#t~ite15_1|, P1Thread1of1ForFork3_#t~ite24=|v_P1Thread1of1ForFork3_#t~ite24_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_128, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~y$mem_tmp~0=v_~y$mem_tmp~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff1~0=v_~y$w_buff1~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_85, P1Thread1of1ForFork3_#t~ite9=|v_P1Thread1of1ForFork3_#t~ite9_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285} AuxVars[|v_P1_#t~ite23_47|, |v_P1_#t~ite22_53|, |v_P1_#t~ite7_45|, |v_P1_#t~ite10_49|, |v_P1_#t~ite5_47|, |v_P1_#t~ite8_43|, |v_P1_#t~ite17_39|, |v_P1_#t~ite11_45|, |v_P1_#t~ite19_63|, |v_P1_#t~ite14_49|, |v_P1_#t~ite13_57|, |v_P1_#t~ite20_57|, |v_P1_#t~ite16_43|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork3_#t~ite21, P1Thread1of1ForFork3_#t~ite22, P1Thread1of1ForFork3_#t~ite20, P1Thread1of1ForFork3_#t~ite25, P1Thread1of1ForFork3_#t~ite23, P1Thread1of1ForFork3_#t~ite24, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, P1Thread1of1ForFork3_#t~ite17, P1Thread1of1ForFork3_#t~ite16, P1Thread1of1ForFork3_#t~ite19, P1Thread1of1ForFork3_#t~ite18, P1Thread1of1ForFork3_#t~nondet4, P1Thread1of1ForFork3_#t~nondet3, P1Thread1of1ForFork3_#t~ite6, P1Thread1of1ForFork3_#t~ite11, P1Thread1of1ForFork3_#t~ite5, P1Thread1of1ForFork3_#t~ite10, P1Thread1of1ForFork3_#t~ite13, P1Thread1of1ForFork3_#t~ite12, P1Thread1of1ForFork3_#t~ite15, P1Thread1of1ForFork3_#t~ite14, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, P1Thread1of1ForFork3_#t~ite8, P1Thread1of1ForFork3_#t~ite7, P1Thread1of1ForFork3_#t~ite9, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~y$w_buff1_used~0][74], [Black: 189#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 213#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 187#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 109#L811true, 321#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 260#(= ~a~0 1), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 126#L763true, 281#(= ~x~0 1), 26#L841true, 62#L786true, 266#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 289#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 291#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 17#L865-3true, Black: 293#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 295#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 287#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 242#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-09-20 22:24:25,635 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-09-20 22:24:25,636 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:24:25,636 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:24:25,636 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-09-20 22:24:25,687 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([931] L770-->L786: Formula: (let ((.cse23 (= (mod v_~y$r_buff1_thd2~0_129 256) 0)) (.cse26 (= (mod v_~y$r_buff0_thd2~0_176 256) 0)) (.cse31 (= (mod v_~y$w_buff1_used~0_286 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse8 (and .cse26 .cse31)) (.cse10 (and .cse26 .cse23)) (.cse17 (not .cse23)) (.cse2 (not .cse26)) (.cse30 (= (mod v_~y$w_buff0_used~0_366 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_365 256) 0)) (.cse24 (= (mod v_~y$w_buff1_used~0_285 256) 0))) (let ((.cse21 (not .cse24)) (.cse5 (or .cse26 .cse9)) (.cse4 (not .cse9)) (.cse15 (or .cse26 .cse30)) (.cse16 (not .cse30)) (.cse6 (or .cse2 (not .cse31))) (.cse7 (or .cse2 .cse17)) (.cse12 (or .cse30 .cse8 .cse10)) (.cse1 (not .cse11))) (and (= |v_P1Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_84) (let ((.cse0 (= |v_P1Thread1of1ForFork3_#t~ite16_1| |v_P1_#t~ite16_43|))) (or (and (= v_~y$w_buff1_used~0_286 v_~y$w_buff1_used~0_285) .cse0 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite17_1| |v_P1_#t~ite17_39|)) (and (or (and (let ((.cse3 (= |v_P1_#t~ite16_43| 0))) (or (and .cse2 .cse3 .cse4) (and .cse5 .cse3))) (= |v_P1_#t~ite17_39| |v_P1_#t~ite16_43|) .cse6 .cse4 .cse7) (and (or .cse8 .cse9 .cse10) .cse0 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_286))) .cse11 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_285)))) (= 0 v_~y$flush_delayed~0_40) (or (and (= v_~y~0_132 v_~y$mem_tmp~0_28) .cse1) (and (= v_~y~0_132 v_~__unbuffered_p1_EAX~0_16) .cse11)) (let ((.cse13 (= |v_P1_#t~ite7_45| |v_P1Thread1of1ForFork3_#t~ite7_1|))) (or (and (or (and .cse12 (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_86) .cse13) (and (= |v_P1_#t~ite8_43| |v_P1_#t~ite7_45|) (let ((.cse14 (= |v_P1_#t~ite7_45| v_~y$w_buff0~0_86))) (or (and .cse14 .cse15) (and .cse14 .cse2 .cse16))) .cse16 .cse6 .cse7)) (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_85) .cse11) (and (= |v_P1_#t~ite8_43| |v_P1Thread1of1ForFork3_#t~ite8_1|) (= v_~y$w_buff0~0_86 v_~y$w_buff0~0_85) .cse1 .cse13))) (let ((.cse22 (= |v_P1Thread1of1ForFork3_#t~ite22_1| |v_P1_#t~ite22_53|))) (or (and (let ((.cse20 (= (mod v_~y$r_buff0_thd2~0_175 256) 0))) (or (let ((.cse18 (not .cse20))) (and (or .cse17 .cse18) (let ((.cse19 (= |v_P1_#t~ite22_53| 0))) (or (and .cse19 (or .cse20 .cse9)) (and .cse19 .cse18 .cse4))) (or .cse21 .cse18) (= |v_P1_#t~ite22_53| |v_P1_#t~ite23_47|) .cse4)) (and .cse22 (or (and .cse20 .cse23) (and .cse20 .cse24) .cse9) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_129)))) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_128) .cse11) (and .cse22 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite23_1| |v_P1_#t~ite23_47|) (= v_~y$r_buff1_thd2~0_129 v_~y$r_buff1_thd2~0_128)))) (= v_~y~0_134 v_~y$mem_tmp~0_28) (let ((.cse25 (= |v_P1Thread1of1ForFork3_#t~ite19_1| |v_P1_#t~ite19_63|))) (or (and (or (and .cse25 (or .cse9 .cse10 (and .cse26 .cse24)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_176)) (and (= |v_P1_#t~ite19_63| |v_P1_#t~ite20_57|) (or .cse21 .cse2) (or (and .cse5 (= |v_P1_#t~ite19_63| v_~y$r_buff0_thd2~0_176)) (and .cse2 (= |v_P1_#t~ite19_63| 0) .cse4)) .cse4 .cse7)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_175) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite20_1| |v_P1_#t~ite20_57|) .cse25 (= v_~y$r_buff0_thd2~0_176 v_~y$r_buff0_thd2~0_175) .cse1))) (or (and .cse12 (= v_~y~0_134 v_~__unbuffered_p1_EAX~0_16) (= |v_P1_#t~ite5_47| |v_P1Thread1of1ForFork3_#t~ite5_1|)) (and (= |v_P1_#t~ite5_47| v_~__unbuffered_p1_EAX~0_16) .cse16 .cse6 (or (and (= |v_P1_#t~ite5_47| v_~y$w_buff1~0_97) .cse15) (and .cse2 .cse16 (= |v_P1_#t~ite5_47| v_~y$w_buff0~0_86))) .cse7)) (let ((.cse28 (= |v_P1Thread1of1ForFork3_#t~ite10_1| |v_P1_#t~ite10_49|))) (or (and (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_96) .cse11 (or (and (= |v_P1_#t~ite10_49| |v_P1_#t~ite11_45|) .cse16 (let ((.cse27 (= |v_P1_#t~ite10_49| v_~y$w_buff1~0_97))) (or (and .cse27 .cse2 .cse16) (and .cse27 .cse15))) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_97) .cse28))) (and (= v_~y$w_buff1~0_97 v_~y$w_buff1~0_96) .cse28 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite11_1| |v_P1_#t~ite11_45|)))) (= |v_P1Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_13) (let ((.cse29 (= |v_P1Thread1of1ForFork3_#t~ite13_1| |v_P1_#t~ite13_57|))) (or (and (or (and (= |v_P1_#t~ite13_57| |v_P1_#t~ite14_49|) .cse16 (or (and .cse15 (= |v_P1_#t~ite13_57| v_~y$w_buff0_used~0_366)) (and (= |v_P1_#t~ite13_57| 0) .cse2 .cse16)) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_366) .cse29)) (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_365) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite14_1| |v_P1_#t~ite14_49|) .cse29 .cse1 (= v_~y$w_buff0_used~0_366 v_~y$w_buff0_used~0_365)))))))) InVars {P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_1|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_1|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_366, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_1|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_1|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_1|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_1|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_1|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_1|, ~y$w_buff1~0=v_~y$w_buff1~0_97, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_1|, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_176, ~y~0=v_~y~0_134, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{P1Thread1of1ForFork3_#t~ite18=|v_P1Thread1of1ForFork3_#t~ite18_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, P1Thread1of1ForFork3_#t~ite21=|v_P1Thread1of1ForFork3_#t~ite21_1|, P1Thread1of1ForFork3_#t~ite6=|v_P1Thread1of1ForFork3_#t~ite6_1|, P1Thread1of1ForFork3_#t~ite25=|v_P1Thread1of1ForFork3_#t~ite25_1|, P1Thread1of1ForFork3_#t~ite12=|v_P1Thread1of1ForFork3_#t~ite12_1|, P1Thread1of1ForFork3_#t~ite15=|v_P1Thread1of1ForFork3_#t~ite15_1|, P1Thread1of1ForFork3_#t~ite24=|v_P1Thread1of1ForFork3_#t~ite24_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_128, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~y$mem_tmp~0=v_~y$mem_tmp~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff1~0=v_~y$w_buff1~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_85, P1Thread1of1ForFork3_#t~ite9=|v_P1Thread1of1ForFork3_#t~ite9_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285} AuxVars[|v_P1_#t~ite23_47|, |v_P1_#t~ite22_53|, |v_P1_#t~ite7_45|, |v_P1_#t~ite10_49|, |v_P1_#t~ite5_47|, |v_P1_#t~ite8_43|, |v_P1_#t~ite17_39|, |v_P1_#t~ite11_45|, |v_P1_#t~ite19_63|, |v_P1_#t~ite14_49|, |v_P1_#t~ite13_57|, |v_P1_#t~ite20_57|, |v_P1_#t~ite16_43|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork3_#t~ite21, P1Thread1of1ForFork3_#t~ite22, P1Thread1of1ForFork3_#t~ite20, P1Thread1of1ForFork3_#t~ite25, P1Thread1of1ForFork3_#t~ite23, P1Thread1of1ForFork3_#t~ite24, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, P1Thread1of1ForFork3_#t~ite17, P1Thread1of1ForFork3_#t~ite16, P1Thread1of1ForFork3_#t~ite19, P1Thread1of1ForFork3_#t~ite18, P1Thread1of1ForFork3_#t~nondet4, P1Thread1of1ForFork3_#t~nondet3, P1Thread1of1ForFork3_#t~ite6, P1Thread1of1ForFork3_#t~ite11, P1Thread1of1ForFork3_#t~ite5, P1Thread1of1ForFork3_#t~ite10, P1Thread1of1ForFork3_#t~ite13, P1Thread1of1ForFork3_#t~ite12, P1Thread1of1ForFork3_#t~ite15, P1Thread1of1ForFork3_#t~ite14, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, P1Thread1of1ForFork3_#t~ite8, P1Thread1of1ForFork3_#t~ite7, P1Thread1of1ForFork3_#t~ite9, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~y$w_buff1_used~0][109], [323#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 187#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 109#L811true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 260#(= ~a~0 1), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 242#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 126#L763true, 281#(= ~x~0 1), Black: 213#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 99#L844true, 62#L786true, 266#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 289#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 291#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 17#L865-3true, Black: 293#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 295#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 287#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1))]) [2022-09-20 22:24:25,687 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-09-20 22:24:25,687 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-09-20 22:24:25,688 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-09-20 22:24:25,688 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-09-20 22:24:25,942 INFO L130 PetriNetUnfolder]: 1087/2823 cut-off events. [2022-09-20 22:24:25,942 INFO L131 PetriNetUnfolder]: For 4992/5720 co-relation queries the response was YES. [2022-09-20 22:24:25,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8026 conditions, 2823 events. 1087/2823 cut-off events. For 4992/5720 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23360 event pairs, 107 based on Foata normal form. 171/2803 useless extension candidates. Maximal degree in co-relation 8003. Up to 544 conditions per place. [2022-09-20 22:24:25,969 INFO L137 encePairwiseOnDemand]: 127/137 looper letters, 37 selfloop transitions, 21 changer transitions 21/178 dead transitions. [2022-09-20 22:24:25,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 178 transitions, 876 flow [2022-09-20 22:24:25,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 22:24:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 22:24:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1419 transitions. [2022-09-20 22:24:25,973 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8631386861313869 [2022-09-20 22:24:25,973 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1419 transitions. [2022-09-20 22:24:25,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1419 transitions. [2022-09-20 22:24:25,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:25,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1419 transitions. [2022-09-20 22:24:25,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 118.25) internal successors, (1419), 12 states have internal predecessors, (1419), 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-09-20 22:24:25,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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-09-20 22:24:25,980 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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-09-20 22:24:25,980 INFO L175 Difference]: Start difference. First operand has 155 places, 132 transitions, 457 flow. Second operand 12 states and 1419 transitions. [2022-09-20 22:24:25,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 178 transitions, 876 flow [2022-09-20 22:24:26,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 178 transitions, 830 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-09-20 22:24:26,010 INFO L231 Difference]: Finished difference. Result has 160 places, 135 transitions, 515 flow [2022-09-20 22:24:26,010 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=515, PETRI_PLACES=160, PETRI_TRANSITIONS=135} [2022-09-20 22:24:26,012 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 16 predicate places. [2022-09-20 22:24:26,013 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 135 transitions, 515 flow [2022-09-20 22:24:26,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 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-09-20 22:24:26,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:26,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:26,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 22:24:26,014 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash 341905874, now seen corresponding path program 1 times [2022-09-20 22:24:26,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:26,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571087021] [2022-09-20 22:24:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:26,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:26,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:26,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571087021] [2022-09-20 22:24:26,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571087021] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:26,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:26,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:24:26,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228839123] [2022-09-20 22:24:26,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:26,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:24:26,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:26,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:24:26,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:24:26,150 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-09-20 22:24:26,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 135 transitions, 515 flow. Second operand has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 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-09-20 22:24:26,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:26,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-09-20 22:24:26,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:26,685 INFO L130 PetriNetUnfolder]: 725/2567 cut-off events. [2022-09-20 22:24:26,685 INFO L131 PetriNetUnfolder]: For 4662/4874 co-relation queries the response was YES. [2022-09-20 22:24:26,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7386 conditions, 2567 events. 725/2567 cut-off events. For 4662/4874 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 23199 event pairs, 81 based on Foata normal form. 3/2480 useless extension candidates. Maximal degree in co-relation 7303. Up to 482 conditions per place. [2022-09-20 22:24:26,710 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 29 selfloop transitions, 10 changer transitions 14/156 dead transitions. [2022-09-20 22:24:26,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 156 transitions, 727 flow [2022-09-20 22:24:26,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 22:24:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 22:24:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 891 transitions. [2022-09-20 22:24:26,713 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8129562043795621 [2022-09-20 22:24:26,713 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 891 transitions. [2022-09-20 22:24:26,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 891 transitions. [2022-09-20 22:24:26,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:26,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 891 transitions. [2022-09-20 22:24:26,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.375) internal successors, (891), 8 states have internal predecessors, (891), 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-09-20 22:24:26,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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-09-20 22:24:26,717 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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-09-20 22:24:26,718 INFO L175 Difference]: Start difference. First operand has 160 places, 135 transitions, 515 flow. Second operand 8 states and 891 transitions. [2022-09-20 22:24:26,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 156 transitions, 727 flow [2022-09-20 22:24:26,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 156 transitions, 612 flow, removed 45 selfloop flow, removed 12 redundant places. [2022-09-20 22:24:26,752 INFO L231 Difference]: Finished difference. Result has 158 places, 138 transitions, 481 flow [2022-09-20 22:24:26,752 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=481, PETRI_PLACES=158, PETRI_TRANSITIONS=138} [2022-09-20 22:24:26,753 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 14 predicate places. [2022-09-20 22:24:26,753 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 138 transitions, 481 flow [2022-09-20 22:24:26,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 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-09-20 22:24:26,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:26,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:26,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:24:26,754 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:26,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1387689492, now seen corresponding path program 2 times [2022-09-20 22:24:26,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:26,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885713077] [2022-09-20 22:24:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:26,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885713077] [2022-09-20 22:24:26,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885713077] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:26,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:26,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 22:24:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697321037] [2022-09-20 22:24:26,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:26,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:24:26,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:26,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:24:26,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:24:26,920 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-09-20 22:24:26,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 138 transitions, 481 flow. Second operand has 9 states, 9 states have (on average 112.44444444444444) internal successors, (1012), 9 states have internal predecessors, (1012), 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-09-20 22:24:26,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:26,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-09-20 22:24:26,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:27,374 INFO L130 PetriNetUnfolder]: 503/2296 cut-off events. [2022-09-20 22:24:27,374 INFO L131 PetriNetUnfolder]: For 1544/1680 co-relation queries the response was YES. [2022-09-20 22:24:27,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5245 conditions, 2296 events. 503/2296 cut-off events. For 1544/1680 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22170 event pairs, 19 based on Foata normal form. 1/2193 useless extension candidates. Maximal degree in co-relation 5222. Up to 333 conditions per place. [2022-09-20 22:24:27,398 INFO L137 encePairwiseOnDemand]: 127/137 looper letters, 28 selfloop transitions, 10 changer transitions 6/158 dead transitions. [2022-09-20 22:24:27,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 158 transitions, 653 flow [2022-09-20 22:24:27,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:24:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:24:27,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1139 transitions. [2022-09-20 22:24:27,402 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8313868613138686 [2022-09-20 22:24:27,402 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1139 transitions. [2022-09-20 22:24:27,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1139 transitions. [2022-09-20 22:24:27,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:27,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1139 transitions. [2022-09-20 22:24:27,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.9) internal successors, (1139), 10 states have internal predecessors, (1139), 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-09-20 22:24:27,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-09-20 22:24:27,408 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-09-20 22:24:27,408 INFO L175 Difference]: Start difference. First operand has 158 places, 138 transitions, 481 flow. Second operand 10 states and 1139 transitions. [2022-09-20 22:24:27,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 158 transitions, 653 flow [2022-09-20 22:24:27,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 158 transitions, 599 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-09-20 22:24:27,437 INFO L231 Difference]: Finished difference. Result has 161 places, 146 transitions, 521 flow [2022-09-20 22:24:27,437 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=521, PETRI_PLACES=161, PETRI_TRANSITIONS=146} [2022-09-20 22:24:27,437 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 17 predicate places. [2022-09-20 22:24:27,438 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 146 transitions, 521 flow [2022-09-20 22:24:27,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.44444444444444) internal successors, (1012), 9 states have internal predecessors, (1012), 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-09-20 22:24:27,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:27,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:27,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 22:24:27,439 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:27,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:27,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1049475820, now seen corresponding path program 3 times [2022-09-20 22:24:27,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:27,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031600827] [2022-09-20 22:24:27,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:27,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:27,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:27,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031600827] [2022-09-20 22:24:27,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031600827] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:27,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:27,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:24:27,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694686086] [2022-09-20 22:24:27,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:27,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:24:27,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:27,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:24:27,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:24:27,711 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 137 [2022-09-20 22:24:27,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 146 transitions, 521 flow. Second operand has 11 states, 11 states have (on average 102.9090909090909) internal successors, (1132), 11 states have internal predecessors, (1132), 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-09-20 22:24:27,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:27,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 137 [2022-09-20 22:24:27,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:28,308 INFO L130 PetriNetUnfolder]: 631/2662 cut-off events. [2022-09-20 22:24:28,308 INFO L131 PetriNetUnfolder]: For 1955/1961 co-relation queries the response was YES. [2022-09-20 22:24:28,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5931 conditions, 2662 events. 631/2662 cut-off events. For 1955/1961 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 25957 event pairs, 31 based on Foata normal form. 6/2567 useless extension candidates. Maximal degree in co-relation 5908. Up to 346 conditions per place. [2022-09-20 22:24:28,329 INFO L137 encePairwiseOnDemand]: 122/137 looper letters, 45 selfloop transitions, 13 changer transitions 20/175 dead transitions. [2022-09-20 22:24:28,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 175 transitions, 863 flow [2022-09-20 22:24:28,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 22:24:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 22:24:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1255 transitions. [2022-09-20 22:24:28,333 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76338199513382 [2022-09-20 22:24:28,333 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1255 transitions. [2022-09-20 22:24:28,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1255 transitions. [2022-09-20 22:24:28,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:28,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1255 transitions. [2022-09-20 22:24:28,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 104.58333333333333) internal successors, (1255), 12 states have internal predecessors, (1255), 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-09-20 22:24:28,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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-09-20 22:24:28,340 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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-09-20 22:24:28,340 INFO L175 Difference]: Start difference. First operand has 161 places, 146 transitions, 521 flow. Second operand 12 states and 1255 transitions. [2022-09-20 22:24:28,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 175 transitions, 863 flow [2022-09-20 22:24:28,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 175 transitions, 852 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-09-20 22:24:28,361 INFO L231 Difference]: Finished difference. Result has 171 places, 146 transitions, 574 flow [2022-09-20 22:24:28,361 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=574, PETRI_PLACES=171, PETRI_TRANSITIONS=146} [2022-09-20 22:24:28,361 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 27 predicate places. [2022-09-20 22:24:28,361 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 146 transitions, 574 flow [2022-09-20 22:24:28,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 102.9090909090909) internal successors, (1132), 11 states have internal predecessors, (1132), 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-09-20 22:24:28,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:28,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:28,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:24:28,363 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:28,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:28,363 INFO L85 PathProgramCache]: Analyzing trace with hash -315718964, now seen corresponding path program 4 times [2022-09-20 22:24:28,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:28,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473120645] [2022-09-20 22:24:28,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:28,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:24:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:24:28,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:24:28,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473120645] [2022-09-20 22:24:28,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473120645] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:24:28,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:24:28,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:24:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014817565] [2022-09-20 22:24:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:24:28,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:24:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:24:28,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:24:28,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:24:28,470 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-09-20 22:24:28,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 146 transitions, 574 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 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-09-20 22:24:28,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:24:28,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-09-20 22:24:28,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:24:28,939 INFO L130 PetriNetUnfolder]: 619/2784 cut-off events. [2022-09-20 22:24:28,940 INFO L131 PetriNetUnfolder]: For 2754/2889 co-relation queries the response was YES. [2022-09-20 22:24:28,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6281 conditions, 2784 events. 619/2784 cut-off events. For 2754/2889 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 28446 event pairs, 36 based on Foata normal form. 7/2665 useless extension candidates. Maximal degree in co-relation 6255. Up to 408 conditions per place. [2022-09-20 22:24:28,953 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 22 selfloop transitions, 1 changer transitions 33/166 dead transitions. [2022-09-20 22:24:28,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 853 flow [2022-09-20 22:24:28,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:24:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:24:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 818 transitions. [2022-09-20 22:24:28,956 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8529718456725756 [2022-09-20 22:24:28,956 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 818 transitions. [2022-09-20 22:24:28,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 818 transitions. [2022-09-20 22:24:28,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:24:28,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 818 transitions. [2022-09-20 22:24:28,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 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-09-20 22:24:28,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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-09-20 22:24:28,960 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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-09-20 22:24:28,960 INFO L175 Difference]: Start difference. First operand has 171 places, 146 transitions, 574 flow. Second operand 7 states and 818 transitions. [2022-09-20 22:24:28,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 853 flow [2022-09-20 22:24:28,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 166 transitions, 799 flow, removed 17 selfloop flow, removed 10 redundant places. [2022-09-20 22:24:28,983 INFO L231 Difference]: Finished difference. Result has 166 places, 133 transitions, 431 flow [2022-09-20 22:24:28,984 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=431, PETRI_PLACES=166, PETRI_TRANSITIONS=133} [2022-09-20 22:24:28,984 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 22 predicate places. [2022-09-20 22:24:28,984 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 133 transitions, 431 flow [2022-09-20 22:24:28,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 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-09-20 22:24:28,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:24:28,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:24:28,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 22:24:28,985 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:24:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:24:28,986 INFO L85 PathProgramCache]: Analyzing trace with hash 187587362, now seen corresponding path program 5 times [2022-09-20 22:24:28,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:24:28,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855285948] [2022-09-20 22:24:28,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:24:28,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:24:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:24:29,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 22:24:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:24:29,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 22:24:29,092 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 22:24:29,093 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-09-20 22:24:29,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-09-20 22:24:29,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-09-20 22:24:29,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-09-20 22:24:29,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-09-20 22:24:29,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-09-20 22:24:29,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-09-20 22:24:29,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 22:24:29,095 INFO L444 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1] [2022-09-20 22:24:29,100 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 22:24:29,100 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 22:24:29,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 10:24:29 BasicIcfg [2022-09-20 22:24:29,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 22:24:29,256 INFO L158 Benchmark]: Toolchain (without parser) took 11951.97ms. Allocated memory was 183.5MB in the beginning and 608.2MB in the end (delta: 424.7MB). Free memory was 154.5MB in the beginning and 364.7MB in the end (delta: -210.2MB). Peak memory consumption was 214.4MB. Max. memory is 8.0GB. [2022-09-20 22:24:29,256 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 183.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 22:24:29,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.22ms. Allocated memory was 183.5MB in the beginning and 244.3MB in the end (delta: 60.8MB). Free memory was 154.2MB in the beginning and 200.6MB in the end (delta: -46.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-09-20 22:24:29,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.59ms. Allocated memory is still 244.3MB. Free memory was 200.6MB in the beginning and 198.2MB in the end (delta: 2.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-20 22:24:29,258 INFO L158 Benchmark]: Boogie Preprocessor took 44.15ms. Allocated memory is still 244.3MB. Free memory was 198.2MB in the beginning and 195.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-09-20 22:24:29,259 INFO L158 Benchmark]: RCFGBuilder took 966.92ms. Allocated memory is still 244.3MB. Free memory was 195.8MB in the beginning and 180.4MB in the end (delta: 15.3MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. [2022-09-20 22:24:29,259 INFO L158 Benchmark]: TraceAbstraction took 10239.43ms. Allocated memory was 244.3MB in the beginning and 608.2MB in the end (delta: 363.9MB). Free memory was 179.9MB in the beginning and 364.7MB in the end (delta: -184.8MB). Peak memory consumption was 179.1MB. Max. memory is 8.0GB. [2022-09-20 22:24:29,260 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.16ms. Allocated memory is still 183.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 616.22ms. Allocated memory was 183.5MB in the beginning and 244.3MB in the end (delta: 60.8MB). Free memory was 154.2MB in the beginning and 200.6MB in the end (delta: -46.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.59ms. Allocated memory is still 244.3MB. Free memory was 200.6MB in the beginning and 198.2MB in the end (delta: 2.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.15ms. Allocated memory is still 244.3MB. Free memory was 198.2MB in the beginning and 195.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 966.92ms. Allocated memory is still 244.3MB. Free memory was 195.8MB in the beginning and 180.4MB in the end (delta: 15.3MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10239.43ms. Allocated memory was 244.3MB in the beginning and 608.2MB in the end (delta: 363.9MB). Free memory was 179.9MB in the beginning and 364.7MB in the end (delta: -184.8MB). Peak memory consumption was 179.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L730] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L731] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L732] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L733] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L734] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L735] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L736] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L737] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L738] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L739] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L740] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L741] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L742] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L743] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L744] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L745] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L746] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t437; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=-3, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t438; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=-2, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t439; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=-1, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 0 pthread_t t440; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L777] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L778] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L779] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L780] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L781] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L781] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L782] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L836] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L871] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L871] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 865]: 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: 861]: 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 9 procedures, 172 locations, 7 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: 10.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 607 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 607 mSDsluCounter, 747 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1311 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1631 IncrementalHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 155 mSDtfsCounter, 1631 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=11, InterpolantAutomatonStates: 110, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1265 NumberOfCodeBlocks, 1265 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1147 ConstructedInterpolants, 0 QuantifiedInterpolants, 5458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-09-20 22:24:29,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...