./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:51:34,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:51:34,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:51:34,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:51:34,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:51:34,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:51:34,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:51:34,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:51:34,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:51:34,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:51:34,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:51:34,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:51:34,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:51:34,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:51:34,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:51:34,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:51:34,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:51:34,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:51:34,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:51:34,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:51:34,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:51:34,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:51:34,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:51:34,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:51:34,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:51:34,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:51:34,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:51:34,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:51:34,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:51:34,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:51:34,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:51:34,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:51:34,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:51:34,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:51:34,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:51:34,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:51:34,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:51:34,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:51:34,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:51:34,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:51:34,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:51:34,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:51:34,227 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:51:34,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:51:34,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:51:34,229 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:51:34,230 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:51:34,230 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:51:34,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:51:34,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:51:34,231 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:51:34,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:51:34,232 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:51:34,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:51:34,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:51:34,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:51:34,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:51:34,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:51:34,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:51:34,233 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:51:34,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:51:34,234 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:51:34,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:51:34,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:51:34,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:51:34,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:51:34,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:51:34,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:51:34,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:51:34,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:51:34,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:51:34,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:51:34,236 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:51:34,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:51:34,237 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:51:34,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:51:34,237 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:51:34,237 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:51:34,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:51:34,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:51:34,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:51:34,559 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:51:34,559 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:51:34,560 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2023-08-30 16:51:35,747 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:51:35,971 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:51:35,972 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2023-08-30 16:51:35,988 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0809f9a59/8182b41620a8410397772e157ed48a08/FLAGa00b82f3f [2023-08-30 16:51:36,006 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0809f9a59/8182b41620a8410397772e157ed48a08 [2023-08-30 16:51:36,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:51:36,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:51:36,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:51:36,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:51:36,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:51:36,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69643f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36, skipping insertion in model container [2023-08-30 16:51:36,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:51:36,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:51:36,201 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.oepc.i[945,958] [2023-08-30 16:51:36,424 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:51:36,438 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:51:36,450 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.oepc.i[945,958] [2023-08-30 16:51:36,511 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:51:36,551 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:51:36,551 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:51:36,557 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:51:36,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36 WrapperNode [2023-08-30 16:51:36,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:51:36,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:51:36,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:51:36,560 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:51:36,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,639 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 16:51:36,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:51:36,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:51:36,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:51:36,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:51:36,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,688 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:51:36,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:51:36,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:51:36,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:51:36,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (1/1) ... [2023-08-30 16:51:36,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:51:36,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:51:36,734 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) [2023-08-30 16:51:36,756 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 [2023-08-30 16:51:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:51:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:51:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:51:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:51:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:51:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:51:36,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:51:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:51:36,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:51:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:51:36,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:51:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:51:36,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:51:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:51:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:51:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:51:36,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:51:36,774 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:51:36,970 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:51:36,973 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:51:37,298 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:51:37,454 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:51:37,454 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:51:37,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:51:37 BoogieIcfgContainer [2023-08-30 16:51:37,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:51:37,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:51:37,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:51:37,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:51:37,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:51:36" (1/3) ... [2023-08-30 16:51:37,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab9ec53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:51:37, skipping insertion in model container [2023-08-30 16:51:37,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:36" (2/3) ... [2023-08-30 16:51:37,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab9ec53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:51:37, skipping insertion in model container [2023-08-30 16:51:37,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:51:37" (3/3) ... [2023-08-30 16:51:37,466 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.oepc.i [2023-08-30 16:51:37,474 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:51:37,482 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:51:37,483 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:51:37,484 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:51:37,546 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:51:37,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-08-30 16:51:37,622 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-08-30 16:51:37,622 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:51:37,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 16:51:37,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-08-30 16:51:37,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-08-30 16:51:37,636 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:51:37,643 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-30 16:51:37,646 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-30 16:51:37,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-08-30 16:51:37,674 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-08-30 16:51:37,674 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:51:37,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 16:51:37,677 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-08-30 16:51:41,322 INFO L134 LiptonReduction]: Checked pairs total: 8670 [2023-08-30 16:51:41,322 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-30 16:51:41,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:51:41,340 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@22f73589, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:51:41,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:51:41,343 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 16:51:41,344 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:51:41,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:41,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:51:41,345 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:41,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:41,349 INFO L85 PathProgramCache]: Analyzing trace with hash 553466, now seen corresponding path program 1 times [2023-08-30 16:51:41,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:41,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908400540] [2023-08-30 16:51:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:41,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:41,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:41,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908400540] [2023-08-30 16:51:41,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908400540] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:41,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:41,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:51:41,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523663873] [2023-08-30 16:51:41,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:41,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:51:41,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:41,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:51:41,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:51:41,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242 [2023-08-30 16:51:41,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:41,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:41,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242 [2023-08-30 16:51:41,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:42,887 INFO L130 PetriNetUnfolder]: 5879/8107 cut-off events. [2023-08-30 16:51:42,887 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-08-30 16:51:42,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16251 conditions, 8107 events. 5879/8107 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 40886 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16239. Up to 6367 conditions per place. [2023-08-30 16:51:42,962 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-30 16:51:42,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-08-30 16:51:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:51:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:51:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-30 16:51:42,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5482093663911846 [2023-08-30 16:51:42,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-30 16:51:42,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-30 16:51:42,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:42,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-30 16:51:42,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:42,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:42,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:42,990 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 398 transitions. [2023-08-30 16:51:42,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-08-30 16:51:42,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:51:42,995 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-30 16:51:42,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 16:51:43,000 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 16:51:43,001 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-30 16:51:43,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:43,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:43,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:43,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:51:43,002 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:43,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:43,003 INFO L85 PathProgramCache]: Analyzing trace with hash -301813989, now seen corresponding path program 1 times [2023-08-30 16:51:43,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:43,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386953471] [2023-08-30 16:51:43,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:43,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:43,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386953471] [2023-08-30 16:51:43,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386953471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:43,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:43,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:51:43,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641272343] [2023-08-30 16:51:43,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:43,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:51:43,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:43,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:51:43,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:51:43,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:51:43,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:43,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:43,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:51:43,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:44,274 INFO L130 PetriNetUnfolder]: 5847/7943 cut-off events. [2023-08-30 16:51:44,275 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2023-08-30 16:51:44,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16607 conditions, 7943 events. 5847/7943 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 37764 event pairs, 1383 based on Foata normal form. 32/7969 useless extension candidates. Maximal degree in co-relation 16597. Up to 7393 conditions per place. [2023-08-30 16:51:44,320 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 36 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-08-30 16:51:44,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 176 flow [2023-08-30 16:51:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:51:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:51:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-30 16:51:44,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261707988980716 [2023-08-30 16:51:44,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-30 16:51:44,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-30 16:51:44,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:44,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-30 16:51:44,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,330 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 382 transitions. [2023-08-30 16:51:44,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 176 flow [2023-08-30 16:51:44,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:51:44,333 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 83 flow [2023-08-30 16:51:44,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-30 16:51:44,334 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 16:51:44,334 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 83 flow [2023-08-30 16:51:44,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:44,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:44,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:51:44,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:44,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:44,338 INFO L85 PathProgramCache]: Analyzing trace with hash -766301092, now seen corresponding path program 1 times [2023-08-30 16:51:44,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:44,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143245195] [2023-08-30 16:51:44,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:44,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:44,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:44,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143245195] [2023-08-30 16:51:44,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143245195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:44,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:44,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:51:44,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718842231] [2023-08-30 16:51:44,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:44,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:44,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:44,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:44,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-08-30 16:51:44,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:44,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-08-30 16:51:44,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:46,442 INFO L130 PetriNetUnfolder]: 13113/17854 cut-off events. [2023-08-30 16:51:46,442 INFO L131 PetriNetUnfolder]: For 1835/1835 co-relation queries the response was YES. [2023-08-30 16:51:46,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38015 conditions, 17854 events. 13113/17854 cut-off events. For 1835/1835 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 88866 event pairs, 2914 based on Foata normal form. 620/18474 useless extension candidates. Maximal degree in co-relation 38004. Up to 8372 conditions per place. [2023-08-30 16:51:46,531 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 54 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2023-08-30 16:51:46,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 271 flow [2023-08-30 16:51:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-08-30 16:51:46,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010330578512396 [2023-08-30 16:51:46,533 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-08-30 16:51:46,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-08-30 16:51:46,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:46,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-08-30 16:51:46,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,538 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,538 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 83 flow. Second operand 4 states and 485 transitions. [2023-08-30 16:51:46,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 271 flow [2023-08-30 16:51:46,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:46,541 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 134 flow [2023-08-30 16:51:46,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-30 16:51:46,543 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-30 16:51:46,545 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 134 flow [2023-08-30 16:51:46,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:46,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:46,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:51:46,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:46,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2012133723, now seen corresponding path program 1 times [2023-08-30 16:51:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:46,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286295902] [2023-08-30 16:51:46,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:46,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286295902] [2023-08-30 16:51:46,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286295902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:46,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:46,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:51:46,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305359353] [2023-08-30 16:51:46,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:46,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:51:46,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:46,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:51:46,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:51:46,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:51:46,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:46,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:51:46,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:48,433 INFO L130 PetriNetUnfolder]: 10592/14921 cut-off events. [2023-08-30 16:51:48,434 INFO L131 PetriNetUnfolder]: For 6937/6976 co-relation queries the response was YES. [2023-08-30 16:51:48,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36857 conditions, 14921 events. 10592/14921 cut-off events. For 6937/6976 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 83016 event pairs, 3378 based on Foata normal form. 34/14586 useless extension candidates. Maximal degree in co-relation 36842. Up to 13586 conditions per place. [2023-08-30 16:51:48,524 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 44 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2023-08-30 16:51:48,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 286 flow [2023-08-30 16:51:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:51:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:51:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-30 16:51:48,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5316804407713499 [2023-08-30 16:51:48,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-30 16:51:48,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-30 16:51:48,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:48,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-30 16:51:48,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,534 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 134 flow. Second operand 3 states and 386 transitions. [2023-08-30 16:51:48,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 286 flow [2023-08-30 16:51:48,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:48,558 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 166 flow [2023-08-30 16:51:48,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-30 16:51:48,560 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2023-08-30 16:51:48,560 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 166 flow [2023-08-30 16:51:48,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:48,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:48,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:51:48,561 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:48,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:48,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2048365308, now seen corresponding path program 1 times [2023-08-30 16:51:48,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364805490] [2023-08-30 16:51:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:48,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:48,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364805490] [2023-08-30 16:51:48,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364805490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:48,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:48,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611874425] [2023-08-30 16:51:48,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:48,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:48,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:48,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:48,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:48,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:51:48,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:48,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:51:48,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:50,005 INFO L130 PetriNetUnfolder]: 8636/12594 cut-off events. [2023-08-30 16:51:50,006 INFO L131 PetriNetUnfolder]: For 6854/7046 co-relation queries the response was YES. [2023-08-30 16:51:50,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31177 conditions, 12594 events. 8636/12594 cut-off events. For 6854/7046 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 75774 event pairs, 1565 based on Foata normal form. 1026/13313 useless extension candidates. Maximal degree in co-relation 31160. Up to 7706 conditions per place. [2023-08-30 16:51:50,090 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 80 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2023-08-30 16:51:50,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 99 transitions, 552 flow [2023-08-30 16:51:50,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:51:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:51:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2023-08-30 16:51:50,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2023-08-30 16:51:50,093 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2023-08-30 16:51:50,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2023-08-30 16:51:50,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:50,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2023-08-30 16:51:50,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:50,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:50,099 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:50,099 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 166 flow. Second operand 5 states and 616 transitions. [2023-08-30 16:51:50,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 99 transitions, 552 flow [2023-08-30 16:51:50,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 99 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:50,103 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 237 flow [2023-08-30 16:51:50,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2023-08-30 16:51:50,104 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2023-08-30 16:51:50,105 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 237 flow [2023-08-30 16:51:50,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:50,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:50,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:50,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:51:50,106 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:50,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:50,106 INFO L85 PathProgramCache]: Analyzing trace with hash 723177800, now seen corresponding path program 1 times [2023-08-30 16:51:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40585173] [2023-08-30 16:51:50,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:50,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:50,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:50,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40585173] [2023-08-30 16:51:50,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40585173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:50,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:50,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:51:50,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601301785] [2023-08-30 16:51:50,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:50,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:51:50,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:50,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:51:50,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:51:50,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:51:50,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:50,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:50,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:51:50,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:52,703 INFO L130 PetriNetUnfolder]: 13873/20171 cut-off events. [2023-08-30 16:51:52,703 INFO L131 PetriNetUnfolder]: For 22292/22501 co-relation queries the response was YES. [2023-08-30 16:51:52,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64483 conditions, 20171 events. 13873/20171 cut-off events. For 22292/22501 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 126114 event pairs, 3273 based on Foata normal form. 251/20365 useless extension candidates. Maximal degree in co-relation 64462. Up to 12801 conditions per place. [2023-08-30 16:51:52,813 INFO L137 encePairwiseOnDemand]: 232/242 looper letters, 116 selfloop transitions, 21 changer transitions 20/164 dead transitions. [2023-08-30 16:51:52,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 164 transitions, 1055 flow [2023-08-30 16:51:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:51:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:51:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-08-30 16:51:52,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525974025974026 [2023-08-30 16:51:52,816 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-08-30 16:51:52,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-08-30 16:51:52,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:52,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-08-30 16:51:52,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:52,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:52,821 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:52,821 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 237 flow. Second operand 7 states and 891 transitions. [2023-08-30 16:51:52,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 164 transitions, 1055 flow [2023-08-30 16:51:52,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 164 transitions, 1043 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:52,866 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 395 flow [2023-08-30 16:51:52,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2023-08-30 16:51:52,867 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2023-08-30 16:51:52,867 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 395 flow [2023-08-30 16:51:52,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:52,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:52,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:52,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:51:52,868 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:52,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1262927896, now seen corresponding path program 1 times [2023-08-30 16:51:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478249603] [2023-08-30 16:51:52,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:53,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:53,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478249603] [2023-08-30 16:51:53,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478249603] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:53,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:53,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:51:53,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568042614] [2023-08-30 16:51:53,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:53,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:51:53,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:53,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:51:53,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:51:53,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:51:53,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:53,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:53,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:51:53,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:55,152 INFO L130 PetriNetUnfolder]: 16134/23539 cut-off events. [2023-08-30 16:51:55,153 INFO L131 PetriNetUnfolder]: For 40200/40487 co-relation queries the response was YES. [2023-08-30 16:51:55,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85190 conditions, 23539 events. 16134/23539 cut-off events. For 40200/40487 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 153127 event pairs, 5395 based on Foata normal form. 367/23415 useless extension candidates. Maximal degree in co-relation 85164. Up to 12321 conditions per place. [2023-08-30 16:51:55,267 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 87 selfloop transitions, 6 changer transitions 17/116 dead transitions. [2023-08-30 16:51:55,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 879 flow [2023-08-30 16:51:55,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:51:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:51:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-30 16:51:55,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344352617079889 [2023-08-30 16:51:55,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-30 16:51:55,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-30 16:51:55,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:55,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-30 16:51:55,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:55,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:55,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:55,274 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 395 flow. Second operand 3 states and 388 transitions. [2023-08-30 16:51:55,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 879 flow [2023-08-30 16:51:55,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 116 transitions, 867 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-30 16:51:55,341 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 380 flow [2023-08-30 16:51:55,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-08-30 16:51:55,342 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-08-30 16:51:55,343 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 380 flow [2023-08-30 16:51:55,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:55,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:55,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:55,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:51:55,344 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:55,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:55,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1298934704, now seen corresponding path program 1 times [2023-08-30 16:51:55,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:55,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778542469] [2023-08-30 16:51:55,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:55,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778542469] [2023-08-30 16:51:55,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778542469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:55,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:55,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:55,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257146729] [2023-08-30 16:51:55,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:55,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:55,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:55,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:55,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:55,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:51:55,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 380 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:55,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:55,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:51:55,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:57,237 INFO L130 PetriNetUnfolder]: 9724/14518 cut-off events. [2023-08-30 16:51:57,237 INFO L131 PetriNetUnfolder]: For 24350/24620 co-relation queries the response was YES. [2023-08-30 16:51:57,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52228 conditions, 14518 events. 9724/14518 cut-off events. For 24350/24620 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 94626 event pairs, 1113 based on Foata normal form. 1143/15205 useless extension candidates. Maximal degree in co-relation 52200. Up to 4554 conditions per place. [2023-08-30 16:51:57,304 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 156 selfloop transitions, 15 changer transitions 4/185 dead transitions. [2023-08-30 16:51:57,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 185 transitions, 1385 flow [2023-08-30 16:51:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:51:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:51:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2023-08-30 16:51:57,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5082644628099173 [2023-08-30 16:51:57,312 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2023-08-30 16:51:57,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2023-08-30 16:51:57,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:57,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2023-08-30 16:51:57,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:57,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:57,321 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:57,321 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 380 flow. Second operand 7 states and 861 transitions. [2023-08-30 16:51:57,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 185 transitions, 1385 flow [2023-08-30 16:51:57,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 185 transitions, 1349 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-30 16:51:57,415 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 464 flow [2023-08-30 16:51:57,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=464, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2023-08-30 16:51:57,416 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-08-30 16:51:57,416 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 464 flow [2023-08-30 16:51:57,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:57,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:57,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:57,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:51:57,417 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:57,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash -49535294, now seen corresponding path program 1 times [2023-08-30 16:51:57,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:57,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125304466] [2023-08-30 16:51:57,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:51:57,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:57,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125304466] [2023-08-30 16:51:57,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125304466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:57,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:57,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:51:57,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856129062] [2023-08-30 16:51:57,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:57,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:57,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:57,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:57,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:57,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:51:57,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:57,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:57,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:51:57,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:59,144 INFO L130 PetriNetUnfolder]: 9016/13444 cut-off events. [2023-08-30 16:51:59,144 INFO L131 PetriNetUnfolder]: For 26772/27008 co-relation queries the response was YES. [2023-08-30 16:51:59,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53611 conditions, 13444 events. 9016/13444 cut-off events. For 26772/27008 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 87257 event pairs, 949 based on Foata normal form. 470/13474 useless extension candidates. Maximal degree in co-relation 53581. Up to 4323 conditions per place. [2023-08-30 16:51:59,249 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 168 selfloop transitions, 24 changer transitions 18/220 dead transitions. [2023-08-30 16:51:59,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 220 transitions, 1715 flow [2023-08-30 16:51:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:51:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:51:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1108 transitions. [2023-08-30 16:51:59,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087235996326905 [2023-08-30 16:51:59,254 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1108 transitions. [2023-08-30 16:51:59,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1108 transitions. [2023-08-30 16:51:59,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:59,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1108 transitions. [2023-08-30 16:51:59,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.11111111111111) internal successors, (1108), 9 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:59,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:59,261 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:59,261 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 464 flow. Second operand 9 states and 1108 transitions. [2023-08-30 16:51:59,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 220 transitions, 1715 flow [2023-08-30 16:52:00,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 220 transitions, 1670 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-30 16:52:00,123 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 589 flow [2023-08-30 16:52:00,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=589, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2023-08-30 16:52:00,124 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2023-08-30 16:52:00,124 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 589 flow [2023-08-30 16:52:00,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:00,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:00,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:00,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:52:00,125 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:00,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1844135116, now seen corresponding path program 1 times [2023-08-30 16:52:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047195770] [2023-08-30 16:52:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:00,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:52:00,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:00,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047195770] [2023-08-30 16:52:00,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047195770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:00,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:00,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:52:00,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853352381] [2023-08-30 16:52:00,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:00,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:52:00,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:00,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:52:00,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:52:00,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:52:00,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 589 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:00,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:00,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:52:00,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:02,953 INFO L130 PetriNetUnfolder]: 12606/19866 cut-off events. [2023-08-30 16:52:02,953 INFO L131 PetriNetUnfolder]: For 60120/60512 co-relation queries the response was YES. [2023-08-30 16:52:03,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84810 conditions, 19866 events. 12606/19866 cut-off events. For 60120/60512 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 145362 event pairs, 2508 based on Foata normal form. 249/19891 useless extension candidates. Maximal degree in co-relation 84777. Up to 7979 conditions per place. [2023-08-30 16:52:03,090 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 147 selfloop transitions, 11 changer transitions 77/245 dead transitions. [2023-08-30 16:52:03,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 245 transitions, 2468 flow [2023-08-30 16:52:03,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:52:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:52:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2023-08-30 16:52:03,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159386068476978 [2023-08-30 16:52:03,093 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2023-08-30 16:52:03,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2023-08-30 16:52:03,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:03,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2023-08-30 16:52:03,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:03,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:03,099 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:03,099 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 589 flow. Second operand 7 states and 874 transitions. [2023-08-30 16:52:03,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 245 transitions, 2468 flow [2023-08-30 16:52:05,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 245 transitions, 2052 flow, removed 162 selfloop flow, removed 3 redundant places. [2023-08-30 16:52:05,158 INFO L231 Difference]: Finished difference. Result has 85 places, 85 transitions, 609 flow [2023-08-30 16:52:05,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=609, PETRI_PLACES=85, PETRI_TRANSITIONS=85} [2023-08-30 16:52:05,158 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2023-08-30 16:52:05,159 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 609 flow [2023-08-30 16:52:05,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:05,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:05,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:05,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:52:05,160 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:05,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:05,160 INFO L85 PathProgramCache]: Analyzing trace with hash 705164732, now seen corresponding path program 2 times [2023-08-30 16:52:05,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:05,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8511837] [2023-08-30 16:52:05,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:05,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:52:05,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:05,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8511837] [2023-08-30 16:52:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8511837] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:05,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:05,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:52:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089589120] [2023-08-30 16:52:05,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:05,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:52:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:05,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:52:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:52:05,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:52:05,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 609 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:05,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:05,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:52:05,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:07,528 INFO L130 PetriNetUnfolder]: 10789/16441 cut-off events. [2023-08-30 16:52:07,529 INFO L131 PetriNetUnfolder]: For 41227/41495 co-relation queries the response was YES. [2023-08-30 16:52:07,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67816 conditions, 16441 events. 10789/16441 cut-off events. For 41227/41495 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 114785 event pairs, 1019 based on Foata normal form. 242/16190 useless extension candidates. Maximal degree in co-relation 67783. Up to 4137 conditions per place. [2023-08-30 16:52:07,624 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 171 selfloop transitions, 28 changer transitions 41/248 dead transitions. [2023-08-30 16:52:07,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 248 transitions, 2081 flow [2023-08-30 16:52:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:52:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:52:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1325 transitions. [2023-08-30 16:52:07,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4977460555972953 [2023-08-30 16:52:07,628 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1325 transitions. [2023-08-30 16:52:07,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1325 transitions. [2023-08-30 16:52:07,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:07,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1325 transitions. [2023-08-30 16:52:07,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.45454545454545) internal successors, (1325), 11 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:07,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:07,636 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:07,636 INFO L175 Difference]: Start difference. First operand has 85 places, 85 transitions, 609 flow. Second operand 11 states and 1325 transitions. [2023-08-30 16:52:07,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 248 transitions, 2081 flow [2023-08-30 16:52:08,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 248 transitions, 2035 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-30 16:52:08,503 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 634 flow [2023-08-30 16:52:08,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=634, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2023-08-30 16:52:08,504 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2023-08-30 16:52:08,504 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 634 flow [2023-08-30 16:52:08,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:08,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:08,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:08,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:52:08,505 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:08,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:08,505 INFO L85 PathProgramCache]: Analyzing trace with hash 10147915, now seen corresponding path program 1 times [2023-08-30 16:52:08,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:08,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145640307] [2023-08-30 16:52:08,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:08,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:52:09,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:09,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145640307] [2023-08-30 16:52:09,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145640307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:09,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:09,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:52:09,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047087997] [2023-08-30 16:52:09,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:09,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:52:09,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:09,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:52:09,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:52:09,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:52:09,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 634 flow. Second operand has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:09,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:09,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:52:09,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:10,697 INFO L130 PetriNetUnfolder]: 6243/9938 cut-off events. [2023-08-30 16:52:10,697 INFO L131 PetriNetUnfolder]: For 29385/29605 co-relation queries the response was YES. [2023-08-30 16:52:10,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43626 conditions, 9938 events. 6243/9938 cut-off events. For 29385/29605 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 66637 event pairs, 866 based on Foata normal form. 152/9928 useless extension candidates. Maximal degree in co-relation 43587. Up to 3517 conditions per place. [2023-08-30 16:52:10,749 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 147 selfloop transitions, 5 changer transitions 72/232 dead transitions. [2023-08-30 16:52:10,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 232 transitions, 2264 flow [2023-08-30 16:52:10,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:52:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:52:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 761 transitions. [2023-08-30 16:52:10,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241046831955923 [2023-08-30 16:52:10,752 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 761 transitions. [2023-08-30 16:52:10,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 761 transitions. [2023-08-30 16:52:10,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:10,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 761 transitions. [2023-08-30 16:52:10,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:10,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:10,757 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:10,757 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 634 flow. Second operand 6 states and 761 transitions. [2023-08-30 16:52:10,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 232 transitions, 2264 flow [2023-08-30 16:52:11,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 232 transitions, 1861 flow, removed 86 selfloop flow, removed 12 redundant places. [2023-08-30 16:52:11,064 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 493 flow [2023-08-30 16:52:11,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=493, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2023-08-30 16:52:11,065 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-08-30 16:52:11,065 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 493 flow [2023-08-30 16:52:11,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:11,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:11,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:11,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:52:11,066 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:11,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash 584122205, now seen corresponding path program 2 times [2023-08-30 16:52:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:11,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730146228] [2023-08-30 16:52:11,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:11,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:52:11,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:11,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730146228] [2023-08-30 16:52:11,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730146228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:11,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:11,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:52:11,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817200575] [2023-08-30 16:52:11,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:11,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:52:11,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:11,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:52:11,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:52:11,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-08-30 16:52:11,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 493 flow. Second operand 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) [2023-08-30 16:52:11,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:11,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-08-30 16:52:11,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:12,383 INFO L130 PetriNetUnfolder]: 8127/12652 cut-off events. [2023-08-30 16:52:12,383 INFO L131 PetriNetUnfolder]: For 34102/34102 co-relation queries the response was YES. [2023-08-30 16:52:12,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52326 conditions, 12652 events. 8127/12652 cut-off events. For 34102/34102 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 79979 event pairs, 1525 based on Foata normal form. 2/12654 useless extension candidates. Maximal degree in co-relation 52295. Up to 5969 conditions per place. [2023-08-30 16:52:12,447 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 93 selfloop transitions, 6 changer transitions 77/176 dead transitions. [2023-08-30 16:52:12,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 176 transitions, 1490 flow [2023-08-30 16:52:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:52:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:52:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-08-30 16:52:12,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072314049586777 [2023-08-30 16:52:12,449 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-08-30 16:52:12,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-08-30 16:52:12,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:12,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-08-30 16:52:12,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:12,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:12,453 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:12,453 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 493 flow. Second operand 4 states and 491 transitions. [2023-08-30 16:52:12,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 176 transitions, 1490 flow [2023-08-30 16:52:12,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 176 transitions, 1449 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-30 16:52:12,741 INFO L231 Difference]: Finished difference. Result has 86 places, 58 transitions, 371 flow [2023-08-30 16:52:12,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=371, PETRI_PLACES=86, PETRI_TRANSITIONS=58} [2023-08-30 16:52:12,742 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-08-30 16:52:12,742 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 58 transitions, 371 flow [2023-08-30 16:52:12,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2023-08-30 16:52:12,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:12,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:12,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:52:12,743 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:12,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash 669502323, now seen corresponding path program 3 times [2023-08-30 16:52:12,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:12,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542975382] [2023-08-30 16:52:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:12,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:52:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542975382] [2023-08-30 16:52:12,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542975382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:12,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:12,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:52:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375309097] [2023-08-30 16:52:12,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:12,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:52:12,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:12,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:52:12,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:52:12,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-08-30 16:52:12,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 58 transitions, 371 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:12,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:12,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-08-30 16:52:12,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:13,344 INFO L130 PetriNetUnfolder]: 1956/3174 cut-off events. [2023-08-30 16:52:13,344 INFO L131 PetriNetUnfolder]: For 6919/6940 co-relation queries the response was YES. [2023-08-30 16:52:13,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12540 conditions, 3174 events. 1956/3174 cut-off events. For 6919/6940 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 16401 event pairs, 603 based on Foata normal form. 2/3168 useless extension candidates. Maximal degree in co-relation 12504. Up to 1542 conditions per place. [2023-08-30 16:52:13,356 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 46 selfloop transitions, 1 changer transitions 49/98 dead transitions. [2023-08-30 16:52:13,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 98 transitions, 791 flow [2023-08-30 16:52:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:52:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:52:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2023-08-30 16:52:13,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196280991735537 [2023-08-30 16:52:13,358 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2023-08-30 16:52:13,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2023-08-30 16:52:13,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:13,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2023-08-30 16:52:13,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:13,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:13,361 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:13,362 INFO L175 Difference]: Start difference. First operand has 86 places, 58 transitions, 371 flow. Second operand 4 states and 503 transitions. [2023-08-30 16:52:13,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 98 transitions, 791 flow [2023-08-30 16:52:13,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 98 transitions, 722 flow, removed 28 selfloop flow, removed 10 redundant places. [2023-08-30 16:52:13,392 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 253 flow [2023-08-30 16:52:13,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2023-08-30 16:52:13,393 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-08-30 16:52:13,393 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 253 flow [2023-08-30 16:52:13,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:13,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:13,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:13,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:52:13,394 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:13,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash 398974387, now seen corresponding path program 4 times [2023-08-30 16:52:13,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:13,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864003691] [2023-08-30 16:52:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:13,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:52:14,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:14,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864003691] [2023-08-30 16:52:14,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864003691] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:14,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:14,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:52:14,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936131010] [2023-08-30 16:52:14,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:14,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:52:14,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:14,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:52:14,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:52:14,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-30 16:52:14,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 253 flow. Second operand has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:14,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:14,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-30 16:52:14,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:14,445 INFO L130 PetriNetUnfolder]: 588/990 cut-off events. [2023-08-30 16:52:14,446 INFO L131 PetriNetUnfolder]: For 1609/1621 co-relation queries the response was YES. [2023-08-30 16:52:14,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 990 events. 588/990 cut-off events. For 1609/1621 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4143 event pairs, 82 based on Foata normal form. 13/1003 useless extension candidates. Maximal degree in co-relation 3653. Up to 427 conditions per place. [2023-08-30 16:52:14,451 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 72 selfloop transitions, 6 changer transitions 31/112 dead transitions. [2023-08-30 16:52:14,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 112 transitions, 810 flow [2023-08-30 16:52:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:52:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:52:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 841 transitions. [2023-08-30 16:52:14,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4964580873671783 [2023-08-30 16:52:14,454 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 841 transitions. [2023-08-30 16:52:14,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 841 transitions. [2023-08-30 16:52:14,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:14,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 841 transitions. [2023-08-30 16:52:14,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:14,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:14,459 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:14,459 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 253 flow. Second operand 7 states and 841 transitions. [2023-08-30 16:52:14,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 112 transitions, 810 flow [2023-08-30 16:52:14,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 759 flow, removed 11 selfloop flow, removed 10 redundant places. [2023-08-30 16:52:14,468 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 236 flow [2023-08-30 16:52:14,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2023-08-30 16:52:14,469 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-08-30 16:52:14,469 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 236 flow [2023-08-30 16:52:14,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:14,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:14,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:14,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:52:14,470 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:14,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:14,471 INFO L85 PathProgramCache]: Analyzing trace with hash 737174925, now seen corresponding path program 5 times [2023-08-30 16:52:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:14,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138252897] [2023-08-30 16:52:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:52:14,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:52:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:52:14,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:52:14,619 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:52:14,621 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:52:14,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:52:14,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:52:14,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:52:14,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:52:14,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:52:14,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:52:14,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 16:52:14,626 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:14,631 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:52:14,632 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:52:14,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:52:14 BasicIcfg [2023-08-30 16:52:14,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:52:14,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:52:14,732 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:52:14,732 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:52:14,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:51:37" (3/4) ... [2023-08-30 16:52:14,734 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:52:14,825 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:52:14,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:52:14,825 INFO L158 Benchmark]: Toolchain (without parser) took 38817.06ms. Allocated memory was 67.1MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 35.8MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-08-30 16:52:14,826 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 67.1MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:52:14,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.77ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 35.6MB in the beginning and 51.5MB in the end (delta: -15.9MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2023-08-30 16:52:14,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.43ms. Allocated memory is still 86.0MB. Free memory was 51.5MB in the beginning and 49.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:52:14,827 INFO L158 Benchmark]: Boogie Preprocessor took 58.56ms. Allocated memory is still 86.0MB. Free memory was 49.1MB in the beginning and 47.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:52:14,827 INFO L158 Benchmark]: RCFGBuilder took 757.31ms. Allocated memory is still 86.0MB. Free memory was 47.0MB in the beginning and 62.1MB in the end (delta: -15.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2023-08-30 16:52:14,827 INFO L158 Benchmark]: TraceAbstraction took 37272.74ms. Allocated memory was 86.0MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 61.6MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-08-30 16:52:14,828 INFO L158 Benchmark]: Witness Printer took 93.16ms. Allocated memory is still 4.3GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:52:14,830 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 67.1MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.77ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 35.6MB in the beginning and 51.5MB in the end (delta: -15.9MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.43ms. Allocated memory is still 86.0MB. Free memory was 51.5MB in the beginning and 49.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.56ms. Allocated memory is still 86.0MB. Free memory was 49.1MB in the beginning and 47.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 757.31ms. Allocated memory is still 86.0MB. Free memory was 47.0MB in the beginning and 62.1MB in the end (delta: -15.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 37272.74ms. Allocated memory was 86.0MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 61.6MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 93.16ms. Allocated memory is still 4.3GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 139 PlacesBefore, 43 PlacesAfterwards, 128 TransitionsBefore, 31 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 8670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3431, independent: 3211, independent conditional: 0, independent unconditional: 3211, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1766, independent: 1718, independent conditional: 0, independent unconditional: 1718, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3431, independent: 1493, independent conditional: 0, independent unconditional: 1493, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 1766, unknown conditional: 0, unknown unconditional: 1766] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1217; [L870] FCALL, FORK 0 pthread_create(&t1217, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1217, ((void *)0), P0, ((void *)0))=-3, t1217={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1218; [L872] FCALL, FORK 0 pthread_create(&t1218, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1218, ((void *)0), P1, ((void *)0))=-2, t1217={5:0}, t1218={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1219; [L874] FCALL, FORK 0 pthread_create(&t1219, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1219, ((void *)0), P2, ((void *)0))=-1, t1217={5:0}, t1218={6:0}, t1219={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1220; [L876] FCALL, FORK 0 pthread_create(&t1220, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1220, ((void *)0), P3, ((void *)0))=0, t1217={5:0}, t1218={6:0}, t1219={7:0}, t1220={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L802] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L822] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1217={5:0}, t1218={6:0}, t1219={7:0}, t1220={3:0}, weak$$choice2=0, x=1, y=2, z=2] [L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] - 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: 874]: 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: 876]: 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: 872]: 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: 870]: 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 9 procedures, 170 locations, 7 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: 37.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 953 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 818 mSDsluCounter, 350 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 288 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2482 IncrementalHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 62 mSDtfsCounter, 2482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=11, InterpolantAutomatonStates: 83, 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, 5.4s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 1967 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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! [2023-08-30 16:52:14,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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