/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/mix028_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:26:21,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:26:21,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:26:21,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:26:21,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:26:21,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:26:21,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:26:21,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:26:21,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:26:21,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:26:21,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:26:21,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:26:21,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:26:21,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:26:21,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:26:21,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:26:21,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:26:21,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:26:21,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:26:21,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:26:21,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:26:21,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:26:21,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:26:21,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:26:21,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:26:21,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:26:21,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:26:21,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:26:21,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:26:21,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:26:21,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:26:21,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:26:21,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:26:21,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:26:21,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:26:21,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:26:21,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:26:21,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:26:21,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:26:21,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:26:21,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:26:21,179 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:26:21,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:26:21,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:26:21,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:26:21,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:26:21,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:26:21,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:26:21,206 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:26:21,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:26:21,207 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:26:21,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:26:21,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:26:21,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:26:21,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:26:21,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:26:21,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:26:21,207 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:26:21,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:26:21,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:26:21,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:26:21,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:26:21,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:26:21,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:26:21,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:26:21,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:26:21,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:26:21,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:26:21,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:26:21,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:26:21,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:26:21,209 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:26:21,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:26:21,209 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:26:21,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:26:21,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:26:21,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:26:21,380 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:26:21,380 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:26:21,381 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:26:21,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaab8119f/7260029b2d3f4dc59876960f9141abdf/FLAG2c1754ac4 [2022-09-20 22:26:21,860 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:26:21,860 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:26:21,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaab8119f/7260029b2d3f4dc59876960f9141abdf/FLAG2c1754ac4 [2022-09-20 22:26:22,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaab8119f/7260029b2d3f4dc59876960f9141abdf [2022-09-20 22:26:22,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:26:22,257 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:26:22,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:26:22,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:26:22,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:26:22,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:26:22" (1/1) ... [2022-09-20 22:26:22,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af14ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:26:22, skipping insertion in model container [2022-09-20 22:26:22,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:26:22" (1/1) ... [2022-09-20 22:26:22,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:26:22,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:26:22,433 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-09-20 22:26:22,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:26:22,574 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:26:22,583 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-09-20 22:26:22,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:26:22,640 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:26:22,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:26:22 WrapperNode [2022-09-20 22:26:22,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:26:22,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:26:22,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:26:22,642 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:26:22,646 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:26:22" (1/1) ... [2022-09-20 22:26:22,665 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:26:22" (1/1) ... [2022-09-20 22:26:22,689 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-09-20 22:26:22,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:26:22,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:26:22,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:26:22,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:26:22,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:26:22" (1/1) ... [2022-09-20 22:26:22,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:26:22" (1/1) ... [2022-09-20 22:26:22,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:26:22" (1/1) ... [2022-09-20 22:26:22,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:26:22" (1/1) ... [2022-09-20 22:26:22,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:26:22" (1/1) ... [2022-09-20 22:26:22,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:26:22" (1/1) ... [2022-09-20 22:26:22,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:26:22" (1/1) ... [2022-09-20 22:26:22,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:26:22,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:26:22,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:26:22,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:26:22,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:26:22" (1/1) ... [2022-09-20 22:26:22,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:26:22,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:26:22,766 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:26:22,767 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:26:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:26:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 22:26:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:26:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:26:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:26:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 22:26:22,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 22:26:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 22:26:22,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 22:26:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 22:26:22,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 22:26:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:26:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 22:26:22,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:26:22,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:26:22,802 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:26:22,898 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:26:22,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:26:23,249 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:26:23,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:26:23,488 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 22:26:23,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:26:23 BoogieIcfgContainer [2022-09-20 22:26:23,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:26:23,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:26:23,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:26:23,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:26:23,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:26:22" (1/3) ... [2022-09-20 22:26:23,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c472244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:26:23, skipping insertion in model container [2022-09-20 22:26:23,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:26:22" (2/3) ... [2022-09-20 22:26:23,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c472244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:26:23, skipping insertion in model container [2022-09-20 22:26:23,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:26:23" (3/3) ... [2022-09-20 22:26:23,499 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:26:23,511 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:26:23,511 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 22:26:23,511 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:26:23,558 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 22:26:23,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-09-20 22:26:23,631 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-09-20 22:26:23,631 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:26:23,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-09-20 22:26:23,635 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2022-09-20 22:26:23,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2022-09-20 22:26:23,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:26:23,654 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;@9be1cea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:26:23,655 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-09-20 22:26:23,663 INFO L130 PetriNetUnfolder]: 0/45 cut-off events. [2022-09-20 22:26:23,664 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:26:23,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:23,665 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] [2022-09-20 22:26:23,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:23,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1707045004, now seen corresponding path program 1 times [2022-09-20 22:26:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:23,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742063475] [2022-09-20 22:26:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:26:23,884 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:26:23,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:26:23,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742063475] [2022-09-20 22:26:23,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742063475] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:26:23,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:26:23,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:26:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773843462] [2022-09-20 22:26:23,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:26:23,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:26:23,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:26:23,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:26:23,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:26:23,911 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 116 [2022-09-20 22:26:23,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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:26:23,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:26:23,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 116 [2022-09-20 22:26:23,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:26:24,023 INFO L130 PetriNetUnfolder]: 58/277 cut-off events. [2022-09-20 22:26:24,023 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-09-20 22:26:24,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 277 events. 58/277 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1117 event pairs, 10 based on Foata normal form. 20/279 useless extension candidates. Maximal degree in co-relation 354. Up to 79 conditions per place. [2022-09-20 22:26:24,026 INFO L137 encePairwiseOnDemand]: 111/116 looper letters, 14 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2022-09-20 22:26:24,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 115 transitions, 277 flow [2022-09-20 22:26:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:26:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:26:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-09-20 22:26:24,041 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9396551724137931 [2022-09-20 22:26:24,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2022-09-20 22:26:24,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2022-09-20 22:26:24,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:26:24,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2022-09-20 22:26:24,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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:26:24,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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:26:24,056 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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:26:24,058 INFO L175 Difference]: Start difference. First operand has 121 places, 113 transitions, 235 flow. Second operand 3 states and 327 transitions. [2022-09-20 22:26:24,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 115 transitions, 277 flow [2022-09-20 22:26:24,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 115 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-20 22:26:24,068 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 228 flow [2022-09-20 22:26:24,070 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2022-09-20 22:26:24,075 INFO L287 CegarLoopForPetriNet]: 121 programPoint places, -3 predicate places. [2022-09-20 22:26:24,075 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 228 flow [2022-09-20 22:26:24,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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:26:24,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:24,076 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] [2022-09-20 22:26:24,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:26:24,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:24,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash -499311708, now seen corresponding path program 1 times [2022-09-20 22:26:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:24,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487219245] [2022-09-20 22:26:24,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:24,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:26:24,294 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:26:24,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:26:24,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487219245] [2022-09-20 22:26:24,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487219245] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:26:24,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:26:24,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:26:24,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609835220] [2022-09-20 22:26:24,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:26:24,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:26:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:26:24,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:26:24,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:26:24,298 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-09-20 22:26:24,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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:26:24,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:26:24,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-09-20 22:26:24,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:26:25,512 INFO L130 PetriNetUnfolder]: 3466/8463 cut-off events. [2022-09-20 22:26:25,515 INFO L131 PetriNetUnfolder]: For 363/363 co-relation queries the response was YES. [2022-09-20 22:26:25,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14035 conditions, 8463 events. 3466/8463 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 78980 event pairs, 687 based on Foata normal form. 0/8202 useless extension candidates. Maximal degree in co-relation 13980. Up to 1785 conditions per place. [2022-09-20 22:26:25,554 INFO L137 encePairwiseOnDemand]: 103/116 looper letters, 31 selfloop transitions, 9 changer transitions 82/195 dead transitions. [2022-09-20 22:26:25,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 195 transitions, 638 flow [2022-09-20 22:26:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:26:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:26:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions. [2022-09-20 22:26:25,557 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8582375478927203 [2022-09-20 22:26:25,557 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 896 transitions. [2022-09-20 22:26:25,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions. [2022-09-20 22:26:25,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:26:25,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions. [2022-09-20 22:26:25,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.55555555555556) internal successors, (896), 9 states have internal predecessors, (896), 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:26:25,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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:26:25,563 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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:26:25,563 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 228 flow. Second operand 9 states and 896 transitions. [2022-09-20 22:26:25,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 195 transitions, 638 flow [2022-09-20 22:26:25,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 195 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:26:25,567 INFO L231 Difference]: Finished difference. Result has 132 places, 103 transitions, 310 flow [2022-09-20 22:26:25,568 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=310, PETRI_PLACES=132, PETRI_TRANSITIONS=103} [2022-09-20 22:26:25,568 INFO L287 CegarLoopForPetriNet]: 121 programPoint places, 11 predicate places. [2022-09-20 22:26:25,568 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 103 transitions, 310 flow [2022-09-20 22:26:25,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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:26:25,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:25,569 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] [2022-09-20 22:26:25,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:26:25,569 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:25,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1480478789, now seen corresponding path program 1 times [2022-09-20 22:26:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:25,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448486471] [2022-09-20 22:26:25,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:26:25,723 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:26:25,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:26:25,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448486471] [2022-09-20 22:26:25,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448486471] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:26:25,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:26:25,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:26:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248502926] [2022-09-20 22:26:25,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:26:25,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:26:25,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:26:25,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:26:25,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:26:25,728 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-09-20 22:26:25,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 103 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 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:26:25,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:26:25,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-09-20 22:26:25,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:26:26,566 INFO L130 PetriNetUnfolder]: 2329/4585 cut-off events. [2022-09-20 22:26:26,567 INFO L131 PetriNetUnfolder]: For 6993/6993 co-relation queries the response was YES. [2022-09-20 22:26:26,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13241 conditions, 4585 events. 2329/4585 cut-off events. For 6993/6993 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 33710 event pairs, 317 based on Foata normal form. 126/4599 useless extension candidates. Maximal degree in co-relation 13174. Up to 1031 conditions per place. [2022-09-20 22:26:26,593 INFO L137 encePairwiseOnDemand]: 106/116 looper letters, 42 selfloop transitions, 7 changer transitions 97/219 dead transitions. [2022-09-20 22:26:26,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 219 transitions, 1232 flow [2022-09-20 22:26:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:26:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:26:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1260 transitions. [2022-09-20 22:26:26,596 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8355437665782494 [2022-09-20 22:26:26,596 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1260 transitions. [2022-09-20 22:26:26,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1260 transitions. [2022-09-20 22:26:26,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:26:26,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1260 transitions. [2022-09-20 22:26:26,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.92307692307692) internal successors, (1260), 13 states have internal predecessors, (1260), 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:26:26,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:26:26,602 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:26:26,603 INFO L175 Difference]: Start difference. First operand has 132 places, 103 transitions, 310 flow. Second operand 13 states and 1260 transitions. [2022-09-20 22:26:26,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 219 transitions, 1232 flow [2022-09-20 22:26:26,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 219 transitions, 1146 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-09-20 22:26:26,617 INFO L231 Difference]: Finished difference. Result has 136 places, 106 transitions, 374 flow [2022-09-20 22:26:26,617 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=374, PETRI_PLACES=136, PETRI_TRANSITIONS=106} [2022-09-20 22:26:26,619 INFO L287 CegarLoopForPetriNet]: 121 programPoint places, 15 predicate places. [2022-09-20 22:26:26,619 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 106 transitions, 374 flow [2022-09-20 22:26:26,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 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:26:26,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:26,620 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:26:26,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:26:26,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:26,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash 141854691, now seen corresponding path program 1 times [2022-09-20 22:26:26,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:26,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938068655] [2022-09-20 22:26:26,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:26:26,752 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:26:26,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:26:26,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938068655] [2022-09-20 22:26:26,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938068655] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:26:26,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:26:26,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:26:26,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149588866] [2022-09-20 22:26:26,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:26:26,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:26:26,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:26:26,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:26:26,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:26:26,754 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-09-20 22:26:26,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 106 transitions, 374 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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:26:26,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:26:26,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-09-20 22:26:26,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:26:27,474 INFO L130 PetriNetUnfolder]: 1728/3342 cut-off events. [2022-09-20 22:26:27,475 INFO L131 PetriNetUnfolder]: For 10396/10396 co-relation queries the response was YES. [2022-09-20 22:26:27,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11285 conditions, 3342 events. 1728/3342 cut-off events. For 10396/10396 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22669 event pairs, 277 based on Foata normal form. 74/3307 useless extension candidates. Maximal degree in co-relation 11208. Up to 980 conditions per place. [2022-09-20 22:26:27,504 INFO L137 encePairwiseOnDemand]: 103/116 looper letters, 39 selfloop transitions, 17 changer transitions 73/202 dead transitions. [2022-09-20 22:26:27,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 202 transitions, 1222 flow [2022-09-20 22:26:27,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:26:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:26:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1257 transitions. [2022-09-20 22:26:27,507 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.833554376657825 [2022-09-20 22:26:27,507 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1257 transitions. [2022-09-20 22:26:27,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1257 transitions. [2022-09-20 22:26:27,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:26:27,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1257 transitions. [2022-09-20 22:26:27,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.6923076923077) internal successors, (1257), 13 states have internal predecessors, (1257), 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:26:27,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:26:27,512 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:26:27,512 INFO L175 Difference]: Start difference. First operand has 136 places, 106 transitions, 374 flow. Second operand 13 states and 1257 transitions. [2022-09-20 22:26:27,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 202 transitions, 1222 flow [2022-09-20 22:26:27,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 202 transitions, 1142 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-09-20 22:26:27,566 INFO L231 Difference]: Finished difference. Result has 146 places, 112 transitions, 491 flow [2022-09-20 22:26:27,566 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=491, PETRI_PLACES=146, PETRI_TRANSITIONS=112} [2022-09-20 22:26:27,567 INFO L287 CegarLoopForPetriNet]: 121 programPoint places, 25 predicate places. [2022-09-20 22:26:27,568 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 112 transitions, 491 flow [2022-09-20 22:26:27,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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:26:27,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:27,571 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] [2022-09-20 22:26:27,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:26:27,572 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash -601261670, now seen corresponding path program 1 times [2022-09-20 22:26:27,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:27,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771386292] [2022-09-20 22:26:27,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:26:27,701 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:26:27,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:26:27,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771386292] [2022-09-20 22:26:27,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771386292] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:26:27,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:26:27,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:26:27,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189975672] [2022-09-20 22:26:27,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:26:27,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:26:27,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:26:27,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:26:27,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:26:27,703 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116 [2022-09-20 22:26:27,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 112 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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:26:27,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:26:27,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116 [2022-09-20 22:26:27,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:26:28,469 INFO L130 PetriNetUnfolder]: 2758/5760 cut-off events. [2022-09-20 22:26:28,469 INFO L131 PetriNetUnfolder]: For 7264/8338 co-relation queries the response was YES. [2022-09-20 22:26:28,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13898 conditions, 5760 events. 2758/5760 cut-off events. For 7264/8338 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 47494 event pairs, 168 based on Foata normal form. 35/5515 useless extension candidates. Maximal degree in co-relation 13812. Up to 1472 conditions per place. [2022-09-20 22:26:28,506 INFO L137 encePairwiseOnDemand]: 106/116 looper letters, 78 selfloop transitions, 17 changer transitions 0/186 dead transitions. [2022-09-20 22:26:28,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 186 transitions, 952 flow [2022-09-20 22:26:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:26:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:26:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1009 transitions. [2022-09-20 22:26:28,509 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8698275862068966 [2022-09-20 22:26:28,509 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1009 transitions. [2022-09-20 22:26:28,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1009 transitions. [2022-09-20 22:26:28,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:26:28,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1009 transitions. [2022-09-20 22:26:28,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 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:26:28,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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:26:28,513 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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:26:28,513 INFO L175 Difference]: Start difference. First operand has 146 places, 112 transitions, 491 flow. Second operand 10 states and 1009 transitions. [2022-09-20 22:26:28,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 186 transitions, 952 flow [2022-09-20 22:26:28,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 186 transitions, 890 flow, removed 31 selfloop flow, removed 15 redundant places. [2022-09-20 22:26:28,522 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 549 flow [2022-09-20 22:26:28,522 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=549, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2022-09-20 22:26:28,522 INFO L287 CegarLoopForPetriNet]: 121 programPoint places, 16 predicate places. [2022-09-20 22:26:28,523 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 549 flow [2022-09-20 22:26:28,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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:26:28,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:28,523 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:26:28,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:26:28,523 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:28,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash -162599280, now seen corresponding path program 1 times [2022-09-20 22:26:28,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:28,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120771204] [2022-09-20 22:26:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:28,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:26:28,632 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:26:28,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:26:28,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120771204] [2022-09-20 22:26:28,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120771204] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:26:28,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:26:28,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:26:28,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82514799] [2022-09-20 22:26:28,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:26:28,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:26:28,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:26:28,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:26:28,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:26:28,634 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-09-20 22:26:28,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 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:26:28,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:26:28,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-09-20 22:26:28,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:26:29,349 INFO L130 PetriNetUnfolder]: 1393/4406 cut-off events. [2022-09-20 22:26:29,350 INFO L131 PetriNetUnfolder]: For 7004/7341 co-relation queries the response was YES. [2022-09-20 22:26:29,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12311 conditions, 4406 events. 1393/4406 cut-off events. For 7004/7341 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 44012 event pairs, 247 based on Foata normal form. 114/4283 useless extension candidates. Maximal degree in co-relation 12228. Up to 623 conditions per place. [2022-09-20 22:26:29,382 INFO L137 encePairwiseOnDemand]: 103/116 looper letters, 68 selfloop transitions, 32 changer transitions 24/212 dead transitions. [2022-09-20 22:26:29,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 212 transitions, 1270 flow [2022-09-20 22:26:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:26:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:26:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1243 transitions. [2022-09-20 22:26:29,385 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8242705570291777 [2022-09-20 22:26:29,385 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1243 transitions. [2022-09-20 22:26:29,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1243 transitions. [2022-09-20 22:26:29,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:26:29,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1243 transitions. [2022-09-20 22:26:29,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.61538461538461) internal successors, (1243), 13 states have internal predecessors, (1243), 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:26:29,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:26:29,390 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:26:29,390 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 549 flow. Second operand 13 states and 1243 transitions. [2022-09-20 22:26:29,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 212 transitions, 1270 flow [2022-09-20 22:26:29,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 212 transitions, 1268 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:26:29,415 INFO L231 Difference]: Finished difference. Result has 160 places, 145 transitions, 878 flow [2022-09-20 22:26:29,415 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=878, PETRI_PLACES=160, PETRI_TRANSITIONS=145} [2022-09-20 22:26:29,415 INFO L287 CegarLoopForPetriNet]: 121 programPoint places, 39 predicate places. [2022-09-20 22:26:29,416 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 145 transitions, 878 flow [2022-09-20 22:26:29,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 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:26:29,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:29,416 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:26:29,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:26:29,416 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:29,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:29,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1407318598, now seen corresponding path program 1 times [2022-09-20 22:26:29,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:29,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617151095] [2022-09-20 22:26:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:26:29,484 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:26:29,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:26:29,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617151095] [2022-09-20 22:26:29,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617151095] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:26:29,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:26:29,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:26:29,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054529628] [2022-09-20 22:26:29,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:26:29,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:26:29,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:26:29,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:26:29,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:26:29,488 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 116 [2022-09-20 22:26:29,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 145 transitions, 878 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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:26:29,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:26:29,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 116 [2022-09-20 22:26:29,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:26:30,597 INFO L130 PetriNetUnfolder]: 2155/7344 cut-off events. [2022-09-20 22:26:30,598 INFO L131 PetriNetUnfolder]: For 18307/18921 co-relation queries the response was YES. [2022-09-20 22:26:30,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21281 conditions, 7344 events. 2155/7344 cut-off events. For 18307/18921 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 84517 event pairs, 633 based on Foata normal form. 174/7076 useless extension candidates. Maximal degree in co-relation 21183. Up to 1114 conditions per place. [2022-09-20 22:26:30,664 INFO L137 encePairwiseOnDemand]: 109/116 looper letters, 60 selfloop transitions, 16 changer transitions 31/211 dead transitions. [2022-09-20 22:26:30,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 211 transitions, 1514 flow [2022-09-20 22:26:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:26:30,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:26:30,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 986 transitions. [2022-09-20 22:26:30,666 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.85 [2022-09-20 22:26:30,667 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 986 transitions. [2022-09-20 22:26:30,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 986 transitions. [2022-09-20 22:26:30,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:26:30,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 986 transitions. [2022-09-20 22:26:30,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.6) internal successors, (986), 10 states have internal predecessors, (986), 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:26:30,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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:26:30,670 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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:26:30,670 INFO L175 Difference]: Start difference. First operand has 160 places, 145 transitions, 878 flow. Second operand 10 states and 986 transitions. [2022-09-20 22:26:30,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 211 transitions, 1514 flow [2022-09-20 22:26:30,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 211 transitions, 1468 flow, removed 23 selfloop flow, removed 0 redundant places. [2022-09-20 22:26:30,743 INFO L231 Difference]: Finished difference. Result has 177 places, 151 transitions, 991 flow [2022-09-20 22:26:30,743 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=991, PETRI_PLACES=177, PETRI_TRANSITIONS=151} [2022-09-20 22:26:30,743 INFO L287 CegarLoopForPetriNet]: 121 programPoint places, 56 predicate places. [2022-09-20 22:26:30,744 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 151 transitions, 991 flow [2022-09-20 22:26:30,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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:26:30,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:30,744 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:26:30,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 22:26:30,744 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:30,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1752420248, now seen corresponding path program 2 times [2022-09-20 22:26:30,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:30,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787601095] [2022-09-20 22:26:30,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:26:30,809 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:26:30,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:26:30,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787601095] [2022-09-20 22:26:30,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787601095] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:26:30,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:26:30,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:26:30,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562220650] [2022-09-20 22:26:30,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:26:30,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:26:30,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:26:30,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:26:30,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:26:30,811 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116 [2022-09-20 22:26:30,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 151 transitions, 991 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 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:26:30,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:26:30,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116 [2022-09-20 22:26:30,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:26:33,092 INFO L130 PetriNetUnfolder]: 7514/15502 cut-off events. [2022-09-20 22:26:33,092 INFO L131 PetriNetUnfolder]: For 36268/38809 co-relation queries the response was YES. [2022-09-20 22:26:33,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48584 conditions, 15502 events. 7514/15502 cut-off events. For 36268/38809 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 153170 event pairs, 441 based on Foata normal form. 375/15560 useless extension candidates. Maximal degree in co-relation 48478. Up to 2815 conditions per place. [2022-09-20 22:26:33,181 INFO L137 encePairwiseOnDemand]: 106/116 looper letters, 67 selfloop transitions, 28 changer transitions 69/259 dead transitions. [2022-09-20 22:26:33,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 259 transitions, 2037 flow [2022-09-20 22:26:33,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:26:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:26:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1315 transitions. [2022-09-20 22:26:33,184 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8720159151193634 [2022-09-20 22:26:33,184 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1315 transitions. [2022-09-20 22:26:33,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1315 transitions. [2022-09-20 22:26:33,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:26:33,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1315 transitions. [2022-09-20 22:26:33,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 101.15384615384616) internal successors, (1315), 13 states have internal predecessors, (1315), 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:26:33,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:26:33,190 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:26:33,190 INFO L175 Difference]: Start difference. First operand has 177 places, 151 transitions, 991 flow. Second operand 13 states and 1315 transitions. [2022-09-20 22:26:33,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 259 transitions, 2037 flow [2022-09-20 22:26:33,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 259 transitions, 1979 flow, removed 29 selfloop flow, removed 0 redundant places. [2022-09-20 22:26:33,319 INFO L231 Difference]: Finished difference. Result has 195 places, 146 transitions, 931 flow [2022-09-20 22:26:33,320 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=931, PETRI_PLACES=195, PETRI_TRANSITIONS=146} [2022-09-20 22:26:33,322 INFO L287 CegarLoopForPetriNet]: 121 programPoint places, 74 predicate places. [2022-09-20 22:26:33,322 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 146 transitions, 931 flow [2022-09-20 22:26:33,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 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:26:33,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:33,322 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:26:33,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 22:26:33,323 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1076632256, now seen corresponding path program 1 times [2022-09-20 22:26:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:33,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986794069] [2022-09-20 22:26:33,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:33,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:26:33,452 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:26:33,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:26:33,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986794069] [2022-09-20 22:26:33,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986794069] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:26:33,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:26:33,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:26:33,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569430792] [2022-09-20 22:26:33,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:26:33,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:26:33,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:26:33,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:26:33,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:26:33,454 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116 [2022-09-20 22:26:33,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 146 transitions, 931 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:26:33,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:26:33,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116 [2022-09-20 22:26:33,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:26:35,436 INFO L130 PetriNetUnfolder]: 5701/12547 cut-off events. [2022-09-20 22:26:35,437 INFO L131 PetriNetUnfolder]: For 40197/42283 co-relation queries the response was YES. [2022-09-20 22:26:35,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44299 conditions, 12547 events. 5701/12547 cut-off events. For 40197/42283 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 129704 event pairs, 385 based on Foata normal form. 188/12432 useless extension candidates. Maximal degree in co-relation 44243. Up to 1924 conditions per place. [2022-09-20 22:26:35,537 INFO L137 encePairwiseOnDemand]: 106/116 looper letters, 28 selfloop transitions, 14 changer transitions 90/223 dead transitions. [2022-09-20 22:26:35,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 223 transitions, 1677 flow [2022-09-20 22:26:35,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:26:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:26:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1576 transitions. [2022-09-20 22:26:35,540 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8491379310344828 [2022-09-20 22:26:35,541 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1576 transitions. [2022-09-20 22:26:35,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1576 transitions. [2022-09-20 22:26:35,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:26:35,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1576 transitions. [2022-09-20 22:26:35,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 98.5) internal successors, (1576), 16 states have internal predecessors, (1576), 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:26:35,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 116.0) internal successors, (1972), 17 states have internal predecessors, (1972), 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:26:35,547 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 116.0) internal successors, (1972), 17 states have internal predecessors, (1972), 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:26:35,547 INFO L175 Difference]: Start difference. First operand has 195 places, 146 transitions, 931 flow. Second operand 16 states and 1576 transitions. [2022-09-20 22:26:35,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 223 transitions, 1677 flow [2022-09-20 22:26:36,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 223 transitions, 1498 flow, removed 80 selfloop flow, removed 24 redundant places. [2022-09-20 22:26:36,242 INFO L231 Difference]: Finished difference. Result has 177 places, 121 transitions, 647 flow [2022-09-20 22:26:36,242 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=647, PETRI_PLACES=177, PETRI_TRANSITIONS=121} [2022-09-20 22:26:36,242 INFO L287 CegarLoopForPetriNet]: 121 programPoint places, 56 predicate places. [2022-09-20 22:26:36,242 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 121 transitions, 647 flow [2022-09-20 22:26:36,243 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:26:36,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:36,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:26:36,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:26:36,243 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:36,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:36,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1507932727, now seen corresponding path program 1 times [2022-09-20 22:26:36,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:36,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751413358] [2022-09-20 22:26:36,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:36,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:26:36,510 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:26:36,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:26:36,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751413358] [2022-09-20 22:26:36,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751413358] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:26:36,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:26:36,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 22:26:36,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816816275] [2022-09-20 22:26:36,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:26:36,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:26:36,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:26:36,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:26:36,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:26:36,516 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2022-09-20 22:26:36,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 121 transitions, 647 flow. Second operand has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 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:26:36,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:26:36,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2022-09-20 22:26:36,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:26:36,878 INFO L130 PetriNetUnfolder]: 379/2704 cut-off events. [2022-09-20 22:26:36,878 INFO L131 PetriNetUnfolder]: For 7160/7460 co-relation queries the response was YES. [2022-09-20 22:26:36,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7943 conditions, 2704 events. 379/2704 cut-off events. For 7160/7460 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 33039 event pairs, 17 based on Foata normal form. 6/2532 useless extension candidates. Maximal degree in co-relation 7835. Up to 550 conditions per place. [2022-09-20 22:26:36,894 INFO L137 encePairwiseOnDemand]: 106/116 looper letters, 26 selfloop transitions, 5 changer transitions 22/142 dead transitions. [2022-09-20 22:26:36,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 142 transitions, 805 flow [2022-09-20 22:26:36,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:26:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:26:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 934 transitions. [2022-09-20 22:26:36,897 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8051724137931034 [2022-09-20 22:26:36,897 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 934 transitions. [2022-09-20 22:26:36,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 934 transitions. [2022-09-20 22:26:36,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:26:36,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 934 transitions. [2022-09-20 22:26:36,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.4) internal successors, (934), 10 states have internal predecessors, (934), 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:26:36,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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:26:36,900 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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:26:36,900 INFO L175 Difference]: Start difference. First operand has 177 places, 121 transitions, 647 flow. Second operand 10 states and 934 transitions. [2022-09-20 22:26:36,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 142 transitions, 805 flow [2022-09-20 22:26:36,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 142 transitions, 664 flow, removed 39 selfloop flow, removed 24 redundant places. [2022-09-20 22:26:36,945 INFO L231 Difference]: Finished difference. Result has 155 places, 113 transitions, 435 flow [2022-09-20 22:26:36,946 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=435, PETRI_PLACES=155, PETRI_TRANSITIONS=113} [2022-09-20 22:26:36,946 INFO L287 CegarLoopForPetriNet]: 121 programPoint places, 34 predicate places. [2022-09-20 22:26:36,946 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 113 transitions, 435 flow [2022-09-20 22:26:36,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 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:26:36,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:36,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:26:36,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 22:26:36,947 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2028482871, now seen corresponding path program 2 times [2022-09-20 22:26:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:36,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294651920] [2022-09-20 22:26:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:36,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:26:37,122 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:26:37,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:26:37,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294651920] [2022-09-20 22:26:37,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294651920] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:26:37,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:26:37,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:26:37,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784623573] [2022-09-20 22:26:37,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:26:37,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:26:37,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:26:37,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:26:37,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:26:37,124 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2022-09-20 22:26:37,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 113 transitions, 435 flow. Second operand has 11 states, 11 states have (on average 91.0) internal successors, (1001), 11 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:26:37,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:26:37,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2022-09-20 22:26:37,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:26:37,355 INFO L130 PetriNetUnfolder]: 83/696 cut-off events. [2022-09-20 22:26:37,355 INFO L131 PetriNetUnfolder]: For 420/475 co-relation queries the response was YES. [2022-09-20 22:26:37,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 696 events. 83/696 cut-off events. For 420/475 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5308 event pairs, 3 based on Foata normal form. 7/650 useless extension candidates. Maximal degree in co-relation 1430. Up to 92 conditions per place. [2022-09-20 22:26:37,359 INFO L137 encePairwiseOnDemand]: 105/116 looper letters, 24 selfloop transitions, 5 changer transitions 17/132 dead transitions. [2022-09-20 22:26:37,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 132 transitions, 607 flow [2022-09-20 22:26:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:26:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:26:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 932 transitions. [2022-09-20 22:26:37,360 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.803448275862069 [2022-09-20 22:26:37,360 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 932 transitions. [2022-09-20 22:26:37,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 932 transitions. [2022-09-20 22:26:37,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:26:37,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 932 transitions. [2022-09-20 22:26:37,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.2) internal successors, (932), 10 states have internal predecessors, (932), 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:26:37,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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:26:37,363 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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:26:37,363 INFO L175 Difference]: Start difference. First operand has 155 places, 113 transitions, 435 flow. Second operand 10 states and 932 transitions. [2022-09-20 22:26:37,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 132 transitions, 607 flow [2022-09-20 22:26:37,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 132 transitions, 506 flow, removed 22 selfloop flow, removed 17 redundant places. [2022-09-20 22:26:37,367 INFO L231 Difference]: Finished difference. Result has 146 places, 112 transitions, 379 flow [2022-09-20 22:26:37,367 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=379, PETRI_PLACES=146, PETRI_TRANSITIONS=112} [2022-09-20 22:26:37,368 INFO L287 CegarLoopForPetriNet]: 121 programPoint places, 25 predicate places. [2022-09-20 22:26:37,368 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 112 transitions, 379 flow [2022-09-20 22:26:37,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 91.0) internal successors, (1001), 11 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:26:37,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:26:37,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:26:37,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:26:37,368 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:26:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:26:37,369 INFO L85 PathProgramCache]: Analyzing trace with hash 219242067, now seen corresponding path program 3 times [2022-09-20 22:26:37,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:26:37,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844195939] [2022-09-20 22:26:37,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:26:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:26:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:26:37,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 22:26:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:26:37,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 22:26:37,461 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 22:26:37,462 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-09-20 22:26:37,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-09-20 22:26:37,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-09-20 22:26:37,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-09-20 22:26:37,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-09-20 22:26:37,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-09-20 22:26:37,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 22:26:37,464 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:26:37,467 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 22:26:37,468 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 22:26:37,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 10:26:37 BasicIcfg [2022-09-20 22:26:37,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 22:26:37,565 INFO L158 Benchmark]: Toolchain (without parser) took 15307.42ms. Allocated memory was 189.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 160.4MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 771.5MB. Max. memory is 8.0GB. [2022-09-20 22:26:37,565 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory was 144.2MB in the beginning and 144.1MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 22:26:37,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.05ms. Allocated memory was 189.8MB in the beginning and 243.3MB in the end (delta: 53.5MB). Free memory was 160.2MB in the beginning and 198.2MB in the end (delta: -38.1MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. [2022-09-20 22:26:37,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.41ms. Allocated memory is still 243.3MB. Free memory was 198.2MB in the beginning and 195.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 22:26:37,566 INFO L158 Benchmark]: Boogie Preprocessor took 25.52ms. Allocated memory is still 243.3MB. Free memory was 195.6MB in the beginning and 193.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 22:26:37,566 INFO L158 Benchmark]: RCFGBuilder took 775.02ms. Allocated memory is still 243.3MB. Free memory was 193.5MB in the beginning and 184.7MB in the end (delta: 8.8MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. [2022-09-20 22:26:37,566 INFO L158 Benchmark]: TraceAbstraction took 14070.75ms. Allocated memory was 243.3MB in the beginning and 2.7GB in the end (delta: 2.4GB). Free memory was 184.2MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 741.7MB. Max. memory is 8.0GB. [2022-09-20 22:26:37,567 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 189.8MB. Free memory was 144.2MB in the beginning and 144.1MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 383.05ms. Allocated memory was 189.8MB in the beginning and 243.3MB in the end (delta: 53.5MB). Free memory was 160.2MB in the beginning and 198.2MB in the end (delta: -38.1MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.41ms. Allocated memory is still 243.3MB. Free memory was 198.2MB in the beginning and 195.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.52ms. Allocated memory is still 243.3MB. Free memory was 195.6MB in the beginning and 193.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 775.02ms. Allocated memory is still 243.3MB. Free memory was 193.5MB in the beginning and 184.7MB in the end (delta: 8.8MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. * TraceAbstraction took 14070.75ms. Allocated memory was 243.3MB in the beginning and 2.7GB in the end (delta: 2.4GB). Free memory was 184.2MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 741.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L721] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L722] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L723] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L724] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L725] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L726] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L727] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L728] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L729] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L730] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L731] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L732] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L733] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L734] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L735] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L736] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L737] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t745; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t745, ((void *)0), P0, ((void *)0))=-2, t745={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t746; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, t746={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t746, ((void *)0), P1, ((void *)0))=-1, t745={5:0}, t746={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t747; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, pthread_create(&t747, ((void *)0), P2, ((void *)0))=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L807] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=50, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __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=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __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=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __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=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __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=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __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=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: 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, 144 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: 13.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 766 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 766 mSDsluCounter, 707 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1296 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1645 IncrementalHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 164 mSDtfsCounter, 1645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=991occurred in iteration=7, InterpolantAutomatonStates: 120, 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.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 952 NumberOfCodeBlocks, 952 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 4064 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:26:37,591 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...