/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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:32:53,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:32:53,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:32:53,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:32:53,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:32:53,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:32:53,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:32:53,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:32:53,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:32:53,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:32:53,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:32:53,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:32:53,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:32:53,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:32:53,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:32:53,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:32:53,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:32:53,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:32:53,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:32:53,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:32:53,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:32:53,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:32:53,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:32:53,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:32:53,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:32:53,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:32:53,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:32:53,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:32:53,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:32:53,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:32:53,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:32:53,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:32:53,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:32:53,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:32:53,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:32:53,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:32:53,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:32:53,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:32:53,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:32:53,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:32:53,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:32:53,273 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:32:53,302 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:32:53,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:32:53,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:32:53,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:32:53,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:32:53,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:32:53,304 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:32:53,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:32:53,304 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:32:53,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:32:53,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:32:53,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:32:53,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:32:53,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:32:53,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:32:53,305 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:32:53,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:32:53,305 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:32:53,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:32:53,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:32:53,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:32:53,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:32:53,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:32:53,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:32:53,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:32:53,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:32:53,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:32:53,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:32:53,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:32:53,306 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:32:53,306 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:32:53,307 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:32:53,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:32:53,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:32:53,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:32:53,516 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:32:53,518 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:32:53,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-09-20 22:32:53,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a40ebe9/2cf5ecdebb6f4c20af28948f2e58d800/FLAG76136bee2 [2022-09-20 22:32:53,954 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:32:53,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-09-20 22:32:53,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a40ebe9/2cf5ecdebb6f4c20af28948f2e58d800/FLAG76136bee2 [2022-09-20 22:32:53,981 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a40ebe9/2cf5ecdebb6f4c20af28948f2e58d800 [2022-09-20 22:32:53,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:32:53,989 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:32:53,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:32:53,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:32:53,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:32:53,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:32:53" (1/1) ... [2022-09-20 22:32:53,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c377486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:32:53, skipping insertion in model container [2022-09-20 22:32:53,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:32:53" (1/1) ... [2022-09-20 22:32:54,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:32:54,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:32:54,192 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-09-20 22:32:54,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:32:54,369 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:32:54,379 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-09-20 22:32:54,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:32:54,441 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:32:54,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:32:54 WrapperNode [2022-09-20 22:32:54,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:32:54,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:32:54,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:32:54,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:32:54,449 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:32:54" (1/1) ... [2022-09-20 22:32:54,460 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:32:54" (1/1) ... [2022-09-20 22:32:54,477 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-09-20 22:32:54,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:32:54,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:32:54,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:32:54,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:32:54,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:32:54" (1/1) ... [2022-09-20 22:32:54,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:32:54" (1/1) ... [2022-09-20 22:32:54,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:32:54" (1/1) ... [2022-09-20 22:32:54,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:32:54" (1/1) ... [2022-09-20 22:32:54,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:32:54" (1/1) ... [2022-09-20 22:32:54,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:32:54" (1/1) ... [2022-09-20 22:32:54,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:32:54" (1/1) ... [2022-09-20 22:32:54,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:32:54,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:32:54,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:32:54,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:32:54,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:32:54" (1/1) ... [2022-09-20 22:32:54,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:32:54,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:32:54,546 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:32:54,547 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:32:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:32:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 22:32:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:32:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:32:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:32:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 22:32:54,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 22:32:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 22:32:54,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 22:32:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 22:32:54,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 22:32:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:32:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 22:32:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:32:54,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:32:54,575 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:32:54,663 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:32:54,665 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:32:55,021 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:32:55,215 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:32:55,216 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 22:32:55,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:32:55 BoogieIcfgContainer [2022-09-20 22:32:55,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:32:55,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:32:55,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:32:55,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:32:55,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:32:53" (1/3) ... [2022-09-20 22:32:55,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65280c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:32:55, skipping insertion in model container [2022-09-20 22:32:55,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:32:54" (2/3) ... [2022-09-20 22:32:55,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65280c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:32:55, skipping insertion in model container [2022-09-20 22:32:55,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:32:55" (3/3) ... [2022-09-20 22:32:55,223 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-09-20 22:32:55,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:32:55,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 22:32:55,236 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:32:55,282 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 22:32:55,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-09-20 22:32:55,388 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-09-20 22:32:55,388 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:32:55,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-09-20 22:32:55,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-09-20 22:32:55,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-09-20 22:32:55,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:32:55,412 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;@79809aa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:32:55,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-09-20 22:32:55,427 INFO L130 PetriNetUnfolder]: 0/60 cut-off events. [2022-09-20 22:32:55,427 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:32:55,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:32:55,428 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] [2022-09-20 22:32:55,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:32:55,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:32:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 359614093, now seen corresponding path program 1 times [2022-09-20 22:32:55,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:32:55,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39484831] [2022-09-20 22:32:55,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:32:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:32:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:32:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:32:55,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:32:55,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39484831] [2022-09-20 22:32:55,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39484831] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:32:55,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:32:55,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:32:55,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885057890] [2022-09-20 22:32:55,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:32:55,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:32:55,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:32:55,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:32:55,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:32:55,696 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 115 [2022-09-20 22:32:55,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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:32:55,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:32:55,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 115 [2022-09-20 22:32:55,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:32:55,785 INFO L130 PetriNetUnfolder]: 37/223 cut-off events. [2022-09-20 22:32:55,785 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-09-20 22:32:55,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 223 events. 37/223 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 698 event pairs, 7 based on Foata normal form. 11/218 useless extension candidates. Maximal degree in co-relation 263. Up to 51 conditions per place. [2022-09-20 22:32:55,789 INFO L137 encePairwiseOnDemand]: 110/115 looper letters, 11 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-09-20 22:32:55,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 112 transitions, 262 flow [2022-09-20 22:32:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:32:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:32:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-09-20 22:32:55,802 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9391304347826087 [2022-09-20 22:32:55,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2022-09-20 22:32:55,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2022-09-20 22:32:55,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:32:55,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2022-09-20 22:32:55,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:32:55,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:32:55,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:32:55,818 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 324 transitions. [2022-09-20 22:32:55,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 112 transitions, 262 flow [2022-09-20 22:32:55,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 112 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-20 22:32:55,824 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2022-09-20 22:32:55,826 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2022-09-20 22:32:55,830 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-09-20 22:32:55,831 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2022-09-20 22:32:55,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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:32:55,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:32:55,832 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] [2022-09-20 22:32:55,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:32:55,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:32:55,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:32:55,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1192766711, now seen corresponding path program 1 times [2022-09-20 22:32:55,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:32:55,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506151138] [2022-09-20 22:32:55,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:32:55,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:32:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:32:56,048 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:32:56,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:32:56,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506151138] [2022-09-20 22:32:56,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506151138] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:32:56,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:32:56,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:32:56,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106429250] [2022-09-20 22:32:56,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:32:56,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:32:56,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:32:56,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:32:56,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:32:56,052 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-09-20 22:32:56,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 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:32:56,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:32:56,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-09-20 22:32:56,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:32:56,451 INFO L130 PetriNetUnfolder]: 487/1436 cut-off events. [2022-09-20 22:32:56,451 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-09-20 22:32:56,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2327 conditions, 1436 events. 487/1436 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10000 event pairs, 101 based on Foata normal form. 0/1392 useless extension candidates. Maximal degree in co-relation 2272. Up to 404 conditions per place. [2022-09-20 22:32:56,459 INFO L137 encePairwiseOnDemand]: 109/115 looper letters, 21 selfloop transitions, 2 changer transitions 48/148 dead transitions. [2022-09-20 22:32:56,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 148 transitions, 440 flow [2022-09-20 22:32:56,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:32:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:32:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2022-09-20 22:32:56,463 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.851207729468599 [2022-09-20 22:32:56,463 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2022-09-20 22:32:56,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2022-09-20 22:32:56,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:32:56,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2022-09-20 22:32:56,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 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:32:56,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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:32:56,468 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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:32:56,469 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 881 transitions. [2022-09-20 22:32:56,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 148 transitions, 440 flow [2022-09-20 22:32:56,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 148 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:32:56,472 INFO L231 Difference]: Finished difference. Result has 130 places, 96 transitions, 218 flow [2022-09-20 22:32:56,473 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2022-09-20 22:32:56,473 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-09-20 22:32:56,473 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 218 flow [2022-09-20 22:32:56,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 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:32:56,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:32:56,474 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] [2022-09-20 22:32:56,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:32:56,474 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:32:56,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:32:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1034789352, now seen corresponding path program 1 times [2022-09-20 22:32:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:32:56,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725390066] [2022-09-20 22:32:56,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:32:56,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:32:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:32:56,592 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:32:56,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:32:56,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725390066] [2022-09-20 22:32:56,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725390066] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:32:56,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:32:56,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:32:56,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414142883] [2022-09-20 22:32:56,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:32:56,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:32:56,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:32:56,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:32:56,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:32:56,597 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-09-20 22:32:56,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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:32:56,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:32:56,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-09-20 22:32:56,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:32:57,009 INFO L130 PetriNetUnfolder]: 518/1132 cut-off events. [2022-09-20 22:32:57,010 INFO L131 PetriNetUnfolder]: For 321/321 co-relation queries the response was YES. [2022-09-20 22:32:57,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2302 conditions, 1132 events. 518/1132 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6621 event pairs, 117 based on Foata normal form. 28/1122 useless extension candidates. Maximal degree in co-relation 2239. Up to 297 conditions per place. [2022-09-20 22:32:57,015 INFO L137 encePairwiseOnDemand]: 104/115 looper letters, 31 selfloop transitions, 10 changer transitions 62/178 dead transitions. [2022-09-20 22:32:57,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 178 transitions, 643 flow [2022-09-20 22:32:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-20 22:32:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-09-20 22:32:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1620 transitions. [2022-09-20 22:32:57,018 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8286445012787724 [2022-09-20 22:32:57,018 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1620 transitions. [2022-09-20 22:32:57,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1620 transitions. [2022-09-20 22:32:57,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:32:57,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1620 transitions. [2022-09-20 22:32:57,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 95.29411764705883) internal successors, (1620), 17 states have internal predecessors, (1620), 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:32:57,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 115.0) internal successors, (2070), 18 states have internal predecessors, (2070), 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:32:57,025 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 115.0) internal successors, (2070), 18 states have internal predecessors, (2070), 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:32:57,025 INFO L175 Difference]: Start difference. First operand has 130 places, 96 transitions, 218 flow. Second operand 17 states and 1620 transitions. [2022-09-20 22:32:57,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 178 transitions, 643 flow [2022-09-20 22:32:57,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 178 transitions, 581 flow, removed 28 selfloop flow, removed 8 redundant places. [2022-09-20 22:32:57,034 INFO L231 Difference]: Finished difference. Result has 135 places, 102 transitions, 311 flow [2022-09-20 22:32:57,034 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=311, PETRI_PLACES=135, PETRI_TRANSITIONS=102} [2022-09-20 22:32:57,035 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 15 predicate places. [2022-09-20 22:32:57,035 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 102 transitions, 311 flow [2022-09-20 22:32:57,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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:32:57,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:32:57,036 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] [2022-09-20 22:32:57,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:32:57,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:32:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:32:57,037 INFO L85 PathProgramCache]: Analyzing trace with hash -885081877, now seen corresponding path program 1 times [2022-09-20 22:32:57,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:32:57,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992093289] [2022-09-20 22:32:57,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:32:57,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:32:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:32:57,179 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:32:57,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:32:57,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992093289] [2022-09-20 22:32:57,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992093289] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:32:57,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:32:57,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:32:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335756477] [2022-09-20 22:32:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:32:57,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:32:57,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:32:57,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:32:57,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:32:57,182 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-09-20 22:32:57,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 102 transitions, 311 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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:32:57,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:32:57,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-09-20 22:32:57,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:32:57,484 INFO L130 PetriNetUnfolder]: 386/886 cut-off events. [2022-09-20 22:32:57,484 INFO L131 PetriNetUnfolder]: For 5086/5086 co-relation queries the response was YES. [2022-09-20 22:32:57,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 886 events. 386/886 cut-off events. For 5086/5086 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4906 event pairs, 86 based on Foata normal form. 20/860 useless extension candidates. Maximal degree in co-relation 3301. Up to 222 conditions per place. [2022-09-20 22:32:57,490 INFO L137 encePairwiseOnDemand]: 107/115 looper letters, 23 selfloop transitions, 4 changer transitions 45/147 dead transitions. [2022-09-20 22:32:57,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 147 transitions, 856 flow [2022-09-20 22:32:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:32:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:32:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 959 transitions. [2022-09-20 22:32:57,493 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8339130434782609 [2022-09-20 22:32:57,493 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 959 transitions. [2022-09-20 22:32:57,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 959 transitions. [2022-09-20 22:32:57,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:32:57,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 959 transitions. [2022-09-20 22:32:57,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.9) internal successors, (959), 10 states have internal predecessors, (959), 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:32:57,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:32:57,497 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:32:57,497 INFO L175 Difference]: Start difference. First operand has 135 places, 102 transitions, 311 flow. Second operand 10 states and 959 transitions. [2022-09-20 22:32:57,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 147 transitions, 856 flow [2022-09-20 22:32:57,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 147 transitions, 697 flow, removed 75 selfloop flow, removed 10 redundant places. [2022-09-20 22:32:57,504 INFO L231 Difference]: Finished difference. Result has 130 places, 96 transitions, 272 flow [2022-09-20 22:32:57,504 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=272, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2022-09-20 22:32:57,504 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-09-20 22:32:57,504 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 272 flow [2022-09-20 22:32:57,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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:32:57,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:32:57,505 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] [2022-09-20 22:32:57,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:32:57,505 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:32:57,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:32:57,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1416508078, now seen corresponding path program 1 times [2022-09-20 22:32:57,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:32:57,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457924736] [2022-09-20 22:32:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:32:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:32:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:32:57,611 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:32:57,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:32:57,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457924736] [2022-09-20 22:32:57,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457924736] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:32:57,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:32:57,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:32:57,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938456095] [2022-09-20 22:32:57,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:32:57,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:32:57,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:32:57,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:32:57,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:32:57,613 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-09-20 22:32:57,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 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:32:57,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:32:57,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-09-20 22:32:57,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:32:57,916 INFO L130 PetriNetUnfolder]: 722/1535 cut-off events. [2022-09-20 22:32:57,916 INFO L131 PetriNetUnfolder]: For 2774/2914 co-relation queries the response was YES. [2022-09-20 22:32:57,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 1535 events. 722/1535 cut-off events. For 2774/2914 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9468 event pairs, 67 based on Foata normal form. 0/1454 useless extension candidates. Maximal degree in co-relation 3854. Up to 400 conditions per place. [2022-09-20 22:32:57,923 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 28 selfloop transitions, 6 changer transitions 45/156 dead transitions. [2022-09-20 22:32:57,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 156 transitions, 624 flow [2022-09-20 22:32:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:32:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:32:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1001 transitions. [2022-09-20 22:32:57,926 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8704347826086957 [2022-09-20 22:32:57,926 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1001 transitions. [2022-09-20 22:32:57,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1001 transitions. [2022-09-20 22:32:57,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:32:57,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1001 transitions. [2022-09-20 22:32:57,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.1) internal successors, (1001), 10 states have internal predecessors, (1001), 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:32:57,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:32:57,930 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:32:57,930 INFO L175 Difference]: Start difference. First operand has 130 places, 96 transitions, 272 flow. Second operand 10 states and 1001 transitions. [2022-09-20 22:32:57,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 156 transitions, 624 flow [2022-09-20 22:32:57,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 156 transitions, 570 flow, removed 19 selfloop flow, removed 14 redundant places. [2022-09-20 22:32:57,934 INFO L231 Difference]: Finished difference. Result has 124 places, 98 transitions, 286 flow [2022-09-20 22:32:57,934 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=286, PETRI_PLACES=124, PETRI_TRANSITIONS=98} [2022-09-20 22:32:57,935 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2022-09-20 22:32:57,935 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 98 transitions, 286 flow [2022-09-20 22:32:57,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 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:32:57,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:32:57,935 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] [2022-09-20 22:32:57,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:32:57,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:32:57,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:32:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash -237491887, now seen corresponding path program 1 times [2022-09-20 22:32:57,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:32:57,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986150853] [2022-09-20 22:32:57,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:32:57,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:32:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:32:58,010 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:32:58,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:32:58,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986150853] [2022-09-20 22:32:58,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986150853] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:32:58,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:32:58,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:32:58,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958801721] [2022-09-20 22:32:58,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:32:58,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:32:58,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:32:58,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:32:58,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:32:58,012 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-09-20 22:32:58,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 98 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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:32:58,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:32:58,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-09-20 22:32:58,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:32:58,224 INFO L130 PetriNetUnfolder]: 248/685 cut-off events. [2022-09-20 22:32:58,224 INFO L131 PetriNetUnfolder]: For 1149/1175 co-relation queries the response was YES. [2022-09-20 22:32:58,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 685 events. 248/685 cut-off events. For 1149/1175 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3505 event pairs, 30 based on Foata normal form. 23/686 useless extension candidates. Maximal degree in co-relation 1941. Up to 157 conditions per place. [2022-09-20 22:32:58,227 INFO L137 encePairwiseOnDemand]: 106/115 looper letters, 31 selfloop transitions, 9 changer transitions 33/150 dead transitions. [2022-09-20 22:32:58,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 150 transitions, 725 flow [2022-09-20 22:32:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:32:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:32:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 995 transitions. [2022-09-20 22:32:58,230 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8652173913043478 [2022-09-20 22:32:58,230 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 995 transitions. [2022-09-20 22:32:58,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 995 transitions. [2022-09-20 22:32:58,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:32:58,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 995 transitions. [2022-09-20 22:32:58,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.5) internal successors, (995), 10 states have internal predecessors, (995), 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:32:58,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:32:58,235 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:32:58,235 INFO L175 Difference]: Start difference. First operand has 124 places, 98 transitions, 286 flow. Second operand 10 states and 995 transitions. [2022-09-20 22:32:58,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 150 transitions, 725 flow [2022-09-20 22:32:58,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 150 transitions, 701 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-09-20 22:32:58,238 INFO L231 Difference]: Finished difference. Result has 128 places, 101 transitions, 354 flow [2022-09-20 22:32:58,239 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=354, PETRI_PLACES=128, PETRI_TRANSITIONS=101} [2022-09-20 22:32:58,240 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 8 predicate places. [2022-09-20 22:32:58,240 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 101 transitions, 354 flow [2022-09-20 22:32:58,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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:32:58,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:32:58,241 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] [2022-09-20 22:32:58,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:32:58,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:32:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:32:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash 482610065, now seen corresponding path program 1 times [2022-09-20 22:32:58,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:32:58,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884091880] [2022-09-20 22:32:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:32:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:32:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:32:58,366 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:32:58,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:32:58,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884091880] [2022-09-20 22:32:58,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884091880] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:32:58,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:32:58,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:32:58,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859548238] [2022-09-20 22:32:58,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:32:58,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:32:58,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:32:58,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:32:58,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:32:58,368 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-09-20 22:32:58,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 101 transitions, 354 flow. Second operand has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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:32:58,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:32:58,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-09-20 22:32:58,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:32:58,542 INFO L130 PetriNetUnfolder]: 83/316 cut-off events. [2022-09-20 22:32:58,542 INFO L131 PetriNetUnfolder]: For 702/702 co-relation queries the response was YES. [2022-09-20 22:32:58,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 316 events. 83/316 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1204 event pairs, 19 based on Foata normal form. 8/312 useless extension candidates. Maximal degree in co-relation 917. Up to 62 conditions per place. [2022-09-20 22:32:58,544 INFO L137 encePairwiseOnDemand]: 106/115 looper letters, 22 selfloop transitions, 12 changer transitions 19/130 dead transitions. [2022-09-20 22:32:58,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 130 transitions, 656 flow [2022-09-20 22:32:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:32:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:32:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1067 transitions. [2022-09-20 22:32:58,547 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8434782608695652 [2022-09-20 22:32:58,547 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1067 transitions. [2022-09-20 22:32:58,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1067 transitions. [2022-09-20 22:32:58,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:32:58,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1067 transitions. [2022-09-20 22:32:58,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:32:58,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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:32:58,550 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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:32:58,550 INFO L175 Difference]: Start difference. First operand has 128 places, 101 transitions, 354 flow. Second operand 11 states and 1067 transitions. [2022-09-20 22:32:58,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 130 transitions, 656 flow [2022-09-20 22:32:58,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 130 transitions, 549 flow, removed 43 selfloop flow, removed 10 redundant places. [2022-09-20 22:32:58,554 INFO L231 Difference]: Finished difference. Result has 130 places, 101 transitions, 332 flow [2022-09-20 22:32:58,554 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=332, PETRI_PLACES=130, PETRI_TRANSITIONS=101} [2022-09-20 22:32:58,555 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-09-20 22:32:58,555 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 101 transitions, 332 flow [2022-09-20 22:32:58,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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:32:58,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:32:58,555 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] [2022-09-20 22:32:58,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 22:32:58,556 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:32:58,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:32:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash -794566015, now seen corresponding path program 1 times [2022-09-20 22:32:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:32:58,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359582835] [2022-09-20 22:32:58,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:32:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:32:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:32:58,660 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:32:58,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:32:58,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359582835] [2022-09-20 22:32:58,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359582835] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:32:58,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:32:58,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:32:58,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303160157] [2022-09-20 22:32:58,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:32:58,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:32:58,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:32:58,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:32:58,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:32:58,662 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-09-20 22:32:58,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 101 transitions, 332 flow. Second operand has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 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:32:58,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:32:58,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-09-20 22:32:58,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:32:58,770 INFO L130 PetriNetUnfolder]: 51/300 cut-off events. [2022-09-20 22:32:58,770 INFO L131 PetriNetUnfolder]: For 376/386 co-relation queries the response was YES. [2022-09-20 22:32:58,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 300 events. 51/300 cut-off events. For 376/386 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1121 event pairs, 14 based on Foata normal form. 1/286 useless extension candidates. Maximal degree in co-relation 665. Up to 52 conditions per place. [2022-09-20 22:32:58,772 INFO L137 encePairwiseOnDemand]: 109/115 looper letters, 19 selfloop transitions, 1 changer transitions 12/115 dead transitions. [2022-09-20 22:32:58,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 115 transitions, 444 flow [2022-09-20 22:32:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:32:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:32:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 677 transitions. [2022-09-20 22:32:58,774 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8409937888198757 [2022-09-20 22:32:58,774 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 677 transitions. [2022-09-20 22:32:58,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 677 transitions. [2022-09-20 22:32:58,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:32:58,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 677 transitions. [2022-09-20 22:32:58,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 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:32:58,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 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:32:58,778 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 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:32:58,778 INFO L175 Difference]: Start difference. First operand has 130 places, 101 transitions, 332 flow. Second operand 7 states and 677 transitions. [2022-09-20 22:32:58,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 115 transitions, 444 flow [2022-09-20 22:32:58,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 338 flow, removed 34 selfloop flow, removed 18 redundant places. [2022-09-20 22:32:58,781 INFO L231 Difference]: Finished difference. Result has 119 places, 101 transitions, 251 flow [2022-09-20 22:32:58,781 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=119, PETRI_TRANSITIONS=101} [2022-09-20 22:32:58,783 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, -1 predicate places. [2022-09-20 22:32:58,783 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 101 transitions, 251 flow [2022-09-20 22:32:58,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 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:32:58,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:32:58,784 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] [2022-09-20 22:32:58,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 22:32:58,784 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:32:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:32:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash 981490171, now seen corresponding path program 2 times [2022-09-20 22:32:58,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:32:58,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223907962] [2022-09-20 22:32:58,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:32:58,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:32:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:32:58,985 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:32:58,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:32:58,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223907962] [2022-09-20 22:32:58,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223907962] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:32:58,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:32:58,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:32:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113701616] [2022-09-20 22:32:58,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:32:58,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:32:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:32:58,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:32:58,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:32:58,987 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2022-09-20 22:32:58,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 101 transitions, 251 flow. Second operand has 11 states, 11 states have (on average 89.0909090909091) internal successors, (980), 11 states have internal predecessors, (980), 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:32:58,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:32:58,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2022-09-20 22:32:58,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:32:59,157 INFO L130 PetriNetUnfolder]: 28/247 cut-off events. [2022-09-20 22:32:59,157 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-09-20 22:32:59,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 247 events. 28/247 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 827 event pairs, 3 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 394. Up to 22 conditions per place. [2022-09-20 22:32:59,158 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 20 selfloop transitions, 5 changer transitions 10/113 dead transitions. [2022-09-20 22:32:59,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 113 transitions, 361 flow [2022-09-20 22:32:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:32:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:32:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 993 transitions. [2022-09-20 22:32:59,160 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7849802371541502 [2022-09-20 22:32:59,160 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 993 transitions. [2022-09-20 22:32:59,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 993 transitions. [2022-09-20 22:32:59,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:32:59,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 993 transitions. [2022-09-20 22:32:59,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.27272727272727) internal successors, (993), 11 states have internal predecessors, (993), 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:32:59,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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:32:59,164 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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:32:59,164 INFO L175 Difference]: Start difference. First operand has 119 places, 101 transitions, 251 flow. Second operand 11 states and 993 transitions. [2022-09-20 22:32:59,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 113 transitions, 361 flow [2022-09-20 22:32:59,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 113 transitions, 340 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-09-20 22:32:59,166 INFO L231 Difference]: Finished difference. Result has 125 places, 101 transitions, 262 flow [2022-09-20 22:32:59,166 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=262, PETRI_PLACES=125, PETRI_TRANSITIONS=101} [2022-09-20 22:32:59,167 INFO L287 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2022-09-20 22:32:59,171 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 101 transitions, 262 flow [2022-09-20 22:32:59,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.0909090909091) internal successors, (980), 11 states have internal predecessors, (980), 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:32:59,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:32:59,171 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] [2022-09-20 22:32:59,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:32:59,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:32:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:32:59,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1067622977, now seen corresponding path program 3 times [2022-09-20 22:32:59,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:32:59,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885629458] [2022-09-20 22:32:59,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:32:59,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:32:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:32:59,211 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 22:32:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:32:59,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 22:32:59,288 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 22:32:59,289 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-09-20 22:32:59,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-09-20 22:32:59,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-09-20 22:32:59,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-09-20 22:32:59,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-09-20 22:32:59,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-09-20 22:32:59,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 22:32:59,294 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:32:59,298 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 22:32:59,298 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 22:32:59,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 10:32:59 BasicIcfg [2022-09-20 22:32:59,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 22:32:59,382 INFO L158 Benchmark]: Toolchain (without parser) took 5393.19ms. Allocated memory was 185.6MB in the beginning and 316.7MB in the end (delta: 131.1MB). Free memory was 128.7MB in the beginning and 104.5MB in the end (delta: 24.1MB). Peak memory consumption was 155.3MB. Max. memory is 8.0GB. [2022-09-20 22:32:59,383 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory was 147.2MB in the beginning and 147.1MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 22:32:59,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.56ms. Allocated memory was 185.6MB in the beginning and 240.1MB in the end (delta: 54.5MB). Free memory was 128.5MB in the beginning and 201.6MB in the end (delta: -73.1MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-09-20 22:32:59,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.48ms. Allocated memory is still 240.1MB. Free memory was 201.6MB in the beginning and 199.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 22:32:59,383 INFO L158 Benchmark]: Boogie Preprocessor took 37.99ms. Allocated memory is still 240.1MB. Free memory was 199.1MB in the beginning and 197.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 22:32:59,384 INFO L158 Benchmark]: RCFGBuilder took 701.04ms. Allocated memory is still 240.1MB. Free memory was 197.0MB in the beginning and 128.4MB in the end (delta: 68.7MB). Peak memory consumption was 69.2MB. Max. memory is 8.0GB. [2022-09-20 22:32:59,384 INFO L158 Benchmark]: TraceAbstraction took 4163.12ms. Allocated memory was 240.1MB in the beginning and 316.7MB in the end (delta: 76.5MB). Free memory was 127.3MB in the beginning and 104.5MB in the end (delta: 22.8MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. [2022-09-20 22:32:59,385 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.12ms. Allocated memory is still 185.6MB. Free memory was 147.2MB in the beginning and 147.1MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 451.56ms. Allocated memory was 185.6MB in the beginning and 240.1MB in the end (delta: 54.5MB). Free memory was 128.5MB in the beginning and 201.6MB in the end (delta: -73.1MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.48ms. Allocated memory is still 240.1MB. Free memory was 201.6MB in the beginning and 199.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.99ms. Allocated memory is still 240.1MB. Free memory was 199.1MB in the beginning and 197.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 701.04ms. Allocated memory is still 240.1MB. Free memory was 197.0MB in the beginning and 128.4MB in the end (delta: 68.7MB). Peak memory consumption was 69.2MB. Max. memory is 8.0GB. * TraceAbstraction took 4163.12ms. Allocated memory was 240.1MB in the beginning and 316.7MB in the end (delta: 76.5MB). Free memory was 127.3MB in the beginning and 104.5MB in the end (delta: 22.8MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2345; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2345, ((void *)0), P0, ((void *)0))=-2, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2346; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2346, ((void *)0), P1, ((void *)0))=-1, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L837] 0 pthread_t t2347; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2347, ((void *)0), P2, ((void *)0))=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L844] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 834]: 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 7 procedures, 141 locations, 6 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: 4.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 468 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 468 mSDsluCounter, 409 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 769 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 982 IncrementalHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 81 mSDtfsCounter, 982 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=6, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 797 NumberOfCodeBlocks, 797 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 699 ConstructedInterpolants, 0 QuantifiedInterpolants, 2754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-09-20 22:32:59,415 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...