./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.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/safe030_power.oepc_pso.oepc_rmo.oepc.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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:50:22,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:50:22,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:50:22,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:50:22,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:50:22,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:50:22,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:50:22,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:50:22,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:50:22,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:50:22,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:50:22,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:50:22,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:50:22,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:50:22,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:50:22,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:50:22,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:50:22,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:50:22,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:50:22,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:50:22,530 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:50:22,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:50:22,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:50:22,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:50:22,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:50:22,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:50:22,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:50:22,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:50:22,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:50:22,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:50:22,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:50:22,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:50:22,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:50:22,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:50:22,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:50:22,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:50:22,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:50:22,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:50:22,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:50:22,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:50:22,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:50:22,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:50:22,550 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:50:22,573 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:50:22,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:50:22,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:50:22,574 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:50:22,574 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:50:22,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:50:22,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:50:22,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:50:22,575 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:50:22,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:50:22,576 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:50:22,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:50:22,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:50:22,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:50:22,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:50:22,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:50:22,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:50:22,577 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:50:22,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:50:22,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:50:22,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:50:22,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:50:22,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:50:22,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:50:22,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:50:22,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:50:22,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:50:22,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:50:22,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:50:22,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:50:22,580 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:50:22,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:50:22,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:50:22,580 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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2022-07-13 21:50:22,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:50:22,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:50:22,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:50:22,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:50:22,814 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:50:22,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-07-13 21:50:22,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7a659c4b/5ae5bc67bb07429185f49b62a2bc4e2d/FLAG55a7816e1 [2022-07-13 21:50:23,240 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:50:23,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-07-13 21:50:23,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7a659c4b/5ae5bc67bb07429185f49b62a2bc4e2d/FLAG55a7816e1 [2022-07-13 21:50:23,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7a659c4b/5ae5bc67bb07429185f49b62a2bc4e2d [2022-07-13 21:50:23,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:50:23,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:50:23,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:50:23,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:50:23,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:50:23,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:50:23" (1/1) ... [2022-07-13 21:50:23,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a8cb14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:23, skipping insertion in model container [2022-07-13 21:50:23,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:50:23" (1/1) ... [2022-07-13 21:50:23,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:50:23,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:50:23,760 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-07-13 21:50:23,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:50:23,955 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:50:23,972 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-07-13 21:50:24,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:50:24,043 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:50:24,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:24 WrapperNode [2022-07-13 21:50:24,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:50:24,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:50:24,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:50:24,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:50:24,050 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:50:24" (1/1) ... [2022-07-13 21:50:24,073 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:50:24" (1/1) ... [2022-07-13 21:50:24,104 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-07-13 21:50:24,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:50:24,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:50:24,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:50:24,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:50:24,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:24" (1/1) ... [2022-07-13 21:50:24,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:24" (1/1) ... [2022-07-13 21:50:24,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:24" (1/1) ... [2022-07-13 21:50:24,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:24" (1/1) ... [2022-07-13 21:50:24,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:24" (1/1) ... [2022-07-13 21:50:24,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:24" (1/1) ... [2022-07-13 21:50:24,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:24" (1/1) ... [2022-07-13 21:50:24,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:50:24,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:50:24,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:50:24,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:50:24,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:24" (1/1) ... [2022-07-13 21:50:24,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:50:24,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:50:24,206 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:50:24,226 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:50:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:50:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 21:50:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:50:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:50:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:50:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-13 21:50:24,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-13 21:50:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-13 21:50:24,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-13 21:50:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-13 21:50:24,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-13 21:50:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:50:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 21:50:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:50:24,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:50:24,245 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:50:24,325 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:50:24,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:50:24,676 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:50:24,899 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:50:24,899 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 21:50:24,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:50:24 BoogieIcfgContainer [2022-07-13 21:50:24,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:50:24,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:50:24,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:50:24,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:50:24,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:50:23" (1/3) ... [2022-07-13 21:50:24,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7024c8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:50:24, skipping insertion in model container [2022-07-13 21:50:24,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:24" (2/3) ... [2022-07-13 21:50:24,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7024c8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:50:24, skipping insertion in model container [2022-07-13 21:50:24,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:50:24" (3/3) ... [2022-07-13 21:50:24,906 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-07-13 21:50:24,909 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:50:24,915 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:50:24,916 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:50:24,916 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:50:24,947 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-13 21:50:24,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-07-13 21:50:25,053 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-07-13 21:50:25,053 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:50:25,056 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 73. Up to 2 conditions per place. [2022-07-13 21:50:25,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-07-13 21:50:25,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-07-13 21:50:25,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:50:25,078 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@76ad4d63, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d9cf672 [2022-07-13 21:50:25,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-13 21:50:25,085 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2022-07-13 21:50:25,085 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:50:25,085 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:25,086 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] [2022-07-13 21:50:25,086 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1982469961, now seen corresponding path program 1 times [2022-07-13 21:50:25,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:25,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208508634] [2022-07-13 21:50:25,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:25,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:25,351 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:50:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:25,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208508634] [2022-07-13 21:50:25,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208508634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:25,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:25,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:50:25,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728166194] [2022-07-13 21:50:25,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:25,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:50:25,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:25,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:50:25,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:50:25,401 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113 [2022-07-13 21:50:25,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:50:25,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:25,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113 [2022-07-13 21:50:25,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:25,695 INFO L129 PetriNetUnfolder]: 58/486 cut-off events. [2022-07-13 21:50:25,696 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-13 21:50:25,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 486 events. 58/486 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2507 event pairs, 44 based on Foata normal form. 15/471 useless extension candidates. Maximal degree in co-relation 565. Up to 79 conditions per place. [2022-07-13 21:50:25,703 INFO L132 encePairwiseOnDemand]: 108/113 looper letters, 14 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-07-13 21:50:25,703 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 112 transitions, 271 flow [2022-07-13 21:50:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:50:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:50:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-07-13 21:50:25,730 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2022-07-13 21:50:25,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2022-07-13 21:50:25,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2022-07-13 21:50:25,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:25,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2022-07-13 21:50:25,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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:50:25,764 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:50:25,765 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:50:25,766 INFO L186 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 318 transitions. [2022-07-13 21:50:25,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 112 transitions, 271 flow [2022-07-13 21:50:25,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-13 21:50:25,772 INFO L242 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-07-13 21:50:25,774 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:50:25,777 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-07-13 21:50:25,777 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-07-13 21:50:25,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:50:25,777 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:25,778 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] [2022-07-13 21:50:25,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:50:25,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2004174537, now seen corresponding path program 1 times [2022-07-13 21:50:25,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:25,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222883236] [2022-07-13 21:50:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:26,117 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:50:26,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:26,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222883236] [2022-07-13 21:50:26,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222883236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:26,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:26,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 21:50:26,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357591289] [2022-07-13 21:50:26,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:26,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:50:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:50:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:50:26,120 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-13 21:50:26,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 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:50:26,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:26,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-13 21:50:26,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:26,495 INFO L129 PetriNetUnfolder]: 369/1236 cut-off events. [2022-07-13 21:50:26,495 INFO L130 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-07-13 21:50:26,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 1236 events. 369/1236 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8538 event pairs, 100 based on Foata normal form. 0/1202 useless extension candidates. Maximal degree in co-relation 1887. Up to 352 conditions per place. [2022-07-13 21:50:26,501 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 21 selfloop transitions, 10 changer transitions 59/165 dead transitions. [2022-07-13 21:50:26,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 165 transitions, 520 flow [2022-07-13 21:50:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:50:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-13 21:50:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1417 transitions. [2022-07-13 21:50:26,504 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8359882005899705 [2022-07-13 21:50:26,505 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1417 transitions. [2022-07-13 21:50:26,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1417 transitions. [2022-07-13 21:50:26,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:26,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1417 transitions. [2022-07-13 21:50:26,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 94.46666666666667) internal successors, (1417), 15 states have internal predecessors, (1417), 0 states have call successors, (0), 0 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:50:26,510 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:50:26,511 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:50:26,511 INFO L186 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 15 states and 1417 transitions. [2022-07-13 21:50:26,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 165 transitions, 520 flow [2022-07-13 21:50:26,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 165 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:50:26,514 INFO L242 Difference]: Finished difference. Result has 138 places, 100 transitions, 278 flow [2022-07-13 21:50:26,514 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=278, PETRI_PLACES=138, PETRI_TRANSITIONS=100} [2022-07-13 21:50:26,515 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 20 predicate places. [2022-07-13 21:50:26,515 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 100 transitions, 278 flow [2022-07-13 21:50:26,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 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:50:26,516 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:26,516 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:50:26,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:50:26,516 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash -641825364, now seen corresponding path program 1 times [2022-07-13 21:50:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:26,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321988753] [2022-07-13 21:50:26,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:26,621 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:50:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:26,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321988753] [2022-07-13 21:50:26,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321988753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:26,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:26,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:50:26,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144353527] [2022-07-13 21:50:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:26,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:50:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:26,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:50:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:50:26,623 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-13 21:50:26,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 100 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 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:50:26,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:26,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-13 21:50:26,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:26,895 INFO L129 PetriNetUnfolder]: 513/1195 cut-off events. [2022-07-13 21:50:26,896 INFO L130 PetriNetUnfolder]: For 1808/1816 co-relation queries the response was YES. [2022-07-13 21:50:26,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 1195 events. 513/1195 cut-off events. For 1808/1816 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7204 event pairs, 161 based on Foata normal form. 24/1166 useless extension candidates. Maximal degree in co-relation 3137. Up to 528 conditions per place. [2022-07-13 21:50:26,903 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 26 selfloop transitions, 3 changer transitions 37/145 dead transitions. [2022-07-13 21:50:26,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 145 transitions, 622 flow [2022-07-13 21:50:26,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:50:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:50:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 882 transitions. [2022-07-13 21:50:26,905 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8672566371681416 [2022-07-13 21:50:26,905 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 882 transitions. [2022-07-13 21:50:26,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 882 transitions. [2022-07-13 21:50:26,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:26,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 882 transitions. [2022-07-13 21:50:26,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 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:50:26,909 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:50:26,909 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:50:26,909 INFO L186 Difference]: Start difference. First operand has 138 places, 100 transitions, 278 flow. Second operand 9 states and 882 transitions. [2022-07-13 21:50:26,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 145 transitions, 622 flow [2022-07-13 21:50:26,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 145 transitions, 604 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-13 21:50:26,916 INFO L242 Difference]: Finished difference. Result has 127 places, 102 transitions, 311 flow [2022-07-13 21:50:26,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=311, PETRI_PLACES=127, PETRI_TRANSITIONS=102} [2022-07-13 21:50:26,916 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 9 predicate places. [2022-07-13 21:50:26,917 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 102 transitions, 311 flow [2022-07-13 21:50:26,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 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:50:26,917 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:26,917 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:50:26,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:50:26,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:26,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:26,918 INFO L85 PathProgramCache]: Analyzing trace with hash -469615416, now seen corresponding path program 1 times [2022-07-13 21:50:26,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:26,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174270237] [2022-07-13 21:50:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:26,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:27,005 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:50:27,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:27,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174270237] [2022-07-13 21:50:27,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174270237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:27,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:27,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:50:27,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783746236] [2022-07-13 21:50:27,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:27,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:50:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:27,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:50:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:50:27,008 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-13 21:50:27,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 102 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:50:27,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:27,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-13 21:50:27,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:27,288 INFO L129 PetriNetUnfolder]: 537/1257 cut-off events. [2022-07-13 21:50:27,288 INFO L130 PetriNetUnfolder]: For 2844/2856 co-relation queries the response was YES. [2022-07-13 21:50:27,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3730 conditions, 1257 events. 537/1257 cut-off events. For 2844/2856 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7546 event pairs, 209 based on Foata normal form. 13/1189 useless extension candidates. Maximal degree in co-relation 3661. Up to 691 conditions per place. [2022-07-13 21:50:27,298 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 24 selfloop transitions, 3 changer transitions 25/133 dead transitions. [2022-07-13 21:50:27,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 133 transitions, 530 flow [2022-07-13 21:50:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:50:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:50:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2022-07-13 21:50:27,300 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8544739429695182 [2022-07-13 21:50:27,300 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2022-07-13 21:50:27,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2022-07-13 21:50:27,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:27,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2022-07-13 21:50:27,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 0 states have call successors, (0), 0 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:50:27,303 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:50:27,303 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:50:27,303 INFO L186 Difference]: Start difference. First operand has 127 places, 102 transitions, 311 flow. Second operand 9 states and 869 transitions. [2022-07-13 21:50:27,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 133 transitions, 530 flow [2022-07-13 21:50:27,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 513 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-07-13 21:50:27,309 INFO L242 Difference]: Finished difference. Result has 132 places, 104 transitions, 345 flow [2022-07-13 21:50:27,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=345, PETRI_PLACES=132, PETRI_TRANSITIONS=104} [2022-07-13 21:50:27,310 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2022-07-13 21:50:27,310 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 104 transitions, 345 flow [2022-07-13 21:50:27,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:50:27,310 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:27,311 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:50:27,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:50:27,311 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash 990989051, now seen corresponding path program 1 times [2022-07-13 21:50:27,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:27,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445300546] [2022-07-13 21:50:27,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:27,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:27,399 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:50:27,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:27,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445300546] [2022-07-13 21:50:27,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445300546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:27,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:27,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:50:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884396991] [2022-07-13 21:50:27,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:27,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:50:27,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:27,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:50:27,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:50:27,401 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-13 21:50:27,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 104 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:50:27,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:27,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-13 21:50:27,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:27,808 INFO L129 PetriNetUnfolder]: 829/1930 cut-off events. [2022-07-13 21:50:27,808 INFO L130 PetriNetUnfolder]: For 6940/6969 co-relation queries the response was YES. [2022-07-13 21:50:27,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6613 conditions, 1930 events. 829/1930 cut-off events. For 6940/6969 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13632 event pairs, 150 based on Foata normal form. 38/1878 useless extension candidates. Maximal degree in co-relation 6539. Up to 526 conditions per place. [2022-07-13 21:50:27,821 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 34 selfloop transitions, 3 changer transitions 34/152 dead transitions. [2022-07-13 21:50:27,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 152 transitions, 826 flow [2022-07-13 21:50:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:50:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:50:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 883 transitions. [2022-07-13 21:50:27,824 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8682399213372665 [2022-07-13 21:50:27,824 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 883 transitions. [2022-07-13 21:50:27,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 883 transitions. [2022-07-13 21:50:27,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:27,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 883 transitions. [2022-07-13 21:50:27,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.11111111111111) internal successors, (883), 9 states have internal predecessors, (883), 0 states have call successors, (0), 0 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:50:27,827 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:50:27,827 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:50:27,827 INFO L186 Difference]: Start difference. First operand has 132 places, 104 transitions, 345 flow. Second operand 9 states and 883 transitions. [2022-07-13 21:50:27,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 152 transitions, 826 flow [2022-07-13 21:50:27,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 152 transitions, 795 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-07-13 21:50:27,837 INFO L242 Difference]: Finished difference. Result has 137 places, 104 transitions, 357 flow [2022-07-13 21:50:27,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=357, PETRI_PLACES=137, PETRI_TRANSITIONS=104} [2022-07-13 21:50:27,838 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 19 predicate places. [2022-07-13 21:50:27,838 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 104 transitions, 357 flow [2022-07-13 21:50:27,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:50:27,838 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:27,838 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:50:27,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:50:27,839 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:27,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash -937336573, now seen corresponding path program 1 times [2022-07-13 21:50:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:27,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730105386] [2022-07-13 21:50:27,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:27,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:27,977 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:50:27,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:27,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730105386] [2022-07-13 21:50:27,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730105386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:27,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:27,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 21:50:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616957881] [2022-07-13 21:50:27,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:27,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:50:27,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:27,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:50:27,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:50:27,980 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-13 21:50:27,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 104 transitions, 357 flow. Second operand has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 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:50:27,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:27,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-13 21:50:27,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:28,416 INFO L129 PetriNetUnfolder]: 718/1665 cut-off events. [2022-07-13 21:50:28,416 INFO L130 PetriNetUnfolder]: For 8380/8469 co-relation queries the response was YES. [2022-07-13 21:50:28,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6241 conditions, 1665 events. 718/1665 cut-off events. For 8380/8469 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11019 event pairs, 282 based on Foata normal form. 41/1599 useless extension candidates. Maximal degree in co-relation 6160. Up to 629 conditions per place. [2022-07-13 21:50:28,429 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 33 selfloop transitions, 11 changer transitions 25/148 dead transitions. [2022-07-13 21:50:28,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 148 transitions, 801 flow [2022-07-13 21:50:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:50:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-13 21:50:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1133 transitions. [2022-07-13 21:50:28,432 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8355457227138643 [2022-07-13 21:50:28,432 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1133 transitions. [2022-07-13 21:50:28,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1133 transitions. [2022-07-13 21:50:28,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:28,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1133 transitions. [2022-07-13 21:50:28,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.41666666666667) internal successors, (1133), 12 states have internal predecessors, (1133), 0 states have call successors, (0), 0 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:50:28,436 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:50:28,436 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:50:28,436 INFO L186 Difference]: Start difference. First operand has 137 places, 104 transitions, 357 flow. Second operand 12 states and 1133 transitions. [2022-07-13 21:50:28,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 148 transitions, 801 flow [2022-07-13 21:50:28,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 148 transitions, 740 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-07-13 21:50:28,452 INFO L242 Difference]: Finished difference. Result has 143 places, 109 transitions, 416 flow [2022-07-13 21:50:28,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=416, PETRI_PLACES=143, PETRI_TRANSITIONS=109} [2022-07-13 21:50:28,452 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2022-07-13 21:50:28,453 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 109 transitions, 416 flow [2022-07-13 21:50:28,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 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:50:28,453 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:28,453 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:50:28,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:50:28,453 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:28,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1634399701, now seen corresponding path program 2 times [2022-07-13 21:50:28,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:28,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620008498] [2022-07-13 21:50:28,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:28,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:28,610 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:50:28,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:28,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620008498] [2022-07-13 21:50:28,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620008498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:28,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:28,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 21:50:28,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251012375] [2022-07-13 21:50:28,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:28,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 21:50:28,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:28,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 21:50:28,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:50:28,612 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-07-13 21:50:28,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 109 transitions, 416 flow. Second operand has 11 states, 11 states have (on average 89.45454545454545) internal successors, (984), 11 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:50:28,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:28,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-07-13 21:50:28,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:29,165 INFO L129 PetriNetUnfolder]: 672/1579 cut-off events. [2022-07-13 21:50:29,165 INFO L130 PetriNetUnfolder]: For 8488/9227 co-relation queries the response was YES. [2022-07-13 21:50:29,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6533 conditions, 1579 events. 672/1579 cut-off events. For 8488/9227 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10422 event pairs, 233 based on Foata normal form. 65/1555 useless extension candidates. Maximal degree in co-relation 6446. Up to 623 conditions per place. [2022-07-13 21:50:29,177 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 39 selfloop transitions, 15 changer transitions 38/170 dead transitions. [2022-07-13 21:50:29,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 170 transitions, 1124 flow [2022-07-13 21:50:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 21:50:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-13 21:50:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1583 transitions. [2022-07-13 21:50:29,181 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8240499739718896 [2022-07-13 21:50:29,181 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1583 transitions. [2022-07-13 21:50:29,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1583 transitions. [2022-07-13 21:50:29,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:29,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1583 transitions. [2022-07-13 21:50:29,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 93.11764705882354) internal successors, (1583), 17 states have internal predecessors, (1583), 0 states have call successors, (0), 0 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:50:29,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 113.0) internal successors, (2034), 18 states have internal predecessors, (2034), 0 states have call successors, (0), 0 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:50:29,187 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 113.0) internal successors, (2034), 18 states have internal predecessors, (2034), 0 states have call successors, (0), 0 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:50:29,187 INFO L186 Difference]: Start difference. First operand has 143 places, 109 transitions, 416 flow. Second operand 17 states and 1583 transitions. [2022-07-13 21:50:29,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 170 transitions, 1124 flow [2022-07-13 21:50:29,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 170 transitions, 1032 flow, removed 38 selfloop flow, removed 9 redundant places. [2022-07-13 21:50:29,197 INFO L242 Difference]: Finished difference. Result has 155 places, 113 transitions, 507 flow [2022-07-13 21:50:29,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=507, PETRI_PLACES=155, PETRI_TRANSITIONS=113} [2022-07-13 21:50:29,198 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 37 predicate places. [2022-07-13 21:50:29,199 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 113 transitions, 507 flow [2022-07-13 21:50:29,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.45454545454545) internal successors, (984), 11 states have internal predecessors, (984), 0 states have call successors, (0), 0 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:50:29,199 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:29,199 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:50:29,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:50:29,200 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:29,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1475487077, now seen corresponding path program 1 times [2022-07-13 21:50:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:29,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671621217] [2022-07-13 21:50:29,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:29,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:29,301 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:50:29,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:29,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671621217] [2022-07-13 21:50:29,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671621217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:29,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:29,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:50:29,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260732037] [2022-07-13 21:50:29,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:29,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:50:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:29,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:50:29,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:50:29,304 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-13 21:50:29,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 113 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 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:50:29,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:29,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-13 21:50:29,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:29,722 INFO L129 PetriNetUnfolder]: 948/2326 cut-off events. [2022-07-13 21:50:29,723 INFO L130 PetriNetUnfolder]: For 20252/21253 co-relation queries the response was YES. [2022-07-13 21:50:29,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11587 conditions, 2326 events. 948/2326 cut-off events. For 20252/21253 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17806 event pairs, 271 based on Foata normal form. 65/2255 useless extension candidates. Maximal degree in co-relation 11497. Up to 709 conditions per place. [2022-07-13 21:50:29,742 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 39 selfloop transitions, 3 changer transitions 29/153 dead transitions. [2022-07-13 21:50:29,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 1089 flow [2022-07-13 21:50:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:50:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:50:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 877 transitions. [2022-07-13 21:50:29,745 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8623402163225172 [2022-07-13 21:50:29,745 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 877 transitions. [2022-07-13 21:50:29,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 877 transitions. [2022-07-13 21:50:29,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:29,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 877 transitions. [2022-07-13 21:50:29,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 0 states have call successors, (0), 0 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:50:29,748 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:50:29,749 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:50:29,749 INFO L186 Difference]: Start difference. First operand has 155 places, 113 transitions, 507 flow. Second operand 9 states and 877 transitions. [2022-07-13 21:50:29,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 1089 flow [2022-07-13 21:50:29,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 153 transitions, 1023 flow, removed 27 selfloop flow, removed 10 redundant places. [2022-07-13 21:50:29,768 INFO L242 Difference]: Finished difference. Result has 151 places, 113 transitions, 498 flow [2022-07-13 21:50:29,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=498, PETRI_PLACES=151, PETRI_TRANSITIONS=113} [2022-07-13 21:50:29,769 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 33 predicate places. [2022-07-13 21:50:29,769 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 113 transitions, 498 flow [2022-07-13 21:50:29,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 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:50:29,772 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:29,772 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:50:29,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:50:29,772 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1136446740, now seen corresponding path program 1 times [2022-07-13 21:50:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:29,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944385345] [2022-07-13 21:50:29,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:30,034 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:50:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:30,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944385345] [2022-07-13 21:50:30,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944385345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:30,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:30,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 21:50:30,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363925391] [2022-07-13 21:50:30,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:30,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 21:50:30,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:30,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 21:50:30,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-13 21:50:30,037 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-07-13 21:50:30,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 113 transitions, 498 flow. Second operand has 13 states, 13 states have (on average 88.3076923076923) internal successors, (1148), 13 states have internal predecessors, (1148), 0 states have call successors, (0), 0 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:50:30,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:30,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-07-13 21:50:30,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:30,606 INFO L129 PetriNetUnfolder]: 602/1580 cut-off events. [2022-07-13 21:50:30,606 INFO L130 PetriNetUnfolder]: For 12665/13204 co-relation queries the response was YES. [2022-07-13 21:50:30,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7572 conditions, 1580 events. 602/1580 cut-off events. For 12665/13204 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10870 event pairs, 344 based on Foata normal form. 28/1475 useless extension candidates. Maximal degree in co-relation 7479. Up to 810 conditions per place. [2022-07-13 21:50:30,624 INFO L132 encePairwiseOnDemand]: 100/113 looper letters, 30 selfloop transitions, 14 changer transitions 41/162 dead transitions. [2022-07-13 21:50:30,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 162 transitions, 1156 flow [2022-07-13 21:50:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 21:50:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-13 21:50:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1637 transitions. [2022-07-13 21:50:30,628 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8048180924287119 [2022-07-13 21:50:30,628 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1637 transitions. [2022-07-13 21:50:30,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1637 transitions. [2022-07-13 21:50:30,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:30,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1637 transitions. [2022-07-13 21:50:30,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 90.94444444444444) internal successors, (1637), 18 states have internal predecessors, (1637), 0 states have call successors, (0), 0 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:50:30,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 0 states have call successors, (0), 0 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:50:30,635 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 0 states have call successors, (0), 0 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:50:30,635 INFO L186 Difference]: Start difference. First operand has 151 places, 113 transitions, 498 flow. Second operand 18 states and 1637 transitions. [2022-07-13 21:50:30,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 162 transitions, 1156 flow [2022-07-13 21:50:30,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 162 transitions, 1085 flow, removed 34 selfloop flow, removed 7 redundant places. [2022-07-13 21:50:30,653 INFO L242 Difference]: Finished difference. Result has 166 places, 115 transitions, 562 flow [2022-07-13 21:50:30,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=562, PETRI_PLACES=166, PETRI_TRANSITIONS=115} [2022-07-13 21:50:30,655 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 48 predicate places. [2022-07-13 21:50:30,655 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 115 transitions, 562 flow [2022-07-13 21:50:30,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.3076923076923) internal successors, (1148), 13 states have internal predecessors, (1148), 0 states have call successors, (0), 0 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:50:30,655 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:30,655 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:50:30,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:50:30,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1341308941, now seen corresponding path program 1 times [2022-07-13 21:50:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:30,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769756763] [2022-07-13 21:50:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:30,818 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:50:30,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:30,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769756763] [2022-07-13 21:50:30,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769756763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:30,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:30,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:50:30,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690065026] [2022-07-13 21:50:30,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:30,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:50:30,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:30,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:50:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:50:30,824 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-13 21:50:30,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 115 transitions, 562 flow. Second operand has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 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:50:30,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:30,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-13 21:50:30,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:31,389 INFO L129 PetriNetUnfolder]: 764/1997 cut-off events. [2022-07-13 21:50:31,389 INFO L130 PetriNetUnfolder]: For 25595/26910 co-relation queries the response was YES. [2022-07-13 21:50:31,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11349 conditions, 1997 events. 764/1997 cut-off events. For 25595/26910 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15483 event pairs, 190 based on Foata normal form. 98/1950 useless extension candidates. Maximal degree in co-relation 11247. Up to 610 conditions per place. [2022-07-13 21:50:31,405 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 32 selfloop transitions, 16 changer transitions 27/154 dead transitions. [2022-07-13 21:50:31,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 154 transitions, 1222 flow [2022-07-13 21:50:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:50:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-13 21:50:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1309 transitions. [2022-07-13 21:50:31,408 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.827433628318584 [2022-07-13 21:50:31,408 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1309 transitions. [2022-07-13 21:50:31,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1309 transitions. [2022-07-13 21:50:31,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:31,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1309 transitions. [2022-07-13 21:50:31,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.5) internal successors, (1309), 14 states have internal predecessors, (1309), 0 states have call successors, (0), 0 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:50:31,413 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:50:31,413 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:50:31,413 INFO L186 Difference]: Start difference. First operand has 166 places, 115 transitions, 562 flow. Second operand 14 states and 1309 transitions. [2022-07-13 21:50:31,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 154 transitions, 1222 flow [2022-07-13 21:50:31,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 154 transitions, 1116 flow, removed 42 selfloop flow, removed 16 redundant places. [2022-07-13 21:50:31,443 INFO L242 Difference]: Finished difference. Result has 161 places, 118 transitions, 621 flow [2022-07-13 21:50:31,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=621, PETRI_PLACES=161, PETRI_TRANSITIONS=118} [2022-07-13 21:50:31,444 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 43 predicate places. [2022-07-13 21:50:31,444 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 118 transitions, 621 flow [2022-07-13 21:50:31,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 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:50:31,444 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:31,444 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:50:31,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:50:31,445 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1583325092, now seen corresponding path program 1 times [2022-07-13 21:50:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:31,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357927259] [2022-07-13 21:50:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:31,501 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:50:31,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:31,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357927259] [2022-07-13 21:50:31,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357927259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:31,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:31,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:50:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529317298] [2022-07-13 21:50:31,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:31,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:50:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:31,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:50:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:50:31,504 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-13 21:50:31,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 118 transitions, 621 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:50:31,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:31,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-13 21:50:31,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:32,632 INFO L129 PetriNetUnfolder]: 3998/7295 cut-off events. [2022-07-13 21:50:32,632 INFO L130 PetriNetUnfolder]: For 121578/123034 co-relation queries the response was YES. [2022-07-13 21:50:32,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38967 conditions, 7295 events. 3998/7295 cut-off events. For 121578/123034 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 56222 event pairs, 240 based on Foata normal form. 427/7316 useless extension candidates. Maximal degree in co-relation 38873. Up to 2323 conditions per place. [2022-07-13 21:50:32,673 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 55 selfloop transitions, 6 changer transitions 93/236 dead transitions. [2022-07-13 21:50:32,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 236 transitions, 2240 flow [2022-07-13 21:50:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:50:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:50:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 972 transitions. [2022-07-13 21:50:32,675 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8601769911504424 [2022-07-13 21:50:32,675 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 972 transitions. [2022-07-13 21:50:32,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 972 transitions. [2022-07-13 21:50:32,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:32,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 972 transitions. [2022-07-13 21:50:32,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.2) internal successors, (972), 10 states have internal predecessors, (972), 0 states have call successors, (0), 0 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:50:32,678 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:50:32,679 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:50:32,679 INFO L186 Difference]: Start difference. First operand has 161 places, 118 transitions, 621 flow. Second operand 10 states and 972 transitions. [2022-07-13 21:50:32,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 236 transitions, 2240 flow [2022-07-13 21:50:32,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 236 transitions, 1977 flow, removed 95 selfloop flow, removed 12 redundant places. [2022-07-13 21:50:32,758 INFO L242 Difference]: Finished difference. Result has 158 places, 118 transitions, 598 flow [2022-07-13 21:50:32,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=598, PETRI_PLACES=158, PETRI_TRANSITIONS=118} [2022-07-13 21:50:32,759 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2022-07-13 21:50:32,759 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 118 transitions, 598 flow [2022-07-13 21:50:32,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:50:32,760 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:32,760 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] [2022-07-13 21:50:32,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:50:32,760 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:32,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash 633851726, now seen corresponding path program 1 times [2022-07-13 21:50:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:32,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384997868] [2022-07-13 21:50:32,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:32,841 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:50:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:32,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384997868] [2022-07-13 21:50:32,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384997868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:32,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:32,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:50:32,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997434591] [2022-07-13 21:50:32,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:32,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:50:32,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:32,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:50:32,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:50:32,844 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-13 21:50:32,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 118 transitions, 598 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:50:32,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:32,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-13 21:50:32,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:33,401 INFO L129 PetriNetUnfolder]: 1288/2841 cut-off events. [2022-07-13 21:50:33,401 INFO L130 PetriNetUnfolder]: For 35311/35725 co-relation queries the response was YES. [2022-07-13 21:50:33,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14793 conditions, 2841 events. 1288/2841 cut-off events. For 35311/35725 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 21301 event pairs, 31 based on Foata normal form. 251/3022 useless extension candidates. Maximal degree in co-relation 14701. Up to 790 conditions per place. [2022-07-13 21:50:33,421 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 52 selfloop transitions, 9 changer transitions 58/201 dead transitions. [2022-07-13 21:50:33,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 201 transitions, 1802 flow [2022-07-13 21:50:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:50:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:50:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 970 transitions. [2022-07-13 21:50:33,423 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8584070796460177 [2022-07-13 21:50:33,423 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 970 transitions. [2022-07-13 21:50:33,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 970 transitions. [2022-07-13 21:50:33,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:33,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 970 transitions. [2022-07-13 21:50:33,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 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:50:33,427 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:50:33,427 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:50:33,427 INFO L186 Difference]: Start difference. First operand has 158 places, 118 transitions, 598 flow. Second operand 10 states and 970 transitions. [2022-07-13 21:50:33,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 201 transitions, 1802 flow [2022-07-13 21:50:33,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 201 transitions, 1689 flow, removed 26 selfloop flow, removed 9 redundant places. [2022-07-13 21:50:33,458 INFO L242 Difference]: Finished difference. Result has 158 places, 119 transitions, 621 flow [2022-07-13 21:50:33,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=621, PETRI_PLACES=158, PETRI_TRANSITIONS=119} [2022-07-13 21:50:33,459 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2022-07-13 21:50:33,459 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 119 transitions, 621 flow [2022-07-13 21:50:33,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:50:33,460 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:33,460 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] [2022-07-13 21:50:33,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 21:50:33,460 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:33,460 INFO L85 PathProgramCache]: Analyzing trace with hash 367883124, now seen corresponding path program 1 times [2022-07-13 21:50:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:33,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5211897] [2022-07-13 21:50:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:33,570 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:50:33,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:33,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5211897] [2022-07-13 21:50:33,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5211897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:33,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:33,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:50:33,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423257937] [2022-07-13 21:50:33,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:33,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:50:33,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:33,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:50:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:50:33,576 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-13 21:50:33,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 119 transitions, 621 flow. Second operand has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 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:50:33,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:33,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-13 21:50:33,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:33,865 INFO L129 PetriNetUnfolder]: 389/1151 cut-off events. [2022-07-13 21:50:33,865 INFO L130 PetriNetUnfolder]: For 10743/10946 co-relation queries the response was YES. [2022-07-13 21:50:33,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5735 conditions, 1151 events. 389/1151 cut-off events. For 10743/10946 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7844 event pairs, 17 based on Foata normal form. 58/1187 useless extension candidates. Maximal degree in co-relation 5642. Up to 271 conditions per place. [2022-07-13 21:50:33,871 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 33 selfloop transitions, 12 changer transitions 39/164 dead transitions. [2022-07-13 21:50:33,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 164 transitions, 1314 flow [2022-07-13 21:50:33,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:50:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-13 21:50:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1038 transitions. [2022-07-13 21:50:33,873 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.835076427996782 [2022-07-13 21:50:33,873 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1038 transitions. [2022-07-13 21:50:33,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1038 transitions. [2022-07-13 21:50:33,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:33,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1038 transitions. [2022-07-13 21:50:33,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.36363636363636) internal successors, (1038), 11 states have internal predecessors, (1038), 0 states have call successors, (0), 0 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:50:33,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 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:50:33,876 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 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:50:33,876 INFO L186 Difference]: Start difference. First operand has 158 places, 119 transitions, 621 flow. Second operand 11 states and 1038 transitions. [2022-07-13 21:50:33,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 164 transitions, 1314 flow [2022-07-13 21:50:33,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 164 transitions, 1031 flow, removed 128 selfloop flow, removed 19 redundant places. [2022-07-13 21:50:33,892 INFO L242 Difference]: Finished difference. Result has 151 places, 111 transitions, 467 flow [2022-07-13 21:50:33,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=467, PETRI_PLACES=151, PETRI_TRANSITIONS=111} [2022-07-13 21:50:33,893 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 33 predicate places. [2022-07-13 21:50:33,893 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 111 transitions, 467 flow [2022-07-13 21:50:33,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 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:50:33,893 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:33,893 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:50:33,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 21:50:33,894 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:33,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:33,894 INFO L85 PathProgramCache]: Analyzing trace with hash 682024245, now seen corresponding path program 1 times [2022-07-13 21:50:33,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:33,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749540100] [2022-07-13 21:50:33,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:34,117 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:50:34,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:34,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749540100] [2022-07-13 21:50:34,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749540100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:34,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:34,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 21:50:34,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83582651] [2022-07-13 21:50:34,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:34,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 21:50:34,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:34,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 21:50:34,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-07-13 21:50:34,119 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113 [2022-07-13 21:50:34,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 111 transitions, 467 flow. Second operand has 14 states, 14 states have (on average 86.64285714285714) internal successors, (1213), 14 states have internal predecessors, (1213), 0 states have call successors, (0), 0 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:50:34,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:34,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113 [2022-07-13 21:50:34,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:34,457 INFO L129 PetriNetUnfolder]: 125/786 cut-off events. [2022-07-13 21:50:34,457 INFO L130 PetriNetUnfolder]: For 2584/2716 co-relation queries the response was YES. [2022-07-13 21:50:34,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 786 events. 125/786 cut-off events. For 2584/2716 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6014 event pairs, 0 based on Foata normal form. 14/780 useless extension candidates. Maximal degree in co-relation 2414. Up to 157 conditions per place. [2022-07-13 21:50:34,461 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 21 selfloop transitions, 12 changer transitions 15/126 dead transitions. [2022-07-13 21:50:34,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 126 transitions, 647 flow [2022-07-13 21:50:34,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:50:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-13 21:50:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1317 transitions. [2022-07-13 21:50:34,463 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7769911504424779 [2022-07-13 21:50:34,463 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1317 transitions. [2022-07-13 21:50:34,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1317 transitions. [2022-07-13 21:50:34,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:34,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1317 transitions. [2022-07-13 21:50:34,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 87.8) internal successors, (1317), 15 states have internal predecessors, (1317), 0 states have call successors, (0), 0 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:50:34,467 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:50:34,467 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:50:34,467 INFO L186 Difference]: Start difference. First operand has 151 places, 111 transitions, 467 flow. Second operand 15 states and 1317 transitions. [2022-07-13 21:50:34,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 126 transitions, 647 flow [2022-07-13 21:50:34,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 126 transitions, 491 flow, removed 56 selfloop flow, removed 25 redundant places. [2022-07-13 21:50:34,475 INFO L242 Difference]: Finished difference. Result has 142 places, 108 transitions, 378 flow [2022-07-13 21:50:34,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=378, PETRI_PLACES=142, PETRI_TRANSITIONS=108} [2022-07-13 21:50:34,475 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2022-07-13 21:50:34,476 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 108 transitions, 378 flow [2022-07-13 21:50:34,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.64285714285714) internal successors, (1213), 14 states have internal predecessors, (1213), 0 states have call successors, (0), 0 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:50:34,476 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:34,477 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:50:34,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 21:50:34,477 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-13 21:50:34,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash 37696987, now seen corresponding path program 2 times [2022-07-13 21:50:34,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:34,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440943222] [2022-07-13 21:50:34,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:50:34,509 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:50:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:50:34,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:50:34,559 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:50:34,560 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-13 21:50:34,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-13 21:50:34,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-13 21:50:34,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-13 21:50:34,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-13 21:50:34,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-13 21:50:34,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 21:50:34,562 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:34,566 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-13 21:50:34,566 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:50:34,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:50:34 BasicIcfg [2022-07-13 21:50:34,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:50:34,632 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:50:34,632 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:50:34,632 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:50:34,632 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:50:24" (3/4) ... [2022-07-13 21:50:34,633 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:50:34,714 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:50:34,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:50:34,714 INFO L158 Benchmark]: Toolchain (without parser) took 11100.06ms. Allocated memory was 96.5MB in the beginning and 692.1MB in the end (delta: 595.6MB). Free memory was 57.4MB in the beginning and 279.2MB in the end (delta: -221.8MB). Peak memory consumption was 375.6MB. Max. memory is 16.1GB. [2022-07-13 21:50:34,714 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 75.6MB in the beginning and 75.5MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:50:34,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.60ms. Allocated memory is still 96.5MB. Free memory was 57.2MB in the beginning and 60.7MB in the end (delta: -3.5MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2022-07-13 21:50:34,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.40ms. Allocated memory is still 96.5MB. Free memory was 60.7MB in the beginning and 57.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:50:34,731 INFO L158 Benchmark]: Boogie Preprocessor took 22.95ms. Allocated memory is still 96.5MB. Free memory was 57.8MB in the beginning and 55.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:50:34,732 INFO L158 Benchmark]: RCFGBuilder took 766.93ms. Allocated memory is still 96.5MB. Free memory was 55.7MB in the beginning and 47.1MB in the end (delta: 8.5MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2022-07-13 21:50:34,732 INFO L158 Benchmark]: TraceAbstraction took 9729.25ms. Allocated memory was 96.5MB in the beginning and 692.1MB in the end (delta: 595.6MB). Free memory was 46.6MB in the beginning and 303.4MB in the end (delta: -256.8MB). Peak memory consumption was 339.5MB. Max. memory is 16.1GB. [2022-07-13 21:50:34,732 INFO L158 Benchmark]: Witness Printer took 82.25ms. Allocated memory is still 692.1MB. Free memory was 303.4MB in the beginning and 279.2MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-13 21:50:34,733 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.17ms. Allocated memory is still 96.5MB. Free memory was 75.6MB in the beginning and 75.5MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.60ms. Allocated memory is still 96.5MB. Free memory was 57.2MB in the beginning and 60.7MB in the end (delta: -3.5MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.40ms. Allocated memory is still 96.5MB. Free memory was 60.7MB in the beginning and 57.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.95ms. Allocated memory is still 96.5MB. Free memory was 57.8MB in the beginning and 55.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 766.93ms. Allocated memory is still 96.5MB. Free memory was 55.7MB in the beginning and 47.1MB in the end (delta: 8.5MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9729.25ms. Allocated memory was 96.5MB in the beginning and 692.1MB in the end (delta: 595.6MB). Free memory was 46.6MB in the beginning and 303.4MB in the end (delta: -256.8MB). Peak memory consumption was 339.5MB. Max. memory is 16.1GB. * Witness Printer took 82.25ms. Allocated memory is still 692.1MB. Free memory was 303.4MB in the beginning and 279.2MB in the end (delta: 24.1MB). Peak memory consumption was 23.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] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2489; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 817]: 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: 819]: 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, 140 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: 9.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 733 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 610 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1064 mSDsCounter, 240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1747 IncrementalHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 240 mSolverCounterUnsat, 128 mSDtfsCounter, 1747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=621occurred in iteration=10, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1150 NumberOfCodeBlocks, 1150 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1049 ConstructedInterpolants, 0 QuantifiedInterpolants, 6103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:50:34,756 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