./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:42:40,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:42:40,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:42:41,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:42:41,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:42:41,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:42:41,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:42:41,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:42:41,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:42:41,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:42:41,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:42:41,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:42:41,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:42:41,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:42:41,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:42:41,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:42:41,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:42:41,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:42:41,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:42:41,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:42:41,068 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:42:41,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:42:41,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:42:41,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:42:41,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:42:41,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:42:41,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:42:41,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:42:41,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:42:41,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:42:41,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:42:41,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:42:41,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:42:41,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:42:41,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:42:41,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:42:41,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:42:41,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:42:41,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:42:41,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:42:41,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:42:41,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:42:41,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:42:41,122 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:42:41,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:42:41,123 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:42:41,123 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:42:41,124 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:42:41,124 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:42:41,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:42:41,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:42:41,125 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:42:41,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:42:41,126 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:42:41,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:42:41,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:42:41,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:42:41,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:42:41,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:42:41,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:42:41,128 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:42:41,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:42:41,128 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:42:41,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:42:41,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:42:41,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:42:41,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:42:41,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:42:41,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:42:41,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:42:41,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:42:41,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:42:41,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:42:41,130 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:42:41,130 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:42:41,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:42:41,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2022-07-21 08:42:41,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:42:41,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:42:41,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:42:41,449 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:42:41,450 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:42:41,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-07-21 08:42:41,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d558299d/3091bc46700d4f8595fecd835a6b7b65/FLAGbc7154c09 [2022-07-21 08:42:41,885 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:42:41,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-07-21 08:42:41,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d558299d/3091bc46700d4f8595fecd835a6b7b65/FLAGbc7154c09 [2022-07-21 08:42:42,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d558299d/3091bc46700d4f8595fecd835a6b7b65 [2022-07-21 08:42:42,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:42:42,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:42:42,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:42:42,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:42:42,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:42:42,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300df8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42, skipping insertion in model container [2022-07-21 08:42:42,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:42:42,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:42:42,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-07-21 08:42:42,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:42:42,685 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:42:42,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-07-21 08:42:42,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:42:42,806 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:42:42,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42 WrapperNode [2022-07-21 08:42:42,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:42:42,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:42:42,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:42:42,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:42:42,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,889 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-07-21 08:42:42,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:42:42,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:42:42,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:42:42,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:42:42,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:42:42,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:42:42,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:42:42,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:42:42,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42" (1/1) ... [2022-07-21 08:42:42,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:42:42,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:42:42,971 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-21 08:42:42,978 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-21 08:42:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:42:43,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-21 08:42:43,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:42:43,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:42:43,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:42:43,008 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-21 08:42:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-21 08:42:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-21 08:42:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-21 08:42:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-21 08:42:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-21 08:42:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:42:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-21 08:42:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:42:43,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:42:43,011 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 08:42:43,117 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:42:43,119 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:42:43,562 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:42:43,847 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:42:43,848 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 08:42:43,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:42:43 BoogieIcfgContainer [2022-07-21 08:42:43,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:42:43,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:42:43,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:42:43,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:42:43,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:42:42" (1/3) ... [2022-07-21 08:42:43,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265e9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:42:43, skipping insertion in model container [2022-07-21 08:42:43,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:42" (2/3) ... [2022-07-21 08:42:43,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265e9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:42:43, skipping insertion in model container [2022-07-21 08:42:43,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:42:43" (3/3) ... [2022-07-21 08:42:43,858 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-07-21 08:42:43,862 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:42:43,869 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:42:43,870 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:42:43,870 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:42:43,929 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-21 08:42:43,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-07-21 08:42:44,028 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-07-21 08:42:44,029 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:42:44,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-07-21 08:42:44,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-07-21 08:42:44,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-07-21 08:42:44,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:42:44,059 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@3516e835, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@764fc4f0 [2022-07-21 08:42:44,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-21 08:42:44,079 INFO L129 PetriNetUnfolder]: 0/73 cut-off events. [2022-07-21 08:42:44,079 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:42:44,080 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:44,080 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:44,081 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash -146856561, now seen corresponding path program 1 times [2022-07-21 08:42:44,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:44,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805670042] [2022-07-21 08:42:44,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:44,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:44,391 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-21 08:42:44,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:44,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805670042] [2022-07-21 08:42:44,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805670042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:44,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:44,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 08:42:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722757703] [2022-07-21 08:42:44,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:44,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:42:44,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:44,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:42:44,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:42:44,426 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 113 [2022-07-21 08:42:44,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:44,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:44,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 113 [2022-07-21 08:42:44,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:44,508 INFO L129 PetriNetUnfolder]: 17/242 cut-off events. [2022-07-21 08:42:44,509 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-21 08:42:44,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 242 events. 17/242 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 747 event pairs, 7 based on Foata normal form. 8/238 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2022-07-21 08:42:44,512 INFO L132 encePairwiseOnDemand]: 108/113 looper letters, 10 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2022-07-21 08:42:44,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 251 flow [2022-07-21 08:42:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:42:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:42:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-07-21 08:42:44,524 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9351032448377581 [2022-07-21 08:42:44,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-07-21 08:42:44,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-07-21 08:42:44,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:44,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-07-21 08:42:44,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:44,537 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-21 08:42:44,537 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-21 08:42:44,539 INFO L186 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 317 transitions. [2022-07-21 08:42:44,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 251 flow [2022-07-21 08:42:44,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 109 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-21 08:42:44,547 INFO L242 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-07-21 08:42:44,548 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-21 08:42:44,553 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-07-21 08:42:44,554 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-07-21 08:42:44,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:44,555 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:44,555 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:44,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:42:44,556 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:44,557 INFO L85 PathProgramCache]: Analyzing trace with hash -45666451, now seen corresponding path program 1 times [2022-07-21 08:42:44,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:44,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070154515] [2022-07-21 08:42:44,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:44,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:44,817 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-21 08:42:44,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:44,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070154515] [2022-07-21 08:42:44,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070154515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:44,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:44,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:42:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672163407] [2022-07-21 08:42:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:44,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:42:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:44,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:42:44,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:42:44,823 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2022-07-21 08:42:44,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:44,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:44,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2022-07-21 08:42:44,824 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:45,178 INFO L129 PetriNetUnfolder]: 357/1165 cut-off events. [2022-07-21 08:42:45,178 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-07-21 08:42:45,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1165 events. 357/1165 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7988 event pairs, 56 based on Foata normal form. 0/1131 useless extension candidates. Maximal degree in co-relation 1791. Up to 333 conditions per place. [2022-07-21 08:42:45,189 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 20 selfloop transitions, 3 changer transitions 48/149 dead transitions. [2022-07-21 08:42:45,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 149 transitions, 446 flow [2022-07-21 08:42:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:42:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:42:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-07-21 08:42:45,196 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8751229105211407 [2022-07-21 08:42:45,197 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2022-07-21 08:42:45,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2022-07-21 08:42:45,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:45,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2022-07-21 08:42:45,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:45,204 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-21 08:42:45,205 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-21 08:42:45,205 INFO L186 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 9 states and 890 transitions. [2022-07-21 08:42:45,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 149 transitions, 446 flow [2022-07-21 08:42:45,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 149 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:42:45,211 INFO L242 Difference]: Finished difference. Result has 128 places, 96 transitions, 237 flow [2022-07-21 08:42:45,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=128, PETRI_TRANSITIONS=96} [2022-07-21 08:42:45,212 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2022-07-21 08:42:45,212 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 96 transitions, 237 flow [2022-07-21 08:42:45,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:45,213 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:45,213 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-21 08:42:45,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:42:45,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash -806024468, now seen corresponding path program 1 times [2022-07-21 08:42:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:45,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770579603] [2022-07-21 08:42:45,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:45,479 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-21 08:42:45,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:45,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770579603] [2022-07-21 08:42:45,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770579603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:45,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:45,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:42:45,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006888159] [2022-07-21 08:42:45,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:45,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:42:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:45,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:42:45,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:42:45,484 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-21 08:42:45,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 96 transitions, 237 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:45,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:45,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-21 08:42:45,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:45,849 INFO L129 PetriNetUnfolder]: 287/690 cut-off events. [2022-07-21 08:42:45,850 INFO L130 PetriNetUnfolder]: For 642/647 co-relation queries the response was YES. [2022-07-21 08:42:45,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 690 events. 287/690 cut-off events. For 642/647 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3760 event pairs, 95 based on Foata normal form. 21/676 useless extension candidates. Maximal degree in co-relation 1575. Up to 261 conditions per place. [2022-07-21 08:42:45,858 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 16 selfloop transitions, 10 changer transitions 34/138 dead transitions. [2022-07-21 08:42:45,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 138 transitions, 471 flow [2022-07-21 08:42:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:42:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-21 08:42:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1413 transitions. [2022-07-21 08:42:45,862 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8336283185840708 [2022-07-21 08:42:45,863 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1413 transitions. [2022-07-21 08:42:45,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1413 transitions. [2022-07-21 08:42:45,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:45,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1413 transitions. [2022-07-21 08:42:45,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 94.2) internal successors, (1413), 15 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:45,871 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-21 08:42:45,872 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-21 08:42:45,872 INFO L186 Difference]: Start difference. First operand has 128 places, 96 transitions, 237 flow. Second operand 15 states and 1413 transitions. [2022-07-21 08:42:45,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 138 transitions, 471 flow [2022-07-21 08:42:45,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 138 transitions, 450 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-07-21 08:42:45,881 INFO L242 Difference]: Finished difference. Result has 131 places, 102 transitions, 314 flow [2022-07-21 08:42:45,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=314, PETRI_PLACES=131, PETRI_TRANSITIONS=102} [2022-07-21 08:42:45,884 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2022-07-21 08:42:45,884 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 102 transitions, 314 flow [2022-07-21 08:42:45,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:45,885 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:45,885 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-21 08:42:45,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:42:45,885 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:45,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:45,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1968626143, now seen corresponding path program 1 times [2022-07-21 08:42:45,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:45,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629637541] [2022-07-21 08:42:45,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:45,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:46,115 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-21 08:42:46,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:46,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629637541] [2022-07-21 08:42:46,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629637541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:46,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:46,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:42:46,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691158631] [2022-07-21 08:42:46,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:46,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:42:46,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:46,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:42:46,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:42:46,123 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-21 08:42:46,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 102 transitions, 314 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:46,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:46,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-21 08:42:46,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:46,515 INFO L129 PetriNetUnfolder]: 216/578 cut-off events. [2022-07-21 08:42:46,515 INFO L130 PetriNetUnfolder]: For 1686/1718 co-relation queries the response was YES. [2022-07-21 08:42:46,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1936 conditions, 578 events. 216/578 cut-off events. For 1686/1718 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2928 event pairs, 30 based on Foata normal form. 13/565 useless extension candidates. Maximal degree in co-relation 1863. Up to 202 conditions per place. [2022-07-21 08:42:46,523 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 26 selfloop transitions, 7 changer transitions 25/137 dead transitions. [2022-07-21 08:42:46,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 137 transitions, 670 flow [2022-07-21 08:42:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:42:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-21 08:42:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1330 transitions. [2022-07-21 08:42:46,528 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8407079646017699 [2022-07-21 08:42:46,528 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1330 transitions. [2022-07-21 08:42:46,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1330 transitions. [2022-07-21 08:42:46,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:46,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1330 transitions. [2022-07-21 08:42:46,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.0) internal successors, (1330), 14 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:46,538 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-21 08:42:46,539 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-21 08:42:46,539 INFO L186 Difference]: Start difference. First operand has 131 places, 102 transitions, 314 flow. Second operand 14 states and 1330 transitions. [2022-07-21 08:42:46,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 137 transitions, 670 flow [2022-07-21 08:42:46,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 137 transitions, 642 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-07-21 08:42:46,549 INFO L242 Difference]: Finished difference. Result has 140 places, 104 transitions, 361 flow [2022-07-21 08:42:46,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=361, PETRI_PLACES=140, PETRI_TRANSITIONS=104} [2022-07-21 08:42:46,551 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2022-07-21 08:42:46,554 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 104 transitions, 361 flow [2022-07-21 08:42:46,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:46,556 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:46,557 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-21 08:42:46,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:42:46,557 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:46,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1309432117, now seen corresponding path program 1 times [2022-07-21 08:42:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:46,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637829162] [2022-07-21 08:42:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:46,825 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-21 08:42:46,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:46,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637829162] [2022-07-21 08:42:46,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637829162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:46,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:46,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 08:42:46,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018747380] [2022-07-21 08:42:46,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:46,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 08:42:46,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:46,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 08:42:46,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-21 08:42:46,829 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-07-21 08:42:46,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 104 transitions, 361 flow. Second operand has 13 states, 13 states have (on average 89.38461538461539) internal successors, (1162), 13 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:46,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:46,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-07-21 08:42:46,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:47,156 INFO L129 PetriNetUnfolder]: 162/451 cut-off events. [2022-07-21 08:42:47,157 INFO L130 PetriNetUnfolder]: For 2135/2189 co-relation queries the response was YES. [2022-07-21 08:42:47,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 451 events. 162/451 cut-off events. For 2135/2189 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2091 event pairs, 32 based on Foata normal form. 8/432 useless extension candidates. Maximal degree in co-relation 1712. Up to 192 conditions per place. [2022-07-21 08:42:47,163 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 22 selfloop transitions, 9 changer transitions 13/120 dead transitions. [2022-07-21 08:42:47,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 120 transitions, 597 flow [2022-07-21 08:42:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:42:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-21 08:42:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1273 transitions. [2022-07-21 08:42:47,167 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.804677623261694 [2022-07-21 08:42:47,167 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1273 transitions. [2022-07-21 08:42:47,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1273 transitions. [2022-07-21 08:42:47,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:47,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1273 transitions. [2022-07-21 08:42:47,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.92857142857143) internal successors, (1273), 14 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:47,173 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-21 08:42:47,173 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-21 08:42:47,174 INFO L186 Difference]: Start difference. First operand has 140 places, 104 transitions, 361 flow. Second operand 14 states and 1273 transitions. [2022-07-21 08:42:47,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 120 transitions, 597 flow [2022-07-21 08:42:47,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 120 transitions, 544 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-07-21 08:42:47,180 INFO L242 Difference]: Finished difference. Result has 143 places, 104 transitions, 368 flow [2022-07-21 08:42:47,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=368, PETRI_PLACES=143, PETRI_TRANSITIONS=104} [2022-07-21 08:42:47,181 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2022-07-21 08:42:47,182 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 104 transitions, 368 flow [2022-07-21 08:42:47,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.38461538461539) internal successors, (1162), 13 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:47,182 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:47,183 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-21 08:42:47,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:42:47,183 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:47,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1663463146, now seen corresponding path program 1 times [2022-07-21 08:42:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:47,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385643111] [2022-07-21 08:42:47,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:47,447 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-21 08:42:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:47,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385643111] [2022-07-21 08:42:47,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385643111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:47,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:47,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:42:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760504246] [2022-07-21 08:42:47,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:47,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:42:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:47,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:42:47,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:42:47,452 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-21 08:42:47,453 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 104 transitions, 368 flow. Second operand has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:47,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:47,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-21 08:42:47,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:47,743 INFO L129 PetriNetUnfolder]: 178/519 cut-off events. [2022-07-21 08:42:47,744 INFO L130 PetriNetUnfolder]: For 2596/2633 co-relation queries the response was YES. [2022-07-21 08:42:47,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 519 events. 178/519 cut-off events. For 2596/2633 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2583 event pairs, 43 based on Foata normal form. 17/504 useless extension candidates. Maximal degree in co-relation 1912. Up to 172 conditions per place. [2022-07-21 08:42:47,749 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 19 selfloop transitions, 11 changer transitions 23/130 dead transitions. [2022-07-21 08:42:47,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 130 transitions, 682 flow [2022-07-21 08:42:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:42:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-21 08:42:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1296 transitions. [2022-07-21 08:42:47,753 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8192161820480405 [2022-07-21 08:42:47,753 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1296 transitions. [2022-07-21 08:42:47,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1296 transitions. [2022-07-21 08:42:47,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:47,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1296 transitions. [2022-07-21 08:42:47,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 92.57142857142857) internal successors, (1296), 14 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:47,759 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-21 08:42:47,760 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-21 08:42:47,760 INFO L186 Difference]: Start difference. First operand has 143 places, 104 transitions, 368 flow. Second operand 14 states and 1296 transitions. [2022-07-21 08:42:47,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 130 transitions, 682 flow [2022-07-21 08:42:47,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 130 transitions, 619 flow, removed 24 selfloop flow, removed 15 redundant places. [2022-07-21 08:42:47,766 INFO L242 Difference]: Finished difference. Result has 142 places, 105 transitions, 393 flow [2022-07-21 08:42:47,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=393, PETRI_PLACES=142, PETRI_TRANSITIONS=105} [2022-07-21 08:42:47,767 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2022-07-21 08:42:47,767 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 105 transitions, 393 flow [2022-07-21 08:42:47,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:47,768 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:47,768 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-21 08:42:47,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:42:47,769 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1865244491, now seen corresponding path program 1 times [2022-07-21 08:42:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:47,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737932849] [2022-07-21 08:42:47,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:47,935 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-21 08:42:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:47,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737932849] [2022-07-21 08:42:47,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737932849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:47,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:47,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 08:42:47,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778533287] [2022-07-21 08:42:47,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:47,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 08:42:47,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:47,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 08:42:47,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:42:47,945 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-21 08:42:47,946 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 105 transitions, 393 flow. Second operand has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:47,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:47,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-21 08:42:47,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:48,233 INFO L129 PetriNetUnfolder]: 152/462 cut-off events. [2022-07-21 08:42:48,234 INFO L130 PetriNetUnfolder]: For 2953/3002 co-relation queries the response was YES. [2022-07-21 08:42:48,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 462 events. 152/462 cut-off events. For 2953/3002 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2125 event pairs, 28 based on Foata normal form. 13/454 useless extension candidates. Maximal degree in co-relation 1901. Up to 160 conditions per place. [2022-07-21 08:42:48,240 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 23 selfloop transitions, 11 changer transitions 10/121 dead transitions. [2022-07-21 08:42:48,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 121 transitions, 649 flow [2022-07-21 08:42:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:42:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:42:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 929 transitions. [2022-07-21 08:42:48,243 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8221238938053097 [2022-07-21 08:42:48,243 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 929 transitions. [2022-07-21 08:42:48,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 929 transitions. [2022-07-21 08:42:48,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:48,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 929 transitions. [2022-07-21 08:42:48,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 92.9) internal successors, (929), 10 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:48,248 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-21 08:42:48,249 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-21 08:42:48,249 INFO L186 Difference]: Start difference. First operand has 142 places, 105 transitions, 393 flow. Second operand 10 states and 929 transitions. [2022-07-21 08:42:48,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 121 transitions, 649 flow [2022-07-21 08:42:48,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 121 transitions, 616 flow, removed 8 selfloop flow, removed 9 redundant places. [2022-07-21 08:42:48,256 INFO L242 Difference]: Finished difference. Result has 140 places, 108 transitions, 436 flow [2022-07-21 08:42:48,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=436, PETRI_PLACES=140, PETRI_TRANSITIONS=108} [2022-07-21 08:42:48,257 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2022-07-21 08:42:48,257 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 108 transitions, 436 flow [2022-07-21 08:42:48,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:48,258 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:48,258 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-21 08:42:48,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:42:48,259 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:48,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:48,259 INFO L85 PathProgramCache]: Analyzing trace with hash -833739637, now seen corresponding path program 2 times [2022-07-21 08:42:48,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:48,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506844181] [2022-07-21 08:42:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:48,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:48,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-21 08:42:48,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:48,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506844181] [2022-07-21 08:42:48,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506844181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:48,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:48,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:42:48,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864241854] [2022-07-21 08:42:48,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:48,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:42:48,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:48,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:42:48,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:42:48,402 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-21 08:42:48,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 108 transitions, 436 flow. Second operand has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:48,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:48,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-21 08:42:48,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:48,675 INFO L129 PetriNetUnfolder]: 158/465 cut-off events. [2022-07-21 08:42:48,675 INFO L130 PetriNetUnfolder]: For 3618/3845 co-relation queries the response was YES. [2022-07-21 08:42:48,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2211 conditions, 465 events. 158/465 cut-off events. For 3618/3845 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2221 event pairs, 18 based on Foata normal form. 15/457 useless extension candidates. Maximal degree in co-relation 2127. Up to 168 conditions per place. [2022-07-21 08:42:48,682 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 26 selfloop transitions, 13 changer transitions 19/136 dead transitions. [2022-07-21 08:42:48,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 136 transitions, 910 flow [2022-07-21 08:42:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:42:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-21 08:42:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1129 transitions. [2022-07-21 08:42:48,685 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8325958702064897 [2022-07-21 08:42:48,685 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1129 transitions. [2022-07-21 08:42:48,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1129 transitions. [2022-07-21 08:42:48,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:48,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1129 transitions. [2022-07-21 08:42:48,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.08333333333333) internal successors, (1129), 12 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:48,690 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-21 08:42:48,691 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-21 08:42:48,691 INFO L186 Difference]: Start difference. First operand has 140 places, 108 transitions, 436 flow. Second operand 12 states and 1129 transitions. [2022-07-21 08:42:48,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 136 transitions, 910 flow [2022-07-21 08:42:48,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 136 transitions, 761 flow, removed 63 selfloop flow, removed 11 redundant places. [2022-07-21 08:42:48,699 INFO L242 Difference]: Finished difference. Result has 145 places, 115 transitions, 500 flow [2022-07-21 08:42:48,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=500, PETRI_PLACES=145, PETRI_TRANSITIONS=115} [2022-07-21 08:42:48,700 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 27 predicate places. [2022-07-21 08:42:48,700 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 115 transitions, 500 flow [2022-07-21 08:42:48,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:48,701 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:48,701 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-21 08:42:48,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 08:42:48,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:48,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash 466697881, now seen corresponding path program 3 times [2022-07-21 08:42:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:48,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995611165] [2022-07-21 08:42:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:48,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:48,860 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-21 08:42:48,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:48,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995611165] [2022-07-21 08:42:48,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995611165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:48,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:48,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:42:48,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258328118] [2022-07-21 08:42:48,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:48,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:42:48,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:48,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:42:48,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:42:48,864 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-21 08:42:48,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 115 transitions, 500 flow. Second operand has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:48,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:48,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-21 08:42:48,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:49,207 INFO L129 PetriNetUnfolder]: 168/511 cut-off events. [2022-07-21 08:42:49,207 INFO L130 PetriNetUnfolder]: For 5356/5736 co-relation queries the response was YES. [2022-07-21 08:42:49,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 511 events. 168/511 cut-off events. For 5356/5736 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2624 event pairs, 4 based on Foata normal form. 21/508 useless extension candidates. Maximal degree in co-relation 2608. Up to 154 conditions per place. [2022-07-21 08:42:49,214 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 28 selfloop transitions, 19 changer transitions 19/144 dead transitions. [2022-07-21 08:42:49,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 1062 flow [2022-07-21 08:42:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:42:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-21 08:42:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1312 transitions. [2022-07-21 08:42:49,218 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8293299620733249 [2022-07-21 08:42:49,218 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1312 transitions. [2022-07-21 08:42:49,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1312 transitions. [2022-07-21 08:42:49,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:49,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1312 transitions. [2022-07-21 08:42:49,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.71428571428571) internal successors, (1312), 14 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:49,224 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-21 08:42:49,225 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-21 08:42:49,225 INFO L186 Difference]: Start difference. First operand has 145 places, 115 transitions, 500 flow. Second operand 14 states and 1312 transitions. [2022-07-21 08:42:49,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 1062 flow [2022-07-21 08:42:49,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 144 transitions, 1010 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-07-21 08:42:49,235 INFO L242 Difference]: Finished difference. Result has 154 places, 117 transitions, 586 flow [2022-07-21 08:42:49,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=586, PETRI_PLACES=154, PETRI_TRANSITIONS=117} [2022-07-21 08:42:49,236 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 36 predicate places. [2022-07-21 08:42:49,237 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 117 transitions, 586 flow [2022-07-21 08:42:49,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:49,237 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:49,237 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-21 08:42:49,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:42:49,238 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1636586413, now seen corresponding path program 1 times [2022-07-21 08:42:49,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:49,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309547228] [2022-07-21 08:42:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:49,435 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-21 08:42:49,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:49,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309547228] [2022-07-21 08:42:49,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309547228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:49,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:49,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 08:42:49,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669672708] [2022-07-21 08:42:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:49,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 08:42:49,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:49,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 08:42:49,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:42:49,439 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-21 08:42:49,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 117 transitions, 586 flow. Second operand has 11 states, 11 states have (on average 90.63636363636364) internal successors, (997), 11 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:49,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:49,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-21 08:42:49,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:49,731 INFO L129 PetriNetUnfolder]: 126/443 cut-off events. [2022-07-21 08:42:49,732 INFO L130 PetriNetUnfolder]: For 5724/5877 co-relation queries the response was YES. [2022-07-21 08:42:49,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 443 events. 126/443 cut-off events. For 5724/5877 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2106 event pairs, 12 based on Foata normal form. 27/445 useless extension candidates. Maximal degree in co-relation 2296. Up to 166 conditions per place. [2022-07-21 08:42:49,739 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 31 selfloop transitions, 13 changer transitions 10/131 dead transitions. [2022-07-21 08:42:49,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 131 transitions, 914 flow [2022-07-21 08:42:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 08:42:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-21 08:42:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1198 transitions. [2022-07-21 08:42:49,742 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8155207624234173 [2022-07-21 08:42:49,742 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1198 transitions. [2022-07-21 08:42:49,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1198 transitions. [2022-07-21 08:42:49,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:49,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1198 transitions. [2022-07-21 08:42:49,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.15384615384616) internal successors, (1198), 13 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:49,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:49,748 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:49,748 INFO L186 Difference]: Start difference. First operand has 154 places, 117 transitions, 586 flow. Second operand 13 states and 1198 transitions. [2022-07-21 08:42:49,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 131 transitions, 914 flow [2022-07-21 08:42:49,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 131 transitions, 792 flow, removed 55 selfloop flow, removed 14 redundant places. [2022-07-21 08:42:49,759 INFO L242 Difference]: Finished difference. Result has 153 places, 118 transitions, 596 flow [2022-07-21 08:42:49,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=596, PETRI_PLACES=153, PETRI_TRANSITIONS=118} [2022-07-21 08:42:49,760 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 35 predicate places. [2022-07-21 08:42:49,760 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 118 transitions, 596 flow [2022-07-21 08:42:49,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.63636363636364) internal successors, (997), 11 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:49,761 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:49,761 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-21 08:42:49,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:42:49,762 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1360554535, now seen corresponding path program 2 times [2022-07-21 08:42:49,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:49,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32709970] [2022-07-21 08:42:49,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:49,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:50,016 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-21 08:42:50,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:50,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32709970] [2022-07-21 08:42:50,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32709970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:50,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:50,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 08:42:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285176661] [2022-07-21 08:42:50,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:50,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 08:42:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 08:42:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-21 08:42:50,020 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-07-21 08:42:50,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 118 transitions, 596 flow. Second operand has 13 states, 13 states have (on average 89.46153846153847) internal successors, (1163), 13 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:50,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:50,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-07-21 08:42:50,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:50,309 INFO L129 PetriNetUnfolder]: 126/442 cut-off events. [2022-07-21 08:42:50,309 INFO L130 PetriNetUnfolder]: For 4440/4593 co-relation queries the response was YES. [2022-07-21 08:42:50,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 442 events. 126/442 cut-off events. For 4440/4593 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2109 event pairs, 18 based on Foata normal form. 15/432 useless extension candidates. Maximal degree in co-relation 2130. Up to 159 conditions per place. [2022-07-21 08:42:50,316 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 33 selfloop transitions, 15 changer transitions 10/134 dead transitions. [2022-07-21 08:42:50,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 134 transitions, 955 flow [2022-07-21 08:42:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:42:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-21 08:42:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1273 transitions. [2022-07-21 08:42:50,319 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.804677623261694 [2022-07-21 08:42:50,319 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1273 transitions. [2022-07-21 08:42:50,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1273 transitions. [2022-07-21 08:42:50,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:50,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1273 transitions. [2022-07-21 08:42:50,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.92857142857143) internal successors, (1273), 14 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:50,323 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-21 08:42:50,324 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-21 08:42:50,324 INFO L186 Difference]: Start difference. First operand has 153 places, 118 transitions, 596 flow. Second operand 14 states and 1273 transitions. [2022-07-21 08:42:50,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 134 transitions, 955 flow [2022-07-21 08:42:50,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 134 transitions, 861 flow, removed 36 selfloop flow, removed 11 redundant places. [2022-07-21 08:42:50,333 INFO L242 Difference]: Finished difference. Result has 156 places, 120 transitions, 652 flow [2022-07-21 08:42:50,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=652, PETRI_PLACES=156, PETRI_TRANSITIONS=120} [2022-07-21 08:42:50,334 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 38 predicate places. [2022-07-21 08:42:50,334 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 120 transitions, 652 flow [2022-07-21 08:42:50,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.46153846153847) internal successors, (1163), 13 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:50,335 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:50,335 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-21 08:42:50,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 08:42:50,335 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:50,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash 227597131, now seen corresponding path program 1 times [2022-07-21 08:42:50,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:50,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444710936] [2022-07-21 08:42:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:50,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:50,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:50,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444710936] [2022-07-21 08:42:50,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444710936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:50,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:50,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:42:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388715583] [2022-07-21 08:42:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:50,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:42:50,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:42:50,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:42:50,410 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-21 08:42:50,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 120 transitions, 652 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:50,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:50,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-21 08:42:50,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:50,857 INFO L129 PetriNetUnfolder]: 1065/2184 cut-off events. [2022-07-21 08:42:50,858 INFO L130 PetriNetUnfolder]: For 25870/26152 co-relation queries the response was YES. [2022-07-21 08:42:50,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9927 conditions, 2184 events. 1065/2184 cut-off events. For 25870/26152 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14699 event pairs, 48 based on Foata normal form. 143/2247 useless extension candidates. Maximal degree in co-relation 9839. Up to 649 conditions per place. [2022-07-21 08:42:50,889 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 122 selfloop transitions, 15 changer transitions 26/243 dead transitions. [2022-07-21 08:42:50,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 243 transitions, 2488 flow [2022-07-21 08:42:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:42:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:42:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 974 transitions. [2022-07-21 08:42:50,892 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8619469026548673 [2022-07-21 08:42:50,892 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 974 transitions. [2022-07-21 08:42:50,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 974 transitions. [2022-07-21 08:42:50,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:50,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 974 transitions. [2022-07-21 08:42:50,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.4) internal successors, (974), 10 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:50,907 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-21 08:42:50,908 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-21 08:42:50,908 INFO L186 Difference]: Start difference. First operand has 156 places, 120 transitions, 652 flow. Second operand 10 states and 974 transitions. [2022-07-21 08:42:50,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 243 transitions, 2488 flow [2022-07-21 08:42:50,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 243 transitions, 2230 flow, removed 94 selfloop flow, removed 12 redundant places. [2022-07-21 08:42:50,939 INFO L242 Difference]: Finished difference. Result has 153 places, 133 transitions, 692 flow [2022-07-21 08:42:50,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=692, PETRI_PLACES=153, PETRI_TRANSITIONS=133} [2022-07-21 08:42:50,940 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 35 predicate places. [2022-07-21 08:42:50,940 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 133 transitions, 692 flow [2022-07-21 08:42:50,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:50,940 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:50,940 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-21 08:42:50,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 08:42:50,941 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:50,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1864530944, now seen corresponding path program 1 times [2022-07-21 08:42:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:50,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664335997] [2022-07-21 08:42:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:51,120 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-21 08:42:51,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:51,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664335997] [2022-07-21 08:42:51,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664335997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:51,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:51,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 08:42:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329286757] [2022-07-21 08:42:51,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:51,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 08:42:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:51,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 08:42:51,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:42:51,123 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-07-21 08:42:51,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 133 transitions, 692 flow. Second operand has 12 states, 12 states have (on average 89.58333333333333) internal successors, (1075), 12 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:51,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:51,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-07-21 08:42:51,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:51,546 INFO L129 PetriNetUnfolder]: 232/1033 cut-off events. [2022-07-21 08:42:51,547 INFO L130 PetriNetUnfolder]: For 3963/4273 co-relation queries the response was YES. [2022-07-21 08:42:51,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3646 conditions, 1033 events. 232/1033 cut-off events. For 3963/4273 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8323 event pairs, 54 based on Foata normal form. 35/994 useless extension candidates. Maximal degree in co-relation 3555. Up to 168 conditions per place. [2022-07-21 08:42:51,561 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 40 selfloop transitions, 20 changer transitions 0/149 dead transitions. [2022-07-21 08:42:51,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 149 transitions, 982 flow [2022-07-21 08:42:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 08:42:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-21 08:42:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1186 transitions. [2022-07-21 08:42:51,563 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.807351940095303 [2022-07-21 08:42:51,563 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1186 transitions. [2022-07-21 08:42:51,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1186 transitions. [2022-07-21 08:42:51,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:51,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1186 transitions. [2022-07-21 08:42:51,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.23076923076923) internal successors, (1186), 13 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:51,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:51,568 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:51,568 INFO L186 Difference]: Start difference. First operand has 153 places, 133 transitions, 692 flow. Second operand 13 states and 1186 transitions. [2022-07-21 08:42:51,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 149 transitions, 982 flow [2022-07-21 08:42:51,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 149 transitions, 970 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-07-21 08:42:51,580 INFO L242 Difference]: Finished difference. Result has 171 places, 141 transitions, 879 flow [2022-07-21 08:42:51,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=879, PETRI_PLACES=171, PETRI_TRANSITIONS=141} [2022-07-21 08:42:51,581 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 53 predicate places. [2022-07-21 08:42:51,581 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 141 transitions, 879 flow [2022-07-21 08:42:51,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 89.58333333333333) internal successors, (1075), 12 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:51,581 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:51,582 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-21 08:42:51,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 08:42:51,582 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:51,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1924382768, now seen corresponding path program 1 times [2022-07-21 08:42:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:51,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735924189] [2022-07-21 08:42:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:51,686 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-21 08:42:51,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:51,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735924189] [2022-07-21 08:42:51,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735924189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:51,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:51,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:42:51,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109983341] [2022-07-21 08:42:51,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:51,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:42:51,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:51,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:42:51,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:42:51,690 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-21 08:42:51,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 141 transitions, 879 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:51,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:51,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-21 08:42:51,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:52,263 INFO L129 PetriNetUnfolder]: 1016/2425 cut-off events. [2022-07-21 08:42:52,264 INFO L130 PetriNetUnfolder]: For 18281/18520 co-relation queries the response was YES. [2022-07-21 08:42:52,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10796 conditions, 2425 events. 1016/2425 cut-off events. For 18281/18520 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 18873 event pairs, 30 based on Foata normal form. 184/2572 useless extension candidates. Maximal degree in co-relation 10700. Up to 513 conditions per place. [2022-07-21 08:42:52,292 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 103 selfloop transitions, 28 changer transitions 52/262 dead transitions. [2022-07-21 08:42:52,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 262 transitions, 2755 flow [2022-07-21 08:42:52,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 08:42:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-21 08:42:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1266 transitions. [2022-07-21 08:42:52,295 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8618107556160653 [2022-07-21 08:42:52,295 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1266 transitions. [2022-07-21 08:42:52,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1266 transitions. [2022-07-21 08:42:52,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:52,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1266 transitions. [2022-07-21 08:42:52,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.38461538461539) internal successors, (1266), 13 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:52,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:52,301 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:52,301 INFO L186 Difference]: Start difference. First operand has 171 places, 141 transitions, 879 flow. Second operand 13 states and 1266 transitions. [2022-07-21 08:42:52,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 262 transitions, 2755 flow [2022-07-21 08:42:52,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 262 transitions, 2387 flow, removed 103 selfloop flow, removed 12 redundant places. [2022-07-21 08:42:52,327 INFO L242 Difference]: Finished difference. Result has 177 places, 138 transitions, 794 flow [2022-07-21 08:42:52,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=794, PETRI_PLACES=177, PETRI_TRANSITIONS=138} [2022-07-21 08:42:52,328 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 59 predicate places. [2022-07-21 08:42:52,328 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 138 transitions, 794 flow [2022-07-21 08:42:52,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:52,328 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:52,329 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:52,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 08:42:52,329 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:52,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:52,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1391334937, now seen corresponding path program 1 times [2022-07-21 08:42:52,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:52,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174898464] [2022-07-21 08:42:52,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:52,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:52,403 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-21 08:42:52,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:52,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174898464] [2022-07-21 08:42:52,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174898464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:52,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:52,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:42:52,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236259570] [2022-07-21 08:42:52,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:52,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:42:52,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:52,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:42:52,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:42:52,407 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2022-07-21 08:42:52,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 138 transitions, 794 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:52,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:52,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2022-07-21 08:42:52,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:52,785 INFO L129 PetriNetUnfolder]: 356/1791 cut-off events. [2022-07-21 08:42:52,786 INFO L130 PetriNetUnfolder]: For 7118/7656 co-relation queries the response was YES. [2022-07-21 08:42:52,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6414 conditions, 1791 events. 356/1791 cut-off events. For 7118/7656 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 17761 event pairs, 22 based on Foata normal form. 32/1743 useless extension candidates. Maximal degree in co-relation 6319. Up to 393 conditions per place. [2022-07-21 08:42:52,812 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 45 selfloop transitions, 3 changer transitions 19/177 dead transitions. [2022-07-21 08:42:52,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 177 transitions, 1355 flow [2022-07-21 08:42:52,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:42:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:42:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 873 transitions. [2022-07-21 08:42:52,815 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8584070796460177 [2022-07-21 08:42:52,815 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 873 transitions. [2022-07-21 08:42:52,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 873 transitions. [2022-07-21 08:42:52,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:52,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 873 transitions. [2022-07-21 08:42:52,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:52,821 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-21 08:42:52,822 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-21 08:42:52,822 INFO L186 Difference]: Start difference. First operand has 177 places, 138 transitions, 794 flow. Second operand 9 states and 873 transitions. [2022-07-21 08:42:52,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 177 transitions, 1355 flow [2022-07-21 08:42:52,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 177 transitions, 1231 flow, removed 55 selfloop flow, removed 10 redundant places. [2022-07-21 08:42:52,863 INFO L242 Difference]: Finished difference. Result has 176 places, 138 transitions, 735 flow [2022-07-21 08:42:52,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=735, PETRI_PLACES=176, PETRI_TRANSITIONS=138} [2022-07-21 08:42:52,864 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 58 predicate places. [2022-07-21 08:42:52,864 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 138 transitions, 735 flow [2022-07-21 08:42:52,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:52,865 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:52,865 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:52,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 08:42:52,866 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:52,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash -682223534, now seen corresponding path program 1 times [2022-07-21 08:42:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:52,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145149669] [2022-07-21 08:42:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:52,966 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-21 08:42:52,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:52,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145149669] [2022-07-21 08:42:52,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145149669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:52,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:52,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:42:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871908483] [2022-07-21 08:42:52,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:52,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:42:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:42:52,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:42:52,971 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-07-21 08:42:52,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 138 transitions, 735 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:52,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:52,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-07-21 08:42:52,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:53,675 INFO L129 PetriNetUnfolder]: 1261/3074 cut-off events. [2022-07-21 08:42:53,675 INFO L130 PetriNetUnfolder]: For 15969/16173 co-relation queries the response was YES. [2022-07-21 08:42:53,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13279 conditions, 3074 events. 1261/3074 cut-off events. For 15969/16173 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 26943 event pairs, 44 based on Foata normal form. 181/3210 useless extension candidates. Maximal degree in co-relation 13231. Up to 582 conditions per place. [2022-07-21 08:42:53,698 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 41 selfloop transitions, 12 changer transitions 121/250 dead transitions. [2022-07-21 08:42:53,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 250 transitions, 2216 flow [2022-07-21 08:42:53,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 08:42:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-21 08:42:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1527 transitions. [2022-07-21 08:42:53,702 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8445796460176991 [2022-07-21 08:42:53,702 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1527 transitions. [2022-07-21 08:42:53,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1527 transitions. [2022-07-21 08:42:53,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:53,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1527 transitions. [2022-07-21 08:42:53,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.4375) internal successors, (1527), 16 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:53,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:53,708 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:53,709 INFO L186 Difference]: Start difference. First operand has 176 places, 138 transitions, 735 flow. Second operand 16 states and 1527 transitions. [2022-07-21 08:42:53,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 250 transitions, 2216 flow [2022-07-21 08:42:53,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 250 transitions, 1952 flow, removed 103 selfloop flow, removed 15 redundant places. [2022-07-21 08:42:53,772 INFO L242 Difference]: Finished difference. Result has 176 places, 109 transitions, 477 flow [2022-07-21 08:42:53,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=477, PETRI_PLACES=176, PETRI_TRANSITIONS=109} [2022-07-21 08:42:53,773 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 58 predicate places. [2022-07-21 08:42:53,775 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 109 transitions, 477 flow [2022-07-21 08:42:53,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:53,775 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:53,775 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-21 08:42:53,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 08:42:53,776 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:53,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:53,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1671477920, now seen corresponding path program 1 times [2022-07-21 08:42:53,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:53,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460879880] [2022-07-21 08:42:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:53,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:53,951 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-21 08:42:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:53,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460879880] [2022-07-21 08:42:53,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460879880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:53,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:53,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 08:42:53,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945839688] [2022-07-21 08:42:53,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:53,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 08:42:53,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 08:42:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:42:53,954 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 113 [2022-07-21 08:42:53,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 109 transitions, 477 flow. Second operand has 12 states, 12 states have (on average 87.83333333333333) internal successors, (1054), 12 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:53,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:53,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 113 [2022-07-21 08:42:53,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:54,157 INFO L129 PetriNetUnfolder]: 28/231 cut-off events. [2022-07-21 08:42:54,158 INFO L130 PetriNetUnfolder]: For 469/475 co-relation queries the response was YES. [2022-07-21 08:42:54,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 231 events. 28/231 cut-off events. For 469/475 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 710 event pairs, 0 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 595. Up to 26 conditions per place. [2022-07-21 08:42:54,160 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 19 selfloop transitions, 5 changer transitions 25/126 dead transitions. [2022-07-21 08:42:54,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 126 transitions, 681 flow [2022-07-21 08:42:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:42:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-21 08:42:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1072 transitions. [2022-07-21 08:42:54,162 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7905604719764012 [2022-07-21 08:42:54,162 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1072 transitions. [2022-07-21 08:42:54,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1072 transitions. [2022-07-21 08:42:54,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:54,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1072 transitions. [2022-07-21 08:42:54,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.33333333333333) internal successors, (1072), 12 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:54,166 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-21 08:42:54,167 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-21 08:42:54,167 INFO L186 Difference]: Start difference. First operand has 176 places, 109 transitions, 477 flow. Second operand 12 states and 1072 transitions. [2022-07-21 08:42:54,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 126 transitions, 681 flow [2022-07-21 08:42:54,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 126 transitions, 477 flow, removed 49 selfloop flow, removed 38 redundant places. [2022-07-21 08:42:54,171 INFO L242 Difference]: Finished difference. Result has 134 places, 101 transitions, 276 flow [2022-07-21 08:42:54,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=276, PETRI_PLACES=134, PETRI_TRANSITIONS=101} [2022-07-21 08:42:54,172 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2022-07-21 08:42:54,172 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 101 transitions, 276 flow [2022-07-21 08:42:54,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.83333333333333) internal successors, (1054), 12 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:54,173 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:54,173 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-21 08:42:54,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 08:42:54,173 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:42:54,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash 846745374, now seen corresponding path program 2 times [2022-07-21 08:42:54,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:54,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734803732] [2022-07-21 08:42:54,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:54,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:42:54,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:42:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:42:54,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:42:54,285 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:42:54,286 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-21 08:42:54,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-21 08:42:54,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-21 08:42:54,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-21 08:42:54,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-21 08:42:54,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-21 08:42:54,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 08:42:54,290 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:54,296 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-21 08:42:54,296 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:42:54,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:42:54 BasicIcfg [2022-07-21 08:42:54,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:42:54,416 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:42:54,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:42:54,416 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:42:54,417 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:42:43" (3/4) ... [2022-07-21 08:42:54,418 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:42:54,594 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:42:54,594 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:42:54,595 INFO L158 Benchmark]: Toolchain (without parser) took 12344.03ms. Allocated memory was 54.5MB in the beginning and 450.9MB in the end (delta: 396.4MB). Free memory was 30.4MB in the beginning and 343.7MB in the end (delta: -313.3MB). Peak memory consumption was 317.1MB. Max. memory is 16.1GB. [2022-07-21 08:42:54,596 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:42:54,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.53ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 30.1MB in the beginning and 41.1MB in the end (delta: -10.9MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-07-21 08:42:54,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.02ms. Allocated memory is still 69.2MB. Free memory was 41.0MB in the beginning and 38.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 08:42:54,597 INFO L158 Benchmark]: Boogie Preprocessor took 37.59ms. Allocated memory is still 69.2MB. Free memory was 38.0MB in the beginning and 36.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:42:54,597 INFO L158 Benchmark]: RCFGBuilder took 905.93ms. Allocated memory is still 69.2MB. Free memory was 35.8MB in the beginning and 29.5MB in the end (delta: 6.3MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-07-21 08:42:54,598 INFO L158 Benchmark]: TraceAbstraction took 10563.01ms. Allocated memory was 69.2MB in the beginning and 450.9MB in the end (delta: 381.7MB). Free memory was 29.0MB in the beginning and 132.8MB in the end (delta: -103.9MB). Peak memory consumption was 276.1MB. Max. memory is 16.1GB. [2022-07-21 08:42:54,598 INFO L158 Benchmark]: Witness Printer took 177.77ms. Allocated memory is still 450.9MB. Free memory was 132.8MB in the beginning and 343.7MB in the end (delta: -210.9MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2022-07-21 08:42:54,600 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.20ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.53ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 30.1MB in the beginning and 41.1MB in the end (delta: -10.9MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.02ms. Allocated memory is still 69.2MB. Free memory was 41.0MB in the beginning and 38.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.59ms. Allocated memory is still 69.2MB. Free memory was 38.0MB in the beginning and 36.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 905.93ms. Allocated memory is still 69.2MB. Free memory was 35.8MB in the beginning and 29.5MB in the end (delta: 6.3MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10563.01ms. Allocated memory was 69.2MB in the beginning and 450.9MB in the end (delta: 381.7MB). Free memory was 29.0MB in the beginning and 132.8MB in the end (delta: -103.9MB). Peak memory consumption was 276.1MB. Max. memory is 16.1GB. * Witness Printer took 177.77ms. Allocated memory is still 450.9MB. Free memory was 132.8MB in the beginning and 343.7MB in the end (delta: -210.9MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1492; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 756 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 756 mSDsluCounter, 802 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1157 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2056 IncrementalHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 146 mSDtfsCounter, 2056 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=879occurred in iteration=13, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1406 NumberOfCodeBlocks, 1406 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1302 ConstructedInterpolants, 0 QuantifiedInterpolants, 7912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 08:42:54,649 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