./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:48:16,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:48:16,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:48:16,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:48:16,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:48:16,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:48:16,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:48:16,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:48:16,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:48:16,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:48:16,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:48:16,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:48:16,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:48:16,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:48:16,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:48:16,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:48:16,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:48:16,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:48:16,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:48:16,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:48:16,148 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:48:16,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:48:16,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:48:16,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:48:16,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:48:16,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:48:16,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:48:16,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:48:16,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:48:16,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:48:16,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:48:16,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:48:16,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:48:16,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:48:16,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:48:16,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:48:16,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:48:16,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:48:16,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:48:16,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:48:16,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:48:16,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:48:16,165 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:48:16,184 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:48:16,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:48:16,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:48:16,184 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:48:16,185 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:48:16,185 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:48:16,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:48:16,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:48:16,186 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:48:16,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:48:16,186 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:48:16,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:48:16,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:48:16,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:48:16,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:48:16,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:48:16,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:48:16,187 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:48:16,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:48:16,187 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:48:16,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:48:16,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:48:16,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:48:16,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:48:16,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:48:16,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:48:16,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:48:16,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:48:16,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:48:16,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:48:16,189 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:48:16,189 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:48:16,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:48:16,189 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2022-07-13 21:48:16,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:48:16,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:48:16,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:48:16,398 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:48:16,398 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:48:16,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-07-13 21:48:16,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcf747e2/49b7703b9d8a42248814c8c2513707c5/FLAGbadd8e1ca [2022-07-13 21:48:16,826 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:48:16,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-07-13 21:48:16,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcf747e2/49b7703b9d8a42248814c8c2513707c5/FLAGbadd8e1ca [2022-07-13 21:48:17,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcf747e2/49b7703b9d8a42248814c8c2513707c5 [2022-07-13 21:48:17,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:48:17,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:48:17,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:48:17,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:48:17,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:48:17,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507d62d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17, skipping insertion in model container [2022-07-13 21:48:17,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:48:17,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:48:17,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-07-13 21:48:17,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:48:17,474 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:48:17,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-07-13 21:48:17,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:48:17,566 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:48:17,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17 WrapperNode [2022-07-13 21:48:17,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:48:17,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:48:17,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:48:17,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:48:17,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,601 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-07-13 21:48:17,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:48:17,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:48:17,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:48:17,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:48:17,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:48:17,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:48:17,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:48:17,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:48:17,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17" (1/1) ... [2022-07-13 21:48:17,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:48:17,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:48:17,670 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-07-13 21:48:17,671 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-07-13 21:48:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:48:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 21:48:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:48:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:48:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:48:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-13 21:48:17,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-13 21:48:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-13 21:48:17,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-13 21:48:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-13 21:48:17,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-13 21:48:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:48:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 21:48:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:48:17,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:48:17,705 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 21:48:17,854 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:48:17,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:48:18,194 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:48:18,357 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:48:18,358 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 21:48:18,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:48:18 BoogieIcfgContainer [2022-07-13 21:48:18,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:48:18,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:48:18,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:48:18,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:48:18,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:48:17" (1/3) ... [2022-07-13 21:48:18,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6069a7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:48:18, skipping insertion in model container [2022-07-13 21:48:18,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:48:17" (2/3) ... [2022-07-13 21:48:18,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6069a7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:48:18, skipping insertion in model container [2022-07-13 21:48:18,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:48:18" (3/3) ... [2022-07-13 21:48:18,365 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-07-13 21:48:18,368 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:48:18,374 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:48:18,374 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:48:18,375 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:48:18,417 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-13 21:48:18,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-07-13 21:48:18,483 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-07-13 21:48:18,483 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:48:18,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-07-13 21:48:18,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-07-13 21:48:18,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-07-13 21:48:18,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:48:18,507 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=true, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3bf11f4f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a7dc915 [2022-07-13 21:48:18,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-13 21:48:18,517 INFO L129 PetriNetUnfolder]: 0/73 cut-off events. [2022-07-13 21:48:18,517 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:48:18,517 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:18,518 INFO L200 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] [2022-07-13 21:48:18,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash -146856561, now seen corresponding path program 1 times [2022-07-13 21:48:18,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:18,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929995387] [2022-07-13 21:48:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:18,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929995387] [2022-07-13 21:48:18,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929995387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:18,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:18,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:48:18,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115059681] [2022-07-13 21:48:18,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:18,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:48:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:18,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:48:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:48:18,760 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 113 [2022-07-13 21:48:18,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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-07-13 21:48:18,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:18,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 113 [2022-07-13 21:48:18,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:18,861 INFO L129 PetriNetUnfolder]: 17/242 cut-off events. [2022-07-13 21:48:18,861 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-13 21:48:18,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 242 events. 17/242 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 747 event pairs, 7 based on Foata normal form. 8/238 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2022-07-13 21:48:18,872 INFO L132 encePairwiseOnDemand]: 108/113 looper letters, 10 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2022-07-13 21:48:18,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 251 flow [2022-07-13 21:48:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:48:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:48:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-07-13 21:48:18,887 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9351032448377581 [2022-07-13 21:48:18,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-07-13 21:48:18,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-07-13 21:48:18,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:18,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-07-13 21:48:18,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-07-13 21:48:18,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-07-13 21:48:18,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-07-13 21:48:18,901 INFO L186 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 317 transitions. [2022-07-13 21:48:18,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 251 flow [2022-07-13 21:48:18,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 109 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-13 21:48:18,906 INFO L242 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-07-13 21:48:18,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-07-13 21:48:18,909 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-07-13 21:48:18,909 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-07-13 21:48:18,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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-07-13 21:48:18,910 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:18,910 INFO L200 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] [2022-07-13 21:48:18,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:48:18,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:18,911 INFO L85 PathProgramCache]: Analyzing trace with hash -45666451, now seen corresponding path program 1 times [2022-07-13 21:48:18,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:18,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630905918] [2022-07-13 21:48:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:19,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630905918] [2022-07-13 21:48:19,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630905918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:19,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:19,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:48:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857746323] [2022-07-13 21:48:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:19,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:48:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:48:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:48:19,154 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2022-07-13 21:48:19,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 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-07-13 21:48:19,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:19,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2022-07-13 21:48:19,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:19,466 INFO L129 PetriNetUnfolder]: 357/1165 cut-off events. [2022-07-13 21:48:19,466 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-07-13 21:48:19,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1165 events. 357/1165 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7988 event pairs, 56 based on Foata normal form. 0/1131 useless extension candidates. Maximal degree in co-relation 1791. Up to 333 conditions per place. [2022-07-13 21:48:19,473 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 20 selfloop transitions, 3 changer transitions 48/149 dead transitions. [2022-07-13 21:48:19,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 149 transitions, 446 flow [2022-07-13 21:48:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:48:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:48:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-07-13 21:48:19,477 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8751229105211407 [2022-07-13 21:48:19,477 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2022-07-13 21:48:19,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2022-07-13 21:48:19,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:19,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2022-07-13 21:48:19,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 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-07-13 21:48:19,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-13 21:48:19,483 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-13 21:48:19,483 INFO L186 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 9 states and 890 transitions. [2022-07-13 21:48:19,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 149 transitions, 446 flow [2022-07-13 21:48:19,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 149 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:48:19,488 INFO L242 Difference]: Finished difference. Result has 128 places, 96 transitions, 237 flow [2022-07-13 21:48:19,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=128, PETRI_TRANSITIONS=96} [2022-07-13 21:48:19,489 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2022-07-13 21:48:19,489 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 96 transitions, 237 flow [2022-07-13 21:48:19,489 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-07-13 21:48:19,490 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:19,490 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:48:19,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:48:19,491 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash -806024468, now seen corresponding path program 1 times [2022-07-13 21:48:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:19,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85553023] [2022-07-13 21:48:19,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:19,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:19,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:19,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85553023] [2022-07-13 21:48:19,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85553023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:19,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:19,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 21:48:19,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973656174] [2022-07-13 21:48:19,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:19,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:48:19,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:19,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:48:19,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:48:19,739 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-13 21:48:19,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 96 transitions, 237 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 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-07-13 21:48:19,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:19,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-13 21:48:19,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:20,024 INFO L129 PetriNetUnfolder]: 287/690 cut-off events. [2022-07-13 21:48:20,024 INFO L130 PetriNetUnfolder]: For 642/647 co-relation queries the response was YES. [2022-07-13 21:48:20,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 690 events. 287/690 cut-off events. For 642/647 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3760 event pairs, 95 based on Foata normal form. 21/676 useless extension candidates. Maximal degree in co-relation 1575. Up to 261 conditions per place. [2022-07-13 21:48:20,032 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 16 selfloop transitions, 10 changer transitions 34/138 dead transitions. [2022-07-13 21:48:20,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 138 transitions, 471 flow [2022-07-13 21:48:20,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:48:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-13 21:48:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1413 transitions. [2022-07-13 21:48:20,037 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8336283185840708 [2022-07-13 21:48:20,037 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1413 transitions. [2022-07-13 21:48:20,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1413 transitions. [2022-07-13 21:48:20,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:20,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1413 transitions. [2022-07-13 21:48:20,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 94.2) internal successors, (1413), 15 states have internal predecessors, (1413), 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-07-13 21:48:20,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 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-07-13 21:48:20,046 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 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-07-13 21:48:20,046 INFO L186 Difference]: Start difference. First operand has 128 places, 96 transitions, 237 flow. Second operand 15 states and 1413 transitions. [2022-07-13 21:48:20,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 138 transitions, 471 flow [2022-07-13 21:48:20,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 138 transitions, 450 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-07-13 21:48:20,053 INFO L242 Difference]: Finished difference. Result has 131 places, 102 transitions, 314 flow [2022-07-13 21:48:20,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=314, PETRI_PLACES=131, PETRI_TRANSITIONS=102} [2022-07-13 21:48:20,055 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2022-07-13 21:48:20,055 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 102 transitions, 314 flow [2022-07-13 21:48:20,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 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-07-13 21:48:20,055 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:20,056 INFO L200 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-07-13 21:48:20,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:48:20,056 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:20,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1968626143, now seen corresponding path program 1 times [2022-07-13 21:48:20,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:20,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526487126] [2022-07-13 21:48:20,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:20,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:20,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526487126] [2022-07-13 21:48:20,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526487126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:20,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:20,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:48:20,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945217598] [2022-07-13 21:48:20,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:20,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:48:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:20,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:48:20,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:48:20,258 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-13 21:48:20,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 102 transitions, 314 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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-07-13 21:48:20,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:20,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-13 21:48:20,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:20,546 INFO L129 PetriNetUnfolder]: 216/578 cut-off events. [2022-07-13 21:48:20,546 INFO L130 PetriNetUnfolder]: For 1686/1718 co-relation queries the response was YES. [2022-07-13 21:48:20,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1936 conditions, 578 events. 216/578 cut-off events. For 1686/1718 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2928 event pairs, 30 based on Foata normal form. 13/565 useless extension candidates. Maximal degree in co-relation 1863. Up to 202 conditions per place. [2022-07-13 21:48:20,551 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 26 selfloop transitions, 7 changer transitions 25/137 dead transitions. [2022-07-13 21:48:20,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 137 transitions, 670 flow [2022-07-13 21:48:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:48:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-13 21:48:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1330 transitions. [2022-07-13 21:48:20,555 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8407079646017699 [2022-07-13 21:48:20,555 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1330 transitions. [2022-07-13 21:48:20,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1330 transitions. [2022-07-13 21:48:20,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:20,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1330 transitions. [2022-07-13 21:48:20,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.0) internal successors, (1330), 14 states have internal predecessors, (1330), 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-07-13 21:48:20,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-13 21:48:20,565 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-13 21:48:20,565 INFO L186 Difference]: Start difference. First operand has 131 places, 102 transitions, 314 flow. Second operand 14 states and 1330 transitions. [2022-07-13 21:48:20,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 137 transitions, 670 flow [2022-07-13 21:48:20,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 137 transitions, 642 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-07-13 21:48:20,574 INFO L242 Difference]: Finished difference. Result has 140 places, 104 transitions, 361 flow [2022-07-13 21:48:20,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=361, PETRI_PLACES=140, PETRI_TRANSITIONS=104} [2022-07-13 21:48:20,575 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2022-07-13 21:48:20,578 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 104 transitions, 361 flow [2022-07-13 21:48:20,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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-07-13 21:48:20,579 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:20,579 INFO L200 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-07-13 21:48:20,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:48:20,579 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:20,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:20,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1309432117, now seen corresponding path program 1 times [2022-07-13 21:48:20,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:20,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430292016] [2022-07-13 21:48:20,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:20,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:20,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:20,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430292016] [2022-07-13 21:48:20,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430292016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:20,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:20,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 21:48:20,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583870663] [2022-07-13 21:48:20,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:20,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 21:48:20,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:20,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 21:48:20,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-13 21:48:20,832 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-07-13 21:48:20,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 104 transitions, 361 flow. Second operand has 13 states, 13 states have (on average 89.38461538461539) internal successors, (1162), 13 states have internal predecessors, (1162), 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-07-13 21:48:20,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:20,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-07-13 21:48:20,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:21,082 INFO L129 PetriNetUnfolder]: 162/451 cut-off events. [2022-07-13 21:48:21,082 INFO L130 PetriNetUnfolder]: For 2135/2189 co-relation queries the response was YES. [2022-07-13 21:48:21,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 451 events. 162/451 cut-off events. For 2135/2189 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2091 event pairs, 32 based on Foata normal form. 8/432 useless extension candidates. Maximal degree in co-relation 1712. Up to 192 conditions per place. [2022-07-13 21:48:21,086 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 22 selfloop transitions, 9 changer transitions 13/120 dead transitions. [2022-07-13 21:48:21,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 120 transitions, 597 flow [2022-07-13 21:48:21,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:48:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-13 21:48:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1273 transitions. [2022-07-13 21:48:21,089 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.804677623261694 [2022-07-13 21:48:21,089 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1273 transitions. [2022-07-13 21:48:21,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1273 transitions. [2022-07-13 21:48:21,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:21,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1273 transitions. [2022-07-13 21:48:21,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.92857142857143) internal successors, (1273), 14 states have internal predecessors, (1273), 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-07-13 21:48:21,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-13 21:48:21,095 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-13 21:48:21,095 INFO L186 Difference]: Start difference. First operand has 140 places, 104 transitions, 361 flow. Second operand 14 states and 1273 transitions. [2022-07-13 21:48:21,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 120 transitions, 597 flow [2022-07-13 21:48:21,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 120 transitions, 544 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-07-13 21:48:21,099 INFO L242 Difference]: Finished difference. Result has 143 places, 104 transitions, 368 flow [2022-07-13 21:48:21,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=368, PETRI_PLACES=143, PETRI_TRANSITIONS=104} [2022-07-13 21:48:21,100 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2022-07-13 21:48:21,100 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 104 transitions, 368 flow [2022-07-13 21:48:21,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.38461538461539) internal successors, (1162), 13 states have internal predecessors, (1162), 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-07-13 21:48:21,101 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:21,101 INFO L200 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-07-13 21:48:21,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:48:21,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:21,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1663463146, now seen corresponding path program 1 times [2022-07-13 21:48:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:21,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963710302] [2022-07-13 21:48:21,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:21,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:21,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963710302] [2022-07-13 21:48:21,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963710302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:21,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:21,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 21:48:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634370053] [2022-07-13 21:48:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:21,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:48:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:21,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:48:21,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:48:21,261 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-13 21:48:21,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 104 transitions, 368 flow. Second operand has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 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-07-13 21:48:21,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:21,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-13 21:48:21,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:21,483 INFO L129 PetriNetUnfolder]: 178/519 cut-off events. [2022-07-13 21:48:21,483 INFO L130 PetriNetUnfolder]: For 2596/2633 co-relation queries the response was YES. [2022-07-13 21:48:21,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 519 events. 178/519 cut-off events. For 2596/2633 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2583 event pairs, 43 based on Foata normal form. 17/504 useless extension candidates. Maximal degree in co-relation 1912. Up to 172 conditions per place. [2022-07-13 21:48:21,487 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 19 selfloop transitions, 11 changer transitions 23/130 dead transitions. [2022-07-13 21:48:21,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 130 transitions, 682 flow [2022-07-13 21:48:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:48:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-13 21:48:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1296 transitions. [2022-07-13 21:48:21,491 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8192161820480405 [2022-07-13 21:48:21,491 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1296 transitions. [2022-07-13 21:48:21,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1296 transitions. [2022-07-13 21:48:21,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:21,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1296 transitions. [2022-07-13 21:48:21,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 92.57142857142857) internal successors, (1296), 14 states have internal predecessors, (1296), 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-07-13 21:48:21,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-13 21:48:21,496 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-13 21:48:21,497 INFO L186 Difference]: Start difference. First operand has 143 places, 104 transitions, 368 flow. Second operand 14 states and 1296 transitions. [2022-07-13 21:48:21,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 130 transitions, 682 flow [2022-07-13 21:48:21,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 130 transitions, 619 flow, removed 24 selfloop flow, removed 15 redundant places. [2022-07-13 21:48:21,502 INFO L242 Difference]: Finished difference. Result has 142 places, 105 transitions, 393 flow [2022-07-13 21:48:21,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=393, PETRI_PLACES=142, PETRI_TRANSITIONS=105} [2022-07-13 21:48:21,504 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2022-07-13 21:48:21,504 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 105 transitions, 393 flow [2022-07-13 21:48:21,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 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-07-13 21:48:21,505 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:21,505 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:48:21,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:48:21,505 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:21,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1865244491, now seen corresponding path program 1 times [2022-07-13 21:48:21,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:21,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788714604] [2022-07-13 21:48:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:21,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788714604] [2022-07-13 21:48:21,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788714604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:21,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:21,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 21:48:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321183551] [2022-07-13 21:48:21,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:21,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 21:48:21,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:21,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 21:48:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:48:21,677 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-13 21:48:21,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 105 transitions, 393 flow. Second operand has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 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-07-13 21:48:21,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:21,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-13 21:48:21,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:21,880 INFO L129 PetriNetUnfolder]: 152/462 cut-off events. [2022-07-13 21:48:21,880 INFO L130 PetriNetUnfolder]: For 2953/3002 co-relation queries the response was YES. [2022-07-13 21:48:21,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 462 events. 152/462 cut-off events. For 2953/3002 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2125 event pairs, 28 based on Foata normal form. 13/454 useless extension candidates. Maximal degree in co-relation 1901. Up to 160 conditions per place. [2022-07-13 21:48:21,884 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 23 selfloop transitions, 11 changer transitions 10/121 dead transitions. [2022-07-13 21:48:21,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 121 transitions, 649 flow [2022-07-13 21:48:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:48:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:48:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 929 transitions. [2022-07-13 21:48:21,886 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8221238938053097 [2022-07-13 21:48:21,886 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 929 transitions. [2022-07-13 21:48:21,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 929 transitions. [2022-07-13 21:48:21,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:21,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 929 transitions. [2022-07-13 21:48:21,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 92.9) internal successors, (929), 10 states have internal predecessors, (929), 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-07-13 21:48:21,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 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-07-13 21:48:21,890 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 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-07-13 21:48:21,890 INFO L186 Difference]: Start difference. First operand has 142 places, 105 transitions, 393 flow. Second operand 10 states and 929 transitions. [2022-07-13 21:48:21,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 121 transitions, 649 flow [2022-07-13 21:48:21,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 121 transitions, 616 flow, removed 8 selfloop flow, removed 9 redundant places. [2022-07-13 21:48:21,894 INFO L242 Difference]: Finished difference. Result has 140 places, 108 transitions, 436 flow [2022-07-13 21:48:21,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=436, PETRI_PLACES=140, PETRI_TRANSITIONS=108} [2022-07-13 21:48:21,895 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2022-07-13 21:48:21,895 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 108 transitions, 436 flow [2022-07-13 21:48:21,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 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-07-13 21:48:21,896 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:21,896 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:48:21,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:48:21,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:21,896 INFO L85 PathProgramCache]: Analyzing trace with hash -833739637, now seen corresponding path program 2 times [2022-07-13 21:48:21,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:21,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608929985] [2022-07-13 21:48:21,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:21,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:22,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608929985] [2022-07-13 21:48:22,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608929985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:22,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:22,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:48:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365669986] [2022-07-13 21:48:22,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:22,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:48:22,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:48:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:48:22,005 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-13 21:48:22,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 108 transitions, 436 flow. Second operand has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 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-07-13 21:48:22,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:22,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-13 21:48:22,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:22,248 INFO L129 PetriNetUnfolder]: 158/465 cut-off events. [2022-07-13 21:48:22,248 INFO L130 PetriNetUnfolder]: For 3618/3845 co-relation queries the response was YES. [2022-07-13 21:48:22,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2211 conditions, 465 events. 158/465 cut-off events. For 3618/3845 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2221 event pairs, 18 based on Foata normal form. 15/457 useless extension candidates. Maximal degree in co-relation 2127. Up to 168 conditions per place. [2022-07-13 21:48:22,253 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 26 selfloop transitions, 13 changer transitions 19/136 dead transitions. [2022-07-13 21:48:22,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 136 transitions, 910 flow [2022-07-13 21:48:22,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:48:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-13 21:48:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1129 transitions. [2022-07-13 21:48:22,256 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8325958702064897 [2022-07-13 21:48:22,256 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1129 transitions. [2022-07-13 21:48:22,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1129 transitions. [2022-07-13 21:48:22,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:22,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1129 transitions. [2022-07-13 21:48:22,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.08333333333333) internal successors, (1129), 12 states have internal predecessors, (1129), 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-07-13 21:48:22,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 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-07-13 21:48:22,261 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 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-07-13 21:48:22,261 INFO L186 Difference]: Start difference. First operand has 140 places, 108 transitions, 436 flow. Second operand 12 states and 1129 transitions. [2022-07-13 21:48:22,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 136 transitions, 910 flow [2022-07-13 21:48:22,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 136 transitions, 761 flow, removed 63 selfloop flow, removed 11 redundant places. [2022-07-13 21:48:22,267 INFO L242 Difference]: Finished difference. Result has 145 places, 115 transitions, 500 flow [2022-07-13 21:48:22,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=500, PETRI_PLACES=145, PETRI_TRANSITIONS=115} [2022-07-13 21:48:22,270 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 27 predicate places. [2022-07-13 21:48:22,270 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 115 transitions, 500 flow [2022-07-13 21:48:22,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 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-07-13 21:48:22,270 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:22,270 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:48:22,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:48:22,271 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:22,272 INFO L85 PathProgramCache]: Analyzing trace with hash 466697881, now seen corresponding path program 3 times [2022-07-13 21:48:22,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:22,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924576414] [2022-07-13 21:48:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:22,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:22,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924576414] [2022-07-13 21:48:22,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924576414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:22,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:22,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:48:22,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025831560] [2022-07-13 21:48:22,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:22,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:48:22,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:22,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:48:22,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:48:22,411 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-13 21:48:22,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 115 transitions, 500 flow. Second operand has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 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-07-13 21:48:22,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:22,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-13 21:48:22,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:22,693 INFO L129 PetriNetUnfolder]: 168/511 cut-off events. [2022-07-13 21:48:22,693 INFO L130 PetriNetUnfolder]: For 5356/5736 co-relation queries the response was YES. [2022-07-13 21:48:22,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 511 events. 168/511 cut-off events. For 5356/5736 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2624 event pairs, 4 based on Foata normal form. 21/508 useless extension candidates. Maximal degree in co-relation 2608. Up to 154 conditions per place. [2022-07-13 21:48:22,698 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 28 selfloop transitions, 19 changer transitions 19/144 dead transitions. [2022-07-13 21:48:22,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 1062 flow [2022-07-13 21:48:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:48:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-13 21:48:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1312 transitions. [2022-07-13 21:48:22,700 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8293299620733249 [2022-07-13 21:48:22,700 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1312 transitions. [2022-07-13 21:48:22,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1312 transitions. [2022-07-13 21:48:22,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:22,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1312 transitions. [2022-07-13 21:48:22,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.71428571428571) internal successors, (1312), 14 states have internal predecessors, (1312), 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-07-13 21:48:22,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-13 21:48:22,705 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-13 21:48:22,705 INFO L186 Difference]: Start difference. First operand has 145 places, 115 transitions, 500 flow. Second operand 14 states and 1312 transitions. [2022-07-13 21:48:22,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 1062 flow [2022-07-13 21:48:22,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 144 transitions, 1010 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-07-13 21:48:22,712 INFO L242 Difference]: Finished difference. Result has 154 places, 117 transitions, 586 flow [2022-07-13 21:48:22,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=586, PETRI_PLACES=154, PETRI_TRANSITIONS=117} [2022-07-13 21:48:22,713 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 36 predicate places. [2022-07-13 21:48:22,713 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 117 transitions, 586 flow [2022-07-13 21:48:22,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 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-07-13 21:48:22,713 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:22,713 INFO L200 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-07-13 21:48:22,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:48:22,713 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1636586413, now seen corresponding path program 1 times [2022-07-13 21:48:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:22,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110059190] [2022-07-13 21:48:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:22,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:22,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110059190] [2022-07-13 21:48:22,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110059190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:22,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:22,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 21:48:22,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312442775] [2022-07-13 21:48:22,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:22,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 21:48:22,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:22,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 21:48:22,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:48:22,865 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-13 21:48:22,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 117 transitions, 586 flow. Second operand has 11 states, 11 states have (on average 90.63636363636364) internal successors, (997), 11 states have internal predecessors, (997), 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-07-13 21:48:22,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:22,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-13 21:48:22,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:23,097 INFO L129 PetriNetUnfolder]: 126/443 cut-off events. [2022-07-13 21:48:23,098 INFO L130 PetriNetUnfolder]: For 5724/5877 co-relation queries the response was YES. [2022-07-13 21:48:23,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 443 events. 126/443 cut-off events. For 5724/5877 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2106 event pairs, 12 based on Foata normal form. 27/445 useless extension candidates. Maximal degree in co-relation 2296. Up to 166 conditions per place. [2022-07-13 21:48:23,102 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 31 selfloop transitions, 13 changer transitions 10/131 dead transitions. [2022-07-13 21:48:23,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 131 transitions, 914 flow [2022-07-13 21:48:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:48:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:48:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1198 transitions. [2022-07-13 21:48:23,104 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8155207624234173 [2022-07-13 21:48:23,105 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1198 transitions. [2022-07-13 21:48:23,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1198 transitions. [2022-07-13 21:48:23,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:23,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1198 transitions. [2022-07-13 21:48:23,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.15384615384616) internal successors, (1198), 13 states have internal predecessors, (1198), 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-07-13 21:48:23,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-07-13 21:48:23,109 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-07-13 21:48:23,109 INFO L186 Difference]: Start difference. First operand has 154 places, 117 transitions, 586 flow. Second operand 13 states and 1198 transitions. [2022-07-13 21:48:23,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 131 transitions, 914 flow [2022-07-13 21:48:23,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 131 transitions, 792 flow, removed 55 selfloop flow, removed 14 redundant places. [2022-07-13 21:48:23,117 INFO L242 Difference]: Finished difference. Result has 153 places, 118 transitions, 596 flow [2022-07-13 21:48:23,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=596, PETRI_PLACES=153, PETRI_TRANSITIONS=118} [2022-07-13 21:48:23,118 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 35 predicate places. [2022-07-13 21:48:23,118 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 118 transitions, 596 flow [2022-07-13 21:48:23,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.63636363636364) internal successors, (997), 11 states have internal predecessors, (997), 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-07-13 21:48:23,119 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:23,119 INFO L200 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-07-13 21:48:23,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:48:23,119 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:23,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1360554535, now seen corresponding path program 2 times [2022-07-13 21:48:23,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:23,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119327720] [2022-07-13 21:48:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:23,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:23,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119327720] [2022-07-13 21:48:23,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119327720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:23,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:23,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 21:48:23,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289419137] [2022-07-13 21:48:23,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:23,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 21:48:23,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:23,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 21:48:23,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-13 21:48:23,307 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-07-13 21:48:23,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 118 transitions, 596 flow. Second operand has 13 states, 13 states have (on average 89.46153846153847) internal successors, (1163), 13 states have internal predecessors, (1163), 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-07-13 21:48:23,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:23,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-07-13 21:48:23,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:23,542 INFO L129 PetriNetUnfolder]: 126/442 cut-off events. [2022-07-13 21:48:23,543 INFO L130 PetriNetUnfolder]: For 4440/4593 co-relation queries the response was YES. [2022-07-13 21:48:23,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 442 events. 126/442 cut-off events. For 4440/4593 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2109 event pairs, 18 based on Foata normal form. 15/432 useless extension candidates. Maximal degree in co-relation 2130. Up to 159 conditions per place. [2022-07-13 21:48:23,547 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 33 selfloop transitions, 15 changer transitions 10/134 dead transitions. [2022-07-13 21:48:23,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 134 transitions, 955 flow [2022-07-13 21:48:23,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:48:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-13 21:48:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1273 transitions. [2022-07-13 21:48:23,550 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.804677623261694 [2022-07-13 21:48:23,550 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1273 transitions. [2022-07-13 21:48:23,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1273 transitions. [2022-07-13 21:48:23,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:23,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1273 transitions. [2022-07-13 21:48:23,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.92857142857143) internal successors, (1273), 14 states have internal predecessors, (1273), 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-07-13 21:48:23,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-13 21:48:23,556 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-13 21:48:23,557 INFO L186 Difference]: Start difference. First operand has 153 places, 118 transitions, 596 flow. Second operand 14 states and 1273 transitions. [2022-07-13 21:48:23,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 134 transitions, 955 flow [2022-07-13 21:48:23,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 134 transitions, 861 flow, removed 36 selfloop flow, removed 11 redundant places. [2022-07-13 21:48:23,565 INFO L242 Difference]: Finished difference. Result has 156 places, 120 transitions, 652 flow [2022-07-13 21:48:23,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=652, PETRI_PLACES=156, PETRI_TRANSITIONS=120} [2022-07-13 21:48:23,566 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 38 predicate places. [2022-07-13 21:48:23,566 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 120 transitions, 652 flow [2022-07-13 21:48:23,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.46153846153847) internal successors, (1163), 13 states have internal predecessors, (1163), 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-07-13 21:48:23,567 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:23,567 INFO L200 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-07-13 21:48:23,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:48:23,567 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:23,568 INFO L85 PathProgramCache]: Analyzing trace with hash 227597131, now seen corresponding path program 1 times [2022-07-13 21:48:23,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:23,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678541569] [2022-07-13 21:48:23,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:23,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:23,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678541569] [2022-07-13 21:48:23,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678541569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:23,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:23,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:48:23,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129857542] [2022-07-13 21:48:23,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:23,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:48:23,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:23,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:48:23,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:48:23,646 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-13 21:48:23,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 120 transitions, 652 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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-07-13 21:48:23,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:23,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-13 21:48:23,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:23,978 INFO L129 PetriNetUnfolder]: 1065/2184 cut-off events. [2022-07-13 21:48:23,978 INFO L130 PetriNetUnfolder]: For 25870/26152 co-relation queries the response was YES. [2022-07-13 21:48:23,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9927 conditions, 2184 events. 1065/2184 cut-off events. For 25870/26152 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14699 event pairs, 48 based on Foata normal form. 143/2247 useless extension candidates. Maximal degree in co-relation 9839. Up to 649 conditions per place. [2022-07-13 21:48:23,998 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 122 selfloop transitions, 15 changer transitions 26/243 dead transitions. [2022-07-13 21:48:23,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 243 transitions, 2488 flow [2022-07-13 21:48:23,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:48:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:48:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 974 transitions. [2022-07-13 21:48:23,999 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8619469026548673 [2022-07-13 21:48:23,999 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 974 transitions. [2022-07-13 21:48:24,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 974 transitions. [2022-07-13 21:48:24,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:24,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 974 transitions. [2022-07-13 21:48:24,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.4) internal successors, (974), 10 states have internal predecessors, (974), 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-07-13 21:48:24,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 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-07-13 21:48:24,003 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 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-07-13 21:48:24,003 INFO L186 Difference]: Start difference. First operand has 156 places, 120 transitions, 652 flow. Second operand 10 states and 974 transitions. [2022-07-13 21:48:24,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 243 transitions, 2488 flow [2022-07-13 21:48:24,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 243 transitions, 2230 flow, removed 94 selfloop flow, removed 12 redundant places. [2022-07-13 21:48:24,026 INFO L242 Difference]: Finished difference. Result has 153 places, 133 transitions, 692 flow [2022-07-13 21:48:24,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=692, PETRI_PLACES=153, PETRI_TRANSITIONS=133} [2022-07-13 21:48:24,027 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 35 predicate places. [2022-07-13 21:48:24,027 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 133 transitions, 692 flow [2022-07-13 21:48:24,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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-07-13 21:48:24,027 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:24,027 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:48:24,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 21:48:24,028 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:24,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1864530944, now seen corresponding path program 1 times [2022-07-13 21:48:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:24,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594076813] [2022-07-13 21:48:24,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:24,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:24,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:24,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594076813] [2022-07-13 21:48:24,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594076813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:24,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:24,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 21:48:24,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729440866] [2022-07-13 21:48:24,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:24,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 21:48:24,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:24,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 21:48:24,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:48:24,203 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-07-13 21:48:24,204 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 133 transitions, 692 flow. Second operand has 12 states, 12 states have (on average 89.58333333333333) internal successors, (1075), 12 states have internal predecessors, (1075), 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-07-13 21:48:24,204 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:24,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-07-13 21:48:24,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:24,484 INFO L129 PetriNetUnfolder]: 232/1033 cut-off events. [2022-07-13 21:48:24,484 INFO L130 PetriNetUnfolder]: For 3963/4273 co-relation queries the response was YES. [2022-07-13 21:48:24,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3646 conditions, 1033 events. 232/1033 cut-off events. For 3963/4273 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8323 event pairs, 54 based on Foata normal form. 35/994 useless extension candidates. Maximal degree in co-relation 3555. Up to 168 conditions per place. [2022-07-13 21:48:24,494 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 40 selfloop transitions, 20 changer transitions 0/149 dead transitions. [2022-07-13 21:48:24,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 149 transitions, 982 flow [2022-07-13 21:48:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:48:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:48:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1186 transitions. [2022-07-13 21:48:24,495 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.807351940095303 [2022-07-13 21:48:24,495 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1186 transitions. [2022-07-13 21:48:24,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1186 transitions. [2022-07-13 21:48:24,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:24,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1186 transitions. [2022-07-13 21:48:24,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.23076923076923) internal successors, (1186), 13 states have internal predecessors, (1186), 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-07-13 21:48:24,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-07-13 21:48:24,499 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-07-13 21:48:24,499 INFO L186 Difference]: Start difference. First operand has 153 places, 133 transitions, 692 flow. Second operand 13 states and 1186 transitions. [2022-07-13 21:48:24,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 149 transitions, 982 flow [2022-07-13 21:48:24,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 149 transitions, 970 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-07-13 21:48:24,508 INFO L242 Difference]: Finished difference. Result has 171 places, 141 transitions, 879 flow [2022-07-13 21:48:24,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=879, PETRI_PLACES=171, PETRI_TRANSITIONS=141} [2022-07-13 21:48:24,509 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 53 predicate places. [2022-07-13 21:48:24,509 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 141 transitions, 879 flow [2022-07-13 21:48:24,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 89.58333333333333) internal successors, (1075), 12 states have internal predecessors, (1075), 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-07-13 21:48:24,510 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:24,510 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:48:24,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 21:48:24,510 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:24,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1924382768, now seen corresponding path program 1 times [2022-07-13 21:48:24,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:24,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688188061] [2022-07-13 21:48:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:24,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:24,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688188061] [2022-07-13 21:48:24,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688188061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:24,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:24,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:48:24,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244614916] [2022-07-13 21:48:24,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:24,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:48:24,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:24,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:48:24,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:48:24,568 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-13 21:48:24,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 141 transitions, 879 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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-07-13 21:48:24,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:24,568 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-13 21:48:24,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:24,991 INFO L129 PetriNetUnfolder]: 1016/2425 cut-off events. [2022-07-13 21:48:24,991 INFO L130 PetriNetUnfolder]: For 18281/18520 co-relation queries the response was YES. [2022-07-13 21:48:25,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10796 conditions, 2425 events. 1016/2425 cut-off events. For 18281/18520 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 18873 event pairs, 30 based on Foata normal form. 184/2572 useless extension candidates. Maximal degree in co-relation 10700. Up to 513 conditions per place. [2022-07-13 21:48:25,017 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 103 selfloop transitions, 28 changer transitions 52/262 dead transitions. [2022-07-13 21:48:25,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 262 transitions, 2755 flow [2022-07-13 21:48:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:48:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:48:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1266 transitions. [2022-07-13 21:48:25,020 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8618107556160653 [2022-07-13 21:48:25,020 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1266 transitions. [2022-07-13 21:48:25,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1266 transitions. [2022-07-13 21:48:25,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:25,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1266 transitions. [2022-07-13 21:48:25,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.38461538461539) internal successors, (1266), 13 states have internal predecessors, (1266), 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-07-13 21:48:25,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-07-13 21:48:25,024 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 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-07-13 21:48:25,025 INFO L186 Difference]: Start difference. First operand has 171 places, 141 transitions, 879 flow. Second operand 13 states and 1266 transitions. [2022-07-13 21:48:25,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 262 transitions, 2755 flow [2022-07-13 21:48:25,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 262 transitions, 2387 flow, removed 103 selfloop flow, removed 12 redundant places. [2022-07-13 21:48:25,050 INFO L242 Difference]: Finished difference. Result has 177 places, 138 transitions, 794 flow [2022-07-13 21:48:25,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=794, PETRI_PLACES=177, PETRI_TRANSITIONS=138} [2022-07-13 21:48:25,051 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 59 predicate places. [2022-07-13 21:48:25,051 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 138 transitions, 794 flow [2022-07-13 21:48:25,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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-07-13 21:48:25,051 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:25,051 INFO L200 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-07-13 21:48:25,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 21:48:25,051 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1391334937, now seen corresponding path program 1 times [2022-07-13 21:48:25,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:25,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197668558] [2022-07-13 21:48:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:25,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:25,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197668558] [2022-07-13 21:48:25,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197668558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:25,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:25,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:48:25,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561684089] [2022-07-13 21:48:25,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:25,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:48:25,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:25,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:48:25,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:48:25,110 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2022-07-13 21:48:25,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 138 transitions, 794 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 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-07-13 21:48:25,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:25,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2022-07-13 21:48:25,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:25,418 INFO L129 PetriNetUnfolder]: 356/1791 cut-off events. [2022-07-13 21:48:25,419 INFO L130 PetriNetUnfolder]: For 7118/7656 co-relation queries the response was YES. [2022-07-13 21:48:25,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6414 conditions, 1791 events. 356/1791 cut-off events. For 7118/7656 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 17761 event pairs, 22 based on Foata normal form. 32/1743 useless extension candidates. Maximal degree in co-relation 6319. Up to 393 conditions per place. [2022-07-13 21:48:25,434 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 45 selfloop transitions, 3 changer transitions 19/177 dead transitions. [2022-07-13 21:48:25,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 177 transitions, 1355 flow [2022-07-13 21:48:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:48:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:48:25,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 873 transitions. [2022-07-13 21:48:25,436 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8584070796460177 [2022-07-13 21:48:25,436 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 873 transitions. [2022-07-13 21:48:25,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 873 transitions. [2022-07-13 21:48:25,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:25,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 873 transitions. [2022-07-13 21:48:25,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 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-07-13 21:48:25,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-13 21:48:25,444 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-13 21:48:25,444 INFO L186 Difference]: Start difference. First operand has 177 places, 138 transitions, 794 flow. Second operand 9 states and 873 transitions. [2022-07-13 21:48:25,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 177 transitions, 1355 flow [2022-07-13 21:48:25,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 177 transitions, 1231 flow, removed 55 selfloop flow, removed 10 redundant places. [2022-07-13 21:48:25,483 INFO L242 Difference]: Finished difference. Result has 176 places, 138 transitions, 735 flow [2022-07-13 21:48:25,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=735, PETRI_PLACES=176, PETRI_TRANSITIONS=138} [2022-07-13 21:48:25,484 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 58 predicate places. [2022-07-13 21:48:25,484 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 138 transitions, 735 flow [2022-07-13 21:48:25,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 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-07-13 21:48:25,484 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:25,484 INFO L200 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] [2022-07-13 21:48:25,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 21:48:25,485 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash -682223534, now seen corresponding path program 1 times [2022-07-13 21:48:25,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:25,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64512082] [2022-07-13 21:48:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:25,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:25,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:25,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64512082] [2022-07-13 21:48:25,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64512082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:25,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:25,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:48:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3890648] [2022-07-13 21:48:25,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:25,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:48:25,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:25,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:48:25,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:48:25,564 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-13 21:48:25,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 138 transitions, 735 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 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-07-13 21:48:25,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:25,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-13 21:48:25,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:26,059 INFO L129 PetriNetUnfolder]: 1261/3074 cut-off events. [2022-07-13 21:48:26,059 INFO L130 PetriNetUnfolder]: For 15969/16173 co-relation queries the response was YES. [2022-07-13 21:48:26,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13279 conditions, 3074 events. 1261/3074 cut-off events. For 15969/16173 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 26943 event pairs, 44 based on Foata normal form. 181/3210 useless extension candidates. Maximal degree in co-relation 13231. Up to 582 conditions per place. [2022-07-13 21:48:26,091 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 41 selfloop transitions, 12 changer transitions 121/250 dead transitions. [2022-07-13 21:48:26,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 250 transitions, 2216 flow [2022-07-13 21:48:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:48:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-13 21:48:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1527 transitions. [2022-07-13 21:48:26,093 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8445796460176991 [2022-07-13 21:48:26,093 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1527 transitions. [2022-07-13 21:48:26,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1527 transitions. [2022-07-13 21:48:26,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:26,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1527 transitions. [2022-07-13 21:48:26,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.4375) internal successors, (1527), 16 states have internal predecessors, (1527), 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-07-13 21:48:26,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 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-07-13 21:48:26,097 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 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-07-13 21:48:26,097 INFO L186 Difference]: Start difference. First operand has 176 places, 138 transitions, 735 flow. Second operand 16 states and 1527 transitions. [2022-07-13 21:48:26,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 250 transitions, 2216 flow [2022-07-13 21:48:26,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 250 transitions, 1952 flow, removed 103 selfloop flow, removed 15 redundant places. [2022-07-13 21:48:26,196 INFO L242 Difference]: Finished difference. Result has 176 places, 109 transitions, 477 flow [2022-07-13 21:48:26,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=477, PETRI_PLACES=176, PETRI_TRANSITIONS=109} [2022-07-13 21:48:26,196 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 58 predicate places. [2022-07-13 21:48:26,197 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 109 transitions, 477 flow [2022-07-13 21:48:26,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 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-07-13 21:48:26,197 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:26,197 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:48:26,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 21:48:26,197 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:26,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:26,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1671477920, now seen corresponding path program 1 times [2022-07-13 21:48:26,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:26,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971417675] [2022-07-13 21:48:26,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:26,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:48:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:48:26,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:48:26,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971417675] [2022-07-13 21:48:26,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971417675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:48:26,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:48:26,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 21:48:26,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175906878] [2022-07-13 21:48:26,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:48:26,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 21:48:26,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:48:26,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 21:48:26,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:48:26,319 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 113 [2022-07-13 21:48:26,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 109 transitions, 477 flow. Second operand has 12 states, 12 states have (on average 87.83333333333333) internal successors, (1054), 12 states have internal predecessors, (1054), 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-07-13 21:48:26,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:48:26,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 113 [2022-07-13 21:48:26,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:48:26,473 INFO L129 PetriNetUnfolder]: 28/231 cut-off events. [2022-07-13 21:48:26,473 INFO L130 PetriNetUnfolder]: For 469/475 co-relation queries the response was YES. [2022-07-13 21:48:26,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 231 events. 28/231 cut-off events. For 469/475 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 710 event pairs, 0 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 595. Up to 26 conditions per place. [2022-07-13 21:48:26,475 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 19 selfloop transitions, 5 changer transitions 25/126 dead transitions. [2022-07-13 21:48:26,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 126 transitions, 681 flow [2022-07-13 21:48:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:48:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-13 21:48:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1072 transitions. [2022-07-13 21:48:26,476 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7905604719764012 [2022-07-13 21:48:26,476 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1072 transitions. [2022-07-13 21:48:26,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1072 transitions. [2022-07-13 21:48:26,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:48:26,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1072 transitions. [2022-07-13 21:48:26,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.33333333333333) internal successors, (1072), 12 states have internal predecessors, (1072), 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-07-13 21:48:26,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 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-07-13 21:48:26,479 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 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-07-13 21:48:26,479 INFO L186 Difference]: Start difference. First operand has 176 places, 109 transitions, 477 flow. Second operand 12 states and 1072 transitions. [2022-07-13 21:48:26,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 126 transitions, 681 flow [2022-07-13 21:48:26,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 126 transitions, 477 flow, removed 49 selfloop flow, removed 38 redundant places. [2022-07-13 21:48:26,483 INFO L242 Difference]: Finished difference. Result has 134 places, 101 transitions, 276 flow [2022-07-13 21:48:26,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=276, PETRI_PLACES=134, PETRI_TRANSITIONS=101} [2022-07-13 21:48:26,483 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2022-07-13 21:48:26,483 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 101 transitions, 276 flow [2022-07-13 21:48:26,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.83333333333333) internal successors, (1054), 12 states have internal predecessors, (1054), 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-07-13 21:48:26,484 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:48:26,484 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:48:26,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 21:48:26,484 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:48:26,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:48:26,485 INFO L85 PathProgramCache]: Analyzing trace with hash 846745374, now seen corresponding path program 2 times [2022-07-13 21:48:26,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:48:26,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694746869] [2022-07-13 21:48:26,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:48:26,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:48:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:48:26,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:48:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:48:26,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:48:26,559 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:48:26,560 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-13 21:48:26,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-13 21:48:26,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-13 21:48:26,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-13 21:48:26,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-13 21:48:26,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-13 21:48:26,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 21:48:26,562 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:48:26,566 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-13 21:48:26,566 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:48:26,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:48:26 BasicIcfg [2022-07-13 21:48:26,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:48:26,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:48:26,650 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:48:26,650 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:48:26,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:48:18" (3/4) ... [2022-07-13 21:48:26,651 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:48:26,772 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:48:26,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:48:26,773 INFO L158 Benchmark]: Toolchain (without parser) took 9585.10ms. Allocated memory was 109.1MB in the beginning and 316.7MB in the end (delta: 207.6MB). Free memory was 70.1MB in the beginning and 219.6MB in the end (delta: -149.5MB). Peak memory consumption was 219.8MB. Max. memory is 16.1GB. [2022-07-13 21:48:26,773 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:48:26,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.82ms. Allocated memory is still 109.1MB. Free memory was 69.9MB in the beginning and 70.0MB in the end (delta: -55.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 21:48:26,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.50ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 67.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:48:26,774 INFO L158 Benchmark]: Boogie Preprocessor took 31.98ms. Allocated memory is still 109.1MB. Free memory was 67.1MB in the beginning and 65.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:48:26,774 INFO L158 Benchmark]: RCFGBuilder took 724.98ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 65.0MB in the beginning and 66.1MB in the end (delta: -1.0MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2022-07-13 21:48:26,774 INFO L158 Benchmark]: TraceAbstraction took 8288.57ms. Allocated memory was 132.1MB in the beginning and 316.7MB in the end (delta: 184.5MB). Free memory was 65.2MB in the beginning and 100.2MB in the end (delta: -34.9MB). Peak memory consumption was 150.2MB. Max. memory is 16.1GB. [2022-07-13 21:48:26,774 INFO L158 Benchmark]: Witness Printer took 123.09ms. Allocated memory is still 316.7MB. Free memory was 100.2MB in the beginning and 219.6MB in the end (delta: -119.4MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2022-07-13 21:48:26,775 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.18ms. Allocated memory is still 109.1MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.82ms. Allocated memory is still 109.1MB. Free memory was 69.9MB in the beginning and 70.0MB in the end (delta: -55.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.50ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 67.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.98ms. Allocated memory is still 109.1MB. Free memory was 67.1MB in the beginning and 65.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 724.98ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 65.0MB in the beginning and 66.1MB in the end (delta: -1.0MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8288.57ms. Allocated memory was 132.1MB in the beginning and 316.7MB in the end (delta: 184.5MB). Free memory was 65.2MB in the beginning and 100.2MB in the end (delta: -34.9MB). Peak memory consumption was 150.2MB. Max. memory is 16.1GB. * Witness Printer took 123.09ms. Allocated memory is still 316.7MB. Free memory was 100.2MB in the beginning and 219.6MB in the end (delta: -119.4MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * 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] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1492; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=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=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 814]: 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, 139 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: 8.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 756 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 756 mSDsluCounter, 802 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1157 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2056 IncrementalHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 146 mSDtfsCounter, 2056 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=879occurred in iteration=13, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1406 NumberOfCodeBlocks, 1406 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1302 ConstructedInterpolants, 0 QuantifiedInterpolants, 7912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-07-13 21:48:26,803 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE